./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/psyco/psyco_io_1_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/psyco/psyco_io_1_true-unreach-call_false-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 69c831b1eda23dac6e2f4454b4feebfba511ade3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 17:27:29,911 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 17:27:29,913 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 17:27:29,926 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 17:27:29,927 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 17:27:29,928 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 17:27:29,929 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 17:27:29,931 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 17:27:29,933 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 17:27:29,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 17:27:29,935 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 17:27:29,935 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 17:27:29,936 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 17:27:29,938 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 17:27:29,939 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 17:27:29,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 17:27:29,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 17:27:29,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 17:27:29,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 17:27:29,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 17:27:29,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 17:27:29,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 17:27:29,952 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 17:27:29,952 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 17:27:29,952 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 17:27:29,953 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 17:27:29,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 17:27:29,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 17:27:29,957 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 17:27:29,958 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 17:27:29,959 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 17:27:29,959 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 17:27:29,960 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 17:27:29,960 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 17:27:29,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 17:27:29,962 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 17:27:29,963 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 17:27:29,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 17:27:29,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 17:27:29,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 17:27:29,985 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 17:27:29,986 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 17:27:29,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 17:27:29,986 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 17:27:29,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 17:27:29,989 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 17:27:29,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 17:27:29,989 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 17:27:29,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 17:27:29,990 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 17:27:29,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 17:27:29,990 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 17:27:29,990 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 17:27:29,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 17:27:29,991 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 17:27:29,991 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 17:27:29,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 17:27:29,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 17:27:29,991 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 17:27:29,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 17:27:29,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 17:27:29,996 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 17:27:29,996 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 17:27:29,997 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 17:27:29,997 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 17:27:29,997 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 17:27:29,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 17:27:29,997 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 -> 69c831b1eda23dac6e2f4454b4feebfba511ade3 [2018-11-28 17:27:30,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 17:27:30,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 17:27:30,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 17:27:30,095 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 17:27:30,095 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 17:27:30,096 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/psyco/psyco_io_1_true-unreach-call_false-termination.c [2018-11-28 17:27:30,174 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b9a6ecd/e71dc3d6afab4551a7541c0f1f5d1ff8/FLAG75a621e3b [2018-11-28 17:27:30,678 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 17:27:30,679 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/psyco/psyco_io_1_true-unreach-call_false-termination.c [2018-11-28 17:27:30,690 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b9a6ecd/e71dc3d6afab4551a7541c0f1f5d1ff8/FLAG75a621e3b [2018-11-28 17:27:30,982 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b9a6ecd/e71dc3d6afab4551a7541c0f1f5d1ff8 [2018-11-28 17:27:30,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 17:27:30,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 17:27:30,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 17:27:30,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 17:27:30,993 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 17:27:30,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:27:30" (1/1) ... [2018-11-28 17:27:30,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45e4abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:30, skipping insertion in model container [2018-11-28 17:27:30,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:27:30" (1/1) ... [2018-11-28 17:27:31,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 17:27:31,054 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 17:27:31,313 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 17:27:31,326 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 17:27:31,398 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 17:27:31,431 INFO L195 MainTranslator]: Completed translation [2018-11-28 17:27:31,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31 WrapperNode [2018-11-28 17:27:31,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 17:27:31,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 17:27:31,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 17:27:31,434 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 17:27:31,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (1/1) ... [2018-11-28 17:27:31,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (1/1) ... [2018-11-28 17:27:31,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 17:27:31,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 17:27:31,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 17:27:31,463 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 17:27:31,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (1/1) ... [2018-11-28 17:27:31,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (1/1) ... [2018-11-28 17:27:31,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (1/1) ... [2018-11-28 17:27:31,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (1/1) ... [2018-11-28 17:27:31,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (1/1) ... [2018-11-28 17:27:31,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (1/1) ... [2018-11-28 17:27:31,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (1/1) ... [2018-11-28 17:27:31,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 17:27:31,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 17:27:31,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 17:27:31,658 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 17:27:31,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (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-11-28 17:27:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 17:27:31,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 17:27:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 17:27:31,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 17:27:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 17:27:31,722 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 17:27:32,554 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 17:27:32,554 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 17:27:32,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:27:32 BoogieIcfgContainer [2018-11-28 17:27:32,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 17:27:32,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 17:27:32,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 17:27:32,560 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 17:27:32,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:27:30" (1/3) ... [2018-11-28 17:27:32,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ce24d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:27:32, skipping insertion in model container [2018-11-28 17:27:32,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:31" (2/3) ... [2018-11-28 17:27:32,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ce24d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:27:32, skipping insertion in model container [2018-11-28 17:27:32,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:27:32" (3/3) ... [2018-11-28 17:27:32,565 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_io_1_true-unreach-call_false-termination.c [2018-11-28 17:27:32,574 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 17:27:32,581 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 17:27:32,598 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 17:27:32,630 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 17:27:32,631 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 17:27:32,631 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 17:27:32,631 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 17:27:32,632 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 17:27:32,632 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 17:27:32,632 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 17:27:32,632 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 17:27:32,632 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 17:27:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-11-28 17:27:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 17:27:32,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:32,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:32,665 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:32,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:32,672 INFO L82 PathProgramCache]: Analyzing trace with hash -901605196, now seen corresponding path program 1 times [2018-11-28 17:27:32,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:32,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:32,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:32,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:32,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:32,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 17:27:32,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 17:27:32,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 17:27:32,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 17:27:32,864 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 2 states. [2018-11-28 17:27:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:32,896 INFO L93 Difference]: Finished difference Result 136 states and 250 transitions. [2018-11-28 17:27:32,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 17:27:32,898 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-28 17:27:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:32,909 INFO L225 Difference]: With dead ends: 136 [2018-11-28 17:27:32,910 INFO L226 Difference]: Without dead ends: 61 [2018-11-28 17:27:32,913 INFO L631 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-11-28 17:27:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-28 17:27:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-28 17:27:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 17:27:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2018-11-28 17:27:32,955 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 13 [2018-11-28 17:27:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:32,956 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2018-11-28 17:27:32,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 17:27:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2018-11-28 17:27:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 17:27:32,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:32,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:32,958 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:32,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:32,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1647463811, now seen corresponding path program 1 times [2018-11-28 17:27:32,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:32,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:32,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:32,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:32,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:33,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:33,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:33,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:33,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:33,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:33,065 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand 3 states. [2018-11-28 17:27:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:33,288 INFO L93 Difference]: Finished difference Result 119 states and 180 transitions. [2018-11-28 17:27:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:33,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-28 17:27:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:33,291 INFO L225 Difference]: With dead ends: 119 [2018-11-28 17:27:33,291 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 17:27:33,292 INFO L631 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-11-28 17:27:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 17:27:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-28 17:27:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 17:27:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-11-28 17:27:33,308 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 14 [2018-11-28 17:27:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:33,308 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-11-28 17:27:33,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-11-28 17:27:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 17:27:33,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:33,309 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:33,311 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:33,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1212559863, now seen corresponding path program 1 times [2018-11-28 17:27:33,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:33,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:33,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:33,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:33,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:33,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:33,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:33,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:33,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:33,422 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-11-28 17:27:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:33,509 INFO L93 Difference]: Finished difference Result 113 states and 169 transitions. [2018-11-28 17:27:33,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:33,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 17:27:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:33,512 INFO L225 Difference]: With dead ends: 113 [2018-11-28 17:27:33,512 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 17:27:33,513 INFO L631 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-11-28 17:27:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 17:27:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-28 17:27:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 17:27:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2018-11-28 17:27:33,522 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 19 [2018-11-28 17:27:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:33,522 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2018-11-28 17:27:33,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2018-11-28 17:27:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 17:27:33,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:33,524 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:33,525 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:33,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:33,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2054021688, now seen corresponding path program 1 times [2018-11-28 17:27:33,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:33,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:33,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:33,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:33,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:33,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:33,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:33,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:33,599 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand 3 states. [2018-11-28 17:27:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:33,724 INFO L93 Difference]: Finished difference Result 140 states and 210 transitions. [2018-11-28 17:27:33,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:33,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 17:27:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:33,727 INFO L225 Difference]: With dead ends: 140 [2018-11-28 17:27:33,727 INFO L226 Difference]: Without dead ends: 94 [2018-11-28 17:27:33,728 INFO L631 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-11-28 17:27:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-28 17:27:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-11-28 17:27:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 17:27:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 132 transitions. [2018-11-28 17:27:33,738 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 132 transitions. Word has length 24 [2018-11-28 17:27:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:33,738 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 132 transitions. [2018-11-28 17:27:33,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 132 transitions. [2018-11-28 17:27:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 17:27:33,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:33,740 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:33,740 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:33,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:33,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1279925660, now seen corresponding path program 1 times [2018-11-28 17:27:33,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:33,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:33,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:33,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:33,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:33,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:33,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:33,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:33,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:33,827 INFO L87 Difference]: Start difference. First operand 91 states and 132 transitions. Second operand 3 states. [2018-11-28 17:27:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:33,988 INFO L93 Difference]: Finished difference Result 180 states and 262 transitions. [2018-11-28 17:27:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:33,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 17:27:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:33,991 INFO L225 Difference]: With dead ends: 180 [2018-11-28 17:27:33,991 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 17:27:33,992 INFO L631 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-11-28 17:27:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 17:27:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-28 17:27:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 17:27:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2018-11-28 17:27:34,003 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 25 [2018-11-28 17:27:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:34,003 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2018-11-28 17:27:34,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2018-11-28 17:27:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 17:27:34,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:34,005 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:34,005 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:34,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash -964230168, now seen corresponding path program 1 times [2018-11-28 17:27:34,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:34,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:34,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:34,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 17:27:34,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:34,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:34,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:34,111 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand 3 states. [2018-11-28 17:27:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:34,194 INFO L93 Difference]: Finished difference Result 164 states and 234 transitions. [2018-11-28 17:27:34,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:34,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 17:27:34,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:34,197 INFO L225 Difference]: With dead ends: 164 [2018-11-28 17:27:34,197 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 17:27:34,198 INFO L631 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-11-28 17:27:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 17:27:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-28 17:27:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 17:27:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2018-11-28 17:27:34,206 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 36 [2018-11-28 17:27:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:34,207 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2018-11-28 17:27:34,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2018-11-28 17:27:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 17:27:34,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:34,208 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:34,209 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:34,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1856126908, now seen corresponding path program 1 times [2018-11-28 17:27:34,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:34,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:34,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:34,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:34,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 17:27:34,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:34,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:27:34,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:27:34,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:27:34,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:27:34,291 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand 4 states. [2018-11-28 17:27:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:34,405 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2018-11-28 17:27:34,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 17:27:34,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-28 17:27:34,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:34,414 INFO L225 Difference]: With dead ends: 80 [2018-11-28 17:27:34,414 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 17:27:34,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 17:27:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 17:27:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 17:27:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 17:27:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 17:27:34,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-28 17:27:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:34,417 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 17:27:34,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:27:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 17:27:34,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 17:27:34,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 17:27:34,886 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-28 17:27:34,889 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 17:27:34,890 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 17:27:34,890 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 17:27:34,890 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 17:27:34,890 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 17:27:34,890 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 17:27:34,890 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 17:27:34,890 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 13 344) no Hoare annotation was computed. [2018-11-28 17:27:34,891 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2018-11-28 17:27:34,891 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 101) no Hoare annotation was computed. [2018-11-28 17:27:34,891 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 104) no Hoare annotation was computed. [2018-11-28 17:27:34,891 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 217) no Hoare annotation was computed. [2018-11-28 17:27:34,891 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 85) no Hoare annotation was computed. [2018-11-28 17:27:34,891 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 333) no Hoare annotation was computed. [2018-11-28 17:27:34,891 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 201) no Hoare annotation was computed. [2018-11-28 17:27:34,891 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 69) no Hoare annotation was computed. [2018-11-28 17:27:34,892 INFO L444 ceAbstractionStarter]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= main_~this_sink~0 0))) (or (and (= main_~q~0 2) .cse0) (and (= main_~q~0 0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2018-11-28 17:27:34,892 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 317) no Hoare annotation was computed. [2018-11-28 17:27:34,892 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 13 344) no Hoare annotation was computed. [2018-11-28 17:27:34,892 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 185) no Hoare annotation was computed. [2018-11-28 17:27:34,892 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 301) no Hoare annotation was computed. [2018-11-28 17:27:34,893 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 169) no Hoare annotation was computed. [2018-11-28 17:27:34,893 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 99) no Hoare annotation was computed. [2018-11-28 17:27:34,893 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 285) no Hoare annotation was computed. [2018-11-28 17:27:34,893 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 215) no Hoare annotation was computed. [2018-11-28 17:27:34,893 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 153) no Hoare annotation was computed. [2018-11-28 17:27:34,893 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 220) no Hoare annotation was computed. [2018-11-28 17:27:34,893 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 83) no Hoare annotation was computed. [2018-11-28 17:27:34,893 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 331) no Hoare annotation was computed. [2018-11-28 17:27:34,894 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2018-11-28 17:27:34,894 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 269) no Hoare annotation was computed. [2018-11-28 17:27:34,894 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 336) no Hoare annotation was computed. [2018-11-28 17:27:34,894 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 199) no Hoare annotation was computed. [2018-11-28 17:27:34,894 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 137) no Hoare annotation was computed. [2018-11-28 17:27:34,894 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 67) no Hoare annotation was computed. [2018-11-28 17:27:34,895 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 23 339) the Hoare annotation is: (let ((.cse0 (= main_~this_sink~0 0))) (or (and (= main_~q~0 0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2018-11-28 17:27:34,895 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 23 339) no Hoare annotation was computed. [2018-11-28 17:27:34,895 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 315) no Hoare annotation was computed. [2018-11-28 17:27:34,895 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 253) no Hoare annotation was computed. [2018-11-28 17:27:34,895 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 183) no Hoare annotation was computed. [2018-11-28 17:27:34,895 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 121) no Hoare annotation was computed. [2018-11-28 17:27:34,895 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2018-11-28 17:27:34,895 INFO L448 ceAbstractionStarter]: For program point L288(lines 288 299) no Hoare annotation was computed. [2018-11-28 17:27:34,896 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 237) no Hoare annotation was computed. [2018-11-28 17:27:34,896 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2018-11-28 17:27:34,896 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 283) no Hoare annotation was computed. [2018-11-28 17:27:34,896 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 151) no Hoare annotation was computed. [2018-11-28 17:27:34,896 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 267) no Hoare annotation was computed. [2018-11-28 17:27:34,896 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 135) no Hoare annotation was computed. [2018-11-28 17:27:34,896 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2018-11-28 17:27:34,897 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 119) no Hoare annotation was computed. [2018-11-28 17:27:34,897 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 235) no Hoare annotation was computed. [2018-11-28 17:27:34,897 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2018-11-28 17:27:34,897 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 210) no Hoare annotation was computed. [2018-11-28 17:27:34,897 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-11-28 17:27:34,897 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-28 17:27:34,897 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2018-11-28 17:27:34,897 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 62) no Hoare annotation was computed. [2018-11-28 17:27:34,898 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2018-11-28 17:27:34,898 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 178) no Hoare annotation was computed. [2018-11-28 17:27:34,898 INFO L444 ceAbstractionStarter]: At program point L325(lines 13 344) the Hoare annotation is: false [2018-11-28 17:27:34,898 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-11-28 17:27:34,898 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 162) no Hoare annotation was computed. [2018-11-28 17:27:34,898 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 278) no Hoare annotation was computed. [2018-11-28 17:27:34,898 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 146) no Hoare annotation was computed. [2018-11-28 17:27:34,899 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 262) no Hoare annotation was computed. [2018-11-28 17:27:34,899 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 130) no Hoare annotation was computed. [2018-11-28 17:27:34,899 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 246) no Hoare annotation was computed. [2018-11-28 17:27:34,899 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 114) no Hoare annotation was computed. [2018-11-28 17:27:34,899 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 230) no Hoare annotation was computed. [2018-11-28 17:27:34,899 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 13 344) the Hoare annotation is: true [2018-11-28 17:27:34,899 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 52) no Hoare annotation was computed. [2018-11-28 17:27:34,899 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 49) no Hoare annotation was computed. [2018-11-28 17:27:34,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:27:34 BoogieIcfgContainer [2018-11-28 17:27:34,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 17:27:34,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 17:27:34,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 17:27:34,916 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 17:27:34,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:27:32" (3/4) ... [2018-11-28 17:27:34,921 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 17:27:34,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 17:27:34,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 17:27:34,940 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 17:27:34,940 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 17:27:34,981 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 17:27:34,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 17:27:34,983 INFO L168 Benchmark]: Toolchain (without parser) took 3996.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -67.9 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2018-11-28 17:27:34,985 INFO L168 Benchmark]: CDTParser took 0.50 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. [2018-11-28 17:27:34,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.21 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 929.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-28 17:27:34,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.62 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 17:27:34,987 INFO L168 Benchmark]: Boogie Preprocessor took 195.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -212.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 17:27:34,988 INFO L168 Benchmark]: RCFGBuilder took 897.20 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 17:27:34,989 INFO L168 Benchmark]: TraceAbstraction took 2359.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.0 MB). Peak memory consumption was 95.0 MB. Max. memory is 11.5 GB. [2018-11-28 17:27:34,989 INFO L168 Benchmark]: Witness Printer took 66.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 17:27:35,000 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.50 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 444.21 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 929.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.62 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 195.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -212.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 897.20 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2359.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.0 MB). Peak memory consumption was 95.0 MB. Max. memory is 11.5 GB. * Witness Printer took 66.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: 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: 23]: Loop Invariant Derived loop invariant: ((q == 2 && this_sink == 0) || (q == 0 && this_sink == 0)) || (3 <= q && !(this_sink == 0)) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (q == 0 && this_sink == 0) || (3 <= q && !(this_sink == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 549 SDtfs, 190 SDslu, 291 SDs, 0 SdLazy, 87 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 44 HoareAnnotationTreeSize, 7 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 6831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...