./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/matrix_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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 /storage/repos/svcomp/c/loops/matrix_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77bbd25ad99103bdffda3bd7f6a6e3c182ec06ae ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 10:51:24,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:51:24,734 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:51:24,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:51:24,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:51:24,755 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:51:24,756 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:51:24,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:51:24,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:51:24,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:51:24,765 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:51:24,765 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:51:24,766 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:51:24,769 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:51:24,771 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:51:24,777 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:51:24,778 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:51:24,782 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:51:24,787 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:51:24,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:51:24,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:51:24,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:51:24,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:51:24,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:51:24,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:51:24,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:51:24,800 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:51:24,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:51:24,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:51:24,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:51:24,804 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:51:24,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:51:24,807 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:51:24,807 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:51:24,808 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:51:24,809 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:51:24,811 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 10:51:24,824 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:51:24,825 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:51:24,826 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:51:24,826 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:51:24,826 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:51:24,826 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:51:24,827 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:51:24,827 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 10:51:24,827 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:51:24,827 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:51:24,827 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:51:24,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:51:24,828 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:51:24,828 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:51:24,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:51:24,828 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:51:24,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:51:24,829 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:51:24,829 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:51:24,829 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:51:24,829 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:51:24,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:51:24,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:51:24,830 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:51:24,830 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:51:24,830 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 10:51:24,830 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:51:24,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 10:51:24,831 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 -> 77bbd25ad99103bdffda3bd7f6a6e3c182ec06ae [2019-01-12 10:51:24,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:51:24,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:51:24,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:51:24,894 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:51:24,894 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:51:24,895 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/matrix_true-unreach-call_true-termination.i [2019-01-12 10:51:24,942 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f151c49/021d03668c83465ea12d6987fa6bc423/FLAG3a50ecd33 [2019-01-12 10:51:25,401 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:51:25,402 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/matrix_true-unreach-call_true-termination.i [2019-01-12 10:51:25,408 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f151c49/021d03668c83465ea12d6987fa6bc423/FLAG3a50ecd33 [2019-01-12 10:51:25,836 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f151c49/021d03668c83465ea12d6987fa6bc423 [2019-01-12 10:51:25,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:51:25,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:51:25,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:51:25,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:51:25,846 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:51:25,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:51:25" (1/1) ... [2019-01-12 10:51:25,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1271ba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:25, skipping insertion in model container [2019-01-12 10:51:25,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:51:25" (1/1) ... [2019-01-12 10:51:25,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:51:25,877 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:51:26,052 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:51:26,057 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:51:26,083 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:51:26,112 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:51:26,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26 WrapperNode [2019-01-12 10:51:26,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:51:26,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:51:26,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:51:26,114 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:51:26,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26" (1/1) ... [2019-01-12 10:51:26,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26" (1/1) ... [2019-01-12 10:51:26,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:51:26,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:51:26,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:51:26,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:51:26,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26" (1/1) ... [2019-01-12 10:51:26,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26" (1/1) ... [2019-01-12 10:51:26,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26" (1/1) ... [2019-01-12 10:51:26,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26" (1/1) ... [2019-01-12 10:51:26,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26" (1/1) ... [2019-01-12 10:51:26,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26" (1/1) ... [2019-01-12 10:51:26,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26" (1/1) ... [2019-01-12 10:51:26,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:51:26,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:51:26,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:51:26,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:51:26,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51: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 [2019-01-12 10:51:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 10:51:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:51:26,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:51:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 10:51:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 10:51:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 10:51:26,667 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:51:26,668 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 10:51:26,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:51:26 BoogieIcfgContainer [2019-01-12 10:51:26,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:51:26,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:51:26,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:51:26,674 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:51:26,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:51:25" (1/3) ... [2019-01-12 10:51:26,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d255b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:51:26, skipping insertion in model container [2019-01-12 10:51:26,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:51:26" (2/3) ... [2019-01-12 10:51:26,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d255b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:51:26, skipping insertion in model container [2019-01-12 10:51:26,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:51:26" (3/3) ... [2019-01-12 10:51:26,677 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix_true-unreach-call_true-termination.i [2019-01-12 10:51:26,687 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:51:26,695 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:51:26,712 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:51:26,741 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:51:26,741 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:51:26,741 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:51:26,742 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:51:26,742 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:51:26,742 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:51:26,742 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:51:26,742 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:51:26,742 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:51:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 10:51:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-12 10:51:26,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:51:26,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-12 10:51:26,775 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:51:26,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:51:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash 889621918, now seen corresponding path program 1 times [2019-01-12 10:51:26,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:51:26,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:51:26,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:26,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:51:26,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:26,853 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-12 10:51:26,853 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-12 10:51:26,853 INFO L223 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-12 10:51:26,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:51:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:51:26,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:51:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:51:26,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:51:26,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 10:51:26,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 10:51:27,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 10:51:27,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 10:51:27,011 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-12 10:51:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:51:27,093 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2019-01-12 10:51:27,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 10:51:27,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-12 10:51:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:51:27,109 INFO L225 Difference]: With dead ends: 33 [2019-01-12 10:51:27,110 INFO L226 Difference]: Without dead ends: 16 [2019-01-12 10:51:27,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 10:51:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-12 10:51:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2019-01-12 10:51:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 10:51:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-12 10:51:27,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2019-01-12 10:51:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:51:27,146 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-12 10:51:27,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 10:51:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-12 10:51:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 10:51:27,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:51:27,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:51:27,148 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:51:27,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:51:27,148 INFO L82 PathProgramCache]: Analyzing trace with hash -235638193, now seen corresponding path program 1 times [2019-01-12 10:51:27,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:51:27,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:51:27,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:27,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:51:27,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:27,154 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-12 10:51:27,155 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-12 10:51:27,155 INFO L223 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-12 10:51:27,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:51:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:51:27,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:51:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:51:27,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:51:27,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:51:27,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:51:27,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:51:27,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:51:27,290 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 4 states. [2019-01-12 10:51:27,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:51:27,464 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-01-12 10:51:27,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:51:27,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-12 10:51:27,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:51:27,466 INFO L225 Difference]: With dead ends: 28 [2019-01-12 10:51:27,466 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 10:51:27,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:51:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 10:51:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2019-01-12 10:51:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-12 10:51:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-01-12 10:51:27,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2019-01-12 10:51:27,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:51:27,471 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-12 10:51:27,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:51:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-01-12 10:51:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 10:51:27,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:51:27,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:51:27,473 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:51:27,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:51:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash -589728809, now seen corresponding path program 1 times [2019-01-12 10:51:27,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:51:27,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:51:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:27,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:51:27,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:27,479 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-12 10:51:27,479 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-12 10:51:27,479 INFO L223 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-12 10:51:27,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:51:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:51:27,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:51:27,792 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-12 10:51:27,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 10:51:28,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2019-01-12 10:51:28,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-01-12 10:51:28,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 10:51:28,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:51:28,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:51:28,486 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:453, output treesize:10 [2019-01-12 10:51:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:51:28,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-12 10:51:28,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-01-12 10:51:28,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 10:51:28,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 10:51:28,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:51:28,584 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2019-01-12 10:51:28,976 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 10:51:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:51:29,120 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-01-12 10:51:29,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 10:51:29,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-12 10:51:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:51:29,121 INFO L225 Difference]: With dead ends: 29 [2019-01-12 10:51:29,122 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 10:51:29,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-12 10:51:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 10:51:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2019-01-12 10:51:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 10:51:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-01-12 10:51:29,131 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2019-01-12 10:51:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:51:29,131 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-12 10:51:29,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 10:51:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-01-12 10:51:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 10:51:29,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:51:29,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:51:29,134 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:51:29,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:51:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1399075435, now seen corresponding path program 1 times [2019-01-12 10:51:29,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:51:29,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:51:29,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:29,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:51:29,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:29,146 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-12 10:51:29,147 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-12 10:51:29,148 INFO L223 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-12 10:51:29,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:51:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:51:29,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:51:29,250 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-12 10:51:29,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 10:51:29,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-01-12 10:51:29,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-12 10:51:29,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 10:51:29,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:51:29,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:51:29,291 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:17 [2019-01-12 10:51:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:51:29,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-12 10:51:29,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-01-12 10:51:29,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 10:51:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 10:51:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:51:29,419 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 8 states. [2019-01-12 10:51:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:51:29,734 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-01-12 10:51:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 10:51:29,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-12 10:51:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:51:29,736 INFO L225 Difference]: With dead ends: 35 [2019-01-12 10:51:29,737 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 10:51:29,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-12 10:51:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 10:51:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2019-01-12 10:51:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 10:51:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-01-12 10:51:29,745 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2019-01-12 10:51:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:51:29,746 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-12 10:51:29,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 10:51:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2019-01-12 10:51:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 10:51:29,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:51:29,748 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:51:29,749 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:51:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:51:29,749 INFO L82 PathProgramCache]: Analyzing trace with hash -863591089, now seen corresponding path program 2 times [2019-01-12 10:51:29,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:51:29,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:51:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:29,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:51:29,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:29,756 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-12 10:51:29,756 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-12 10:51:29,756 INFO L223 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-12 10:51:29,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:51:29,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:51:29,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:51:29,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:51:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:51:29,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-12 10:51:29,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-01-12 10:51:29,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 10:51:29,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 10:51:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:51:29,855 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 5 states. [2019-01-12 10:51:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:51:29,926 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-01-12 10:51:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:51:29,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-12 10:51:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:51:29,928 INFO L225 Difference]: With dead ends: 37 [2019-01-12 10:51:29,929 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 10:51:29,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:51:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 10:51:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-12 10:51:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 10:51:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-01-12 10:51:29,935 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-01-12 10:51:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:51:29,936 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-12 10:51:29,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 10:51:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-01-12 10:51:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 10:51:29,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:51:29,937 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 10:51:29,937 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:51:29,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:51:29,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2141915984, now seen corresponding path program 3 times [2019-01-12 10:51:29,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:51:29,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:51:29,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:29,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:51:29,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:29,943 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-12 10:51:29,943 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-12 10:51:29,943 INFO L223 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-12 10:51:29,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:51:29,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 10:51:29,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:51:29,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:51:30,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2019-01-12 10:51:30,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-01-12 10:51:30,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:51:30,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:51:30,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:51:30,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:453, output treesize:10 [2019-01-12 10:51:30,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 81 [2019-01-12 10:51:30,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:51:30,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2019-01-12 10:51:30,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:51:30,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:51:35,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2019-01-12 10:51:35,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 54 [2019-01-12 10:51:35,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-12 10:51:35,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:51:35,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2019-01-12 10:51:35,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 58 [2019-01-12 10:51:35,437 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-12 10:51:35,471 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:51:35,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2019-01-12 10:51:35,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 58 [2019-01-12 10:51:35,819 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-12 10:51:36,025 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:51:36,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 7 xjuncts. [2019-01-12 10:51:36,690 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 16 variables, input treesize:669, output treesize:345 [2019-01-12 10:51:37,105 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-12 10:51:37,550 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 24 [2019-01-12 10:51:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:51:37,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-12 10:51:37,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-01-12 10:51:37,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 10:51:37,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 10:51:37,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:51:37,735 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 8 states. [2019-01-12 10:51:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:51:38,110 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-01-12 10:51:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 10:51:38,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-12 10:51:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:51:38,112 INFO L225 Difference]: With dead ends: 33 [2019-01-12 10:51:38,112 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 10:51:38,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-01-12 10:51:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 10:51:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-01-12 10:51:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 10:51:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-01-12 10:51:38,117 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2019-01-12 10:51:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:51:38,118 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-12 10:51:38,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 10:51:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-01-12 10:51:38,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 10:51:38,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:51:38,119 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:51:38,119 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:51:38,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:51:38,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1332569358, now seen corresponding path program 1 times [2019-01-12 10:51:38,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:51:38,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:51:38,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:38,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:51:38,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:51:38,125 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-12 10:51:38,125 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-12 10:51:38,125 INFO L223 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-12 10:51:38,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:51:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:51:38,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:51:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 10:51:38,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-12 10:51:38,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-01-12 10:51:38,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:51:38,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:51:38,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:51:38,328 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 4 states. [2019-01-12 10:51:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:51:38,370 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-12 10:51:38,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:51:38,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-12 10:51:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:51:38,371 INFO L225 Difference]: With dead ends: 29 [2019-01-12 10:51:38,371 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 10:51:38,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:51:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 10:51:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 10:51:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 10:51:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 10:51:38,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-01-12 10:51:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:51:38,373 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 10:51:38,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:51:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 10:51:38,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 10:51:38,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 10:51:38,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:51:38,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:51:38,665 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-01-12 10:51:38,776 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 22 [2019-01-12 10:51:38,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 10:51:38,781 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 26) no Hoare annotation was computed. [2019-01-12 10:51:38,781 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 26) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_main_~N_LIN~0)) (.cse1 (= 1 ULTIMATE.start_main_~N_COL~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~j~0 0)) (and .cse0 (<= (select (select |#memory_int| |ULTIMATE.start_main_~#matriz~0.base|) |ULTIMATE.start_main_~#matriz~0.offset|) ULTIMATE.start_main_~maior~0) .cse1 (= ULTIMATE.start_main_~j~0 1) (= ULTIMATE.start_main_~k~0 1)))) [2019-01-12 10:51:38,781 INFO L448 ceAbstractionStarter]: For program point L19-4(lines 19 26) no Hoare annotation was computed. [2019-01-12 10:51:38,781 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 10:51:38,781 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 10:51:38,782 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 10:51:38,782 INFO L451 ceAbstractionStarter]: At program point L30(lines 11 31) the Hoare annotation is: true [2019-01-12 10:51:38,782 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 10:51:38,782 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 10:51:38,782 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 25) no Hoare annotation was computed. [2019-01-12 10:51:38,782 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 26) no Hoare annotation was computed. [2019-01-12 10:51:38,782 INFO L444 ceAbstractionStarter]: At program point L20-3(lines 20 26) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_main_~N_LIN~0)) (.cse1 (= 1 ULTIMATE.start_main_~N_COL~0)) (.cse2 (= ULTIMATE.start_main_~j~0 0))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~k~0 0) .cse2) (and (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#matriz~0.base|) |ULTIMATE.start_main_~#matriz~0.offset|) ULTIMATE.start_main_~maior~0) .cse0 .cse1) (= ULTIMATE.start_main_~k~0 1) .cse2))) [2019-01-12 10:51:38,782 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-12 10:51:38,782 INFO L451 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2019-01-12 10:51:38,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:51:38,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:51:38,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:51:38,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:51:38,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:51:38 BoogieIcfgContainer [2019-01-12 10:51:38,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:51:38,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:51:38,801 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:51:38,801 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:51:38,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:51:26" (3/4) ... [2019-01-12 10:51:38,805 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 10:51:38,816 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-12 10:51:38,817 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 10:51:38,817 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 10:51:38,872 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 10:51:38,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:51:38,874 INFO L168 Benchmark]: Toolchain (without parser) took 13034.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -97.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:51:38,875 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:51:38,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:51:38,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.85 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:51:38,876 INFO L168 Benchmark]: Boogie Preprocessor took 89.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-12 10:51:38,878 INFO L168 Benchmark]: RCFGBuilder took 427.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-12 10:51:38,879 INFO L168 Benchmark]: TraceAbstraction took 12130.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.1 MB). Peak memory consumption was 121.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:51:38,879 INFO L168 Benchmark]: Witness Printer took 71.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:51:38,884 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.85 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 427.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12130.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.1 MB). Peak memory consumption was 121.7 MB. Max. memory is 11.5 GB. * Witness Printer took 71.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2019-01-12 10:51:38,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:51:38,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((1 == N_LIN && 1 == N_COL) && j == 0) || ((((1 == N_LIN && unknown-#memory_int-unknown[matriz][matriz] <= maior) && 1 == N_COL) && j == 1) && k == 1) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 10:51:38,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:51:38,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((1 == N_LIN && 1 == N_COL) && k == 0) && j == 0) || ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && 1 == N_LIN) && 1 == N_COL) && k == 1) && j == 0) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 12.0s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 SDtfs, 67 SDslu, 102 SDs, 0 SdLazy, 251 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=6, 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, 7 MinimizatonAttempts, 31 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 12 NumberOfFragments, 68 HoareAnnotationTreeSize, 4 FomulaSimplifications, 184 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 47 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 90 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 83 ConstructedInterpolants, 5 QuantifiedInterpolants, 16106 SizeOfPredicates, 47 NumberOfNonLiveVariables, 371 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 18/35 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...