./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i25_o25-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i25_o25-1.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 980109aaf5797fcdc56688cd1127831babfd66a2 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:25:45,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:25:45,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:25:45,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:25:45,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:25:45,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:25:45,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:25:45,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:25:45,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:25:45,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:25:45,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:25:45,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:25:45,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:25:45,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:25:45,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:25:45,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:25:45,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:25:45,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:25:45,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:25:45,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:25:45,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:25:45,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:25:45,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:25:45,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:25:45,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:25:45,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:25:45,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:25:45,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:25:45,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:25:45,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:25:45,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:25:45,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:25:45,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:25:45,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:25:45,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:25:45,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:25:45,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:25:45,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:25:45,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:25:45,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:25:45,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:25:45,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:25:45,935 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:25:45,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:25:45,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:25:45,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:25:45,938 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:25:45,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:25:45,939 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:25:45,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:25:45,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:25:45,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:25:45,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:25:45,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:25:45,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:25:45,942 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:25:45,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:25:45,943 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:25:45,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:25:45,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:25:45,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:25:45,944 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:25:45,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:25:45,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:45,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:25:45,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:25:45,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:25:45,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:25:45,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:25:45,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:25:45,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 980109aaf5797fcdc56688cd1127831babfd66a2 [2019-11-28 00:25:46,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:25:46,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:25:46,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:25:46,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:25:46,298 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:25:46,299 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-1.c [2019-11-28 00:25:46,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387eee679/5e7561399f7b4abaa58294e477cd800b/FLAGacf1497b3 [2019-11-28 00:25:46,818 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:25:46,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-1.c [2019-11-28 00:25:46,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387eee679/5e7561399f7b4abaa58294e477cd800b/FLAGacf1497b3 [2019-11-28 00:25:47,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387eee679/5e7561399f7b4abaa58294e477cd800b [2019-11-28 00:25:47,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:25:47,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:25:47,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:47,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:25:47,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:25:47,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c493f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47, skipping insertion in model container [2019-11-28 00:25:47,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:25:47,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:25:47,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:47,477 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:25:47,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:47,514 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:25:47,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47 WrapperNode [2019-11-28 00:25:47,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:47,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:47,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:25:47,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:25:47,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:47,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:25:47,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:25:47,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:25:47,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (1/1) ... [2019-11-28 00:25:47,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:25:47,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:25:47,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:25:47,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:25:47,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:25:47,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:25:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-11-28 00:25:47,699 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-11-28 00:25:47,847 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:25:47,847 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:25:47,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:47 BoogieIcfgContainer [2019-11-28 00:25:47,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:25:47,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:25:47,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:25:47,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:25:47,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:25:47" (1/3) ... [2019-11-28 00:25:47,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41129e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:47, skipping insertion in model container [2019-11-28 00:25:47,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:47" (2/3) ... [2019-11-28 00:25:47,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41129e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:47, skipping insertion in model container [2019-11-28 00:25:47,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:47" (3/3) ... [2019-11-28 00:25:47,857 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i25_o25-1.c [2019-11-28 00:25:47,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:25:47,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:25:47,884 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:25:47,911 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:25:47,911 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:25:47,911 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:25:47,912 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:25:47,912 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:25:47,912 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:25:47,912 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:25:47,912 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:25:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-28 00:25:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:25:47,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:47,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:47,939 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-28 00:25:47,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:47,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839772100] [2019-11-28 00:25:47,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:25:48,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839772100] [2019-11-28 00:25:48,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:48,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:25:48,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274804958] [2019-11-28 00:25:48,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:25:48,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:48,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:25:48,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:25:48,242 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-11-28 00:25:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:48,316 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-28 00:25:48,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:48,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 00:25:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:48,329 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:25:48,329 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 00:25:48,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:25:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 00:25:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 00:25:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 00:25:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-28 00:25:48,378 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-28 00:25:48,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:48,379 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-28 00:25:48,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:25:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-28 00:25:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:25:48,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:48,382 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:48,382 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:48,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-28 00:25:48,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:48,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405324451] [2019-11-28 00:25:48,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:25:48,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405324451] [2019-11-28 00:25:48,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284959253] [2019-11-28 00:25:48,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:48,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:25:48,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:48,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 00:25:48,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557837600] [2019-11-28 00:25:48,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:25:48,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:48,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:25:48,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:25:48,669 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 8 states. [2019-11-28 00:25:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:48,763 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-28 00:25:48,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:25:48,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-28 00:25:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:48,766 INFO L225 Difference]: With dead ends: 21 [2019-11-28 00:25:48,766 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 00:25:48,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:25:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 00:25:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 00:25:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:25:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 00:25:48,781 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-28 00:25:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:48,781 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 00:25:48,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:25:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 00:25:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 00:25:48,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:48,785 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:48,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:48,989 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-28 00:25:48,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:48,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023077595] [2019-11-28 00:25:48,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:25:49,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023077595] [2019-11-28 00:25:49,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151283163] [2019-11-28 00:25:49,177 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:49,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:49,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:49,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:49,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:25:49,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:49,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-28 00:25:49,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527434814] [2019-11-28 00:25:49,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 00:25:49,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 00:25:49,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:25:49,280 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-11-28 00:25:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:49,386 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 00:25:49,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:25:49,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-28 00:25:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:49,388 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:25:49,389 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 00:25:49,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 00:25:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 00:25:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 00:25:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 00:25:49,402 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-28 00:25:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:49,403 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 00:25:49,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 00:25:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-28 00:25:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:25:49,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:49,407 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:49,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:49,608 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:49,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:49,609 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-28 00:25:49,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:49,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838817945] [2019-11-28 00:25:49,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 00:25:49,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838817945] [2019-11-28 00:25:49,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357158369] [2019-11-28 00:25:49,800 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:49,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 00:25:49,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:49,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:49,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 00:25:49,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:49,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-28 00:25:49,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352146710] [2019-11-28 00:25:49,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:25:49,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:49,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:25:49,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:25:49,904 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 10 states. [2019-11-28 00:25:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:50,000 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 00:25:50,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:25:50,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-28 00:25:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:50,002 INFO L225 Difference]: With dead ends: 27 [2019-11-28 00:25:50,002 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 00:25:50,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:25:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 00:25:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 00:25:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 00:25:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 00:25:50,009 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-28 00:25:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:50,010 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 00:25:50,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:25:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 00:25:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:25:50,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:50,012 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:50,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:50,213 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:50,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-28 00:25:50,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:50,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370110034] [2019-11-28 00:25:50,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 00:25:50,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370110034] [2019-11-28 00:25:50,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446761945] [2019-11-28 00:25:50,444 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:50,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:25:50,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:50,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:25:50,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 00:25:50,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:50,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-11-28 00:25:50,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559689492] [2019-11-28 00:25:50,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 00:25:50,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:50,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 00:25:50,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:25:50,528 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 11 states. [2019-11-28 00:25:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:50,628 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 00:25:50,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:25:50,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-11-28 00:25:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:50,630 INFO L225 Difference]: With dead ends: 30 [2019-11-28 00:25:50,630 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:25:50,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:25:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:25:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:25:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 00:25:50,638 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-28 00:25:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:50,638 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 00:25:50,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 00:25:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 00:25:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:25:50,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:50,640 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:50,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:50,845 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:50,845 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-28 00:25:50,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:50,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101043216] [2019-11-28 00:25:50,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 00:25:51,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101043216] [2019-11-28 00:25:51,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803838294] [2019-11-28 00:25:51,082 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:51,120 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 00:25:51,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:51,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 00:25:51,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 00:25:51,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:51,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-11-28 00:25:51,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472420882] [2019-11-28 00:25:51,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:51,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:51,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:51,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:51,187 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 12 states. [2019-11-28 00:25:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:51,281 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-28 00:25:51,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:25:51,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-11-28 00:25:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:51,284 INFO L225 Difference]: With dead ends: 33 [2019-11-28 00:25:51,285 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 00:25:51,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 00:25:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 00:25:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 00:25:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 00:25:51,296 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-28 00:25:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:51,299 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 00:25:51,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 00:25:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:25:51,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:51,303 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:51,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:51,505 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:51,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-28 00:25:51,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:51,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076740533] [2019-11-28 00:25:51,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 00:25:51,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076740533] [2019-11-28 00:25:51,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202117925] [2019-11-28 00:25:51,737 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:51,780 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 00:25:51,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:51,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:25:51,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 00:25:51,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:51,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-11-28 00:25:51,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180922459] [2019-11-28 00:25:51,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 00:25:51,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:51,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 00:25:51,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:25:51,867 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 13 states. [2019-11-28 00:25:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:51,991 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-28 00:25:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 00:25:51,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-11-28 00:25:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:51,993 INFO L225 Difference]: With dead ends: 36 [2019-11-28 00:25:51,994 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 00:25:51,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:25:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 00:25:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 00:25:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 00:25:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-28 00:25:52,002 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-28 00:25:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:52,002 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-28 00:25:52,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 00:25:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-28 00:25:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:25:52,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:52,005 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:52,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:52,212 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-28 00:25:52,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:52,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218122878] [2019-11-28 00:25:52,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 00:25:52,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218122878] [2019-11-28 00:25:52,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640806480] [2019-11-28 00:25:52,504 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 00:25:52,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 00:25:52,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:52,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-11-28 00:25:52,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852042183] [2019-11-28 00:25:52,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:25:52,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:52,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:25:52,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:25:52,602 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 14 states. [2019-11-28 00:25:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:52,740 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-28 00:25:52,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:25:52,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2019-11-28 00:25:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:52,744 INFO L225 Difference]: With dead ends: 39 [2019-11-28 00:25:52,745 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:25:52,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=303, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:25:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:25:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 00:25:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 00:25:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-28 00:25:52,754 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-28 00:25:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:52,757 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-28 00:25:52,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:25:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-28 00:25:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 00:25:52,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:52,762 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:52,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:52,975 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-28 00:25:52,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:52,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270533749] [2019-11-28 00:25:52,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 00:25:53,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270533749] [2019-11-28 00:25:53,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848696485] [2019-11-28 00:25:53,225 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:53,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:53,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:53,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 00:25:53,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 00:25:53,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:53,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-11-28 00:25:53,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698505508] [2019-11-28 00:25:53,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 00:25:53,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:53,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 00:25:53,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:25:53,332 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 15 states. [2019-11-28 00:25:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:53,507 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 00:25:53,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:25:53,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-11-28 00:25:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:53,508 INFO L225 Difference]: With dead ends: 42 [2019-11-28 00:25:53,509 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 00:25:53,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:25:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 00:25:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 00:25:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 00:25:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 00:25:53,521 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-28 00:25:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:53,521 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 00:25:53,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 00:25:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 00:25:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:25:53,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:53,523 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:53,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:53,730 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-28 00:25:53,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:53,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702644250] [2019-11-28 00:25:53,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 00:25:54,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702644250] [2019-11-28 00:25:54,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917149698] [2019-11-28 00:25:54,036 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:54,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 00:25:54,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:54,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 00:25:54,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 00:25:54,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:54,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2019-11-28 00:25:54,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566611678] [2019-11-28 00:25:54,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 00:25:54,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:54,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 00:25:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:25:54,188 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 16 states. [2019-11-28 00:25:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:54,318 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-28 00:25:54,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:25:54,319 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-11-28 00:25:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:54,320 INFO L225 Difference]: With dead ends: 45 [2019-11-28 00:25:54,321 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 00:25:54,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:25:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 00:25:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 00:25:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 00:25:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 00:25:54,333 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-28 00:25:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:54,334 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 00:25:54,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 00:25:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 00:25:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:25:54,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:54,338 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:54,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:54,543 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:54,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:54,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-28 00:25:54,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:54,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316996499] [2019-11-28 00:25:54,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 00:25:54,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316996499] [2019-11-28 00:25:54,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921840187] [2019-11-28 00:25:54,833 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:54,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:25:54,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:54,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 00:25:54,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 00:25:54,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:54,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-11-28 00:25:54,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334061310] [2019-11-28 00:25:54,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 00:25:54,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:54,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 00:25:54,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:25:54,965 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 17 states. [2019-11-28 00:25:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:55,159 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-28 00:25:55,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:25:55,160 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2019-11-28 00:25:55,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:55,161 INFO L225 Difference]: With dead ends: 48 [2019-11-28 00:25:55,161 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 00:25:55,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=492, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:25:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 00:25:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-28 00:25:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 00:25:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-28 00:25:55,173 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-28 00:25:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:55,175 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-28 00:25:55,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 00:25:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-28 00:25:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 00:25:55,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:55,177 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:55,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:55,385 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-28 00:25:55,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:55,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050281926] [2019-11-28 00:25:55,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 00:25:55,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050281926] [2019-11-28 00:25:55,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352931569] [2019-11-28 00:25:55,702 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:55,752 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 00:25:55,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:55,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 00:25:55,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 00:25:55,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:55,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2019-11-28 00:25:55,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619889665] [2019-11-28 00:25:55,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:25:55,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:55,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:25:55,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:55,811 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 18 states. [2019-11-28 00:25:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:55,997 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-28 00:25:55,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 00:25:55,998 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2019-11-28 00:25:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:56,000 INFO L225 Difference]: With dead ends: 51 [2019-11-28 00:25:56,000 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:25:56,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=305, Invalid=565, Unknown=0, NotChecked=0, Total=870 [2019-11-28 00:25:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:25:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:25:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:25:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-28 00:25:56,007 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-28 00:25:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:56,008 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-28 00:25:56,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:25:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-28 00:25:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 00:25:56,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:56,009 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:56,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:56,214 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:56,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:56,214 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-28 00:25:56,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:56,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825069819] [2019-11-28 00:25:56,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-28 00:25:56,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825069819] [2019-11-28 00:25:56,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411046697] [2019-11-28 00:25:56,655 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:56,705 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 00:25:56,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:56,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 00:25:56,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-28 00:25:56,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:56,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-11-28 00:25:56,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919531278] [2019-11-28 00:25:56,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 00:25:56,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:56,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 00:25:56,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:25:56,767 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 19 states. [2019-11-28 00:25:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:56,972 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 00:25:56,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 00:25:56,972 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2019-11-28 00:25:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:56,974 INFO L225 Difference]: With dead ends: 54 [2019-11-28 00:25:56,974 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 00:25:56,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=349, Invalid=643, Unknown=0, NotChecked=0, Total=992 [2019-11-28 00:25:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 00:25:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 00:25:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 00:25:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 00:25:56,981 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-28 00:25:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:56,981 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 00:25:56,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 00:25:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 00:25:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 00:25:56,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:56,983 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:57,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:57,187 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:57,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-28 00:25:57,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:57,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157261519] [2019-11-28 00:25:57,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-28 00:25:57,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157261519] [2019-11-28 00:25:57,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804835158] [2019-11-28 00:25:57,714 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 00:25:57,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-28 00:25:57,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:57,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2019-11-28 00:25:57,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755621245] [2019-11-28 00:25:57,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 00:25:57,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 00:25:57,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:25:57,875 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 20 states. [2019-11-28 00:25:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:58,061 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-28 00:25:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:25:58,061 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2019-11-28 00:25:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:58,063 INFO L225 Difference]: With dead ends: 57 [2019-11-28 00:25:58,063 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 00:25:58,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 00:25:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 00:25:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 00:25:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 00:25:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-28 00:25:58,071 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-28 00:25:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:58,071 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-28 00:25:58,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 00:25:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-28 00:25:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 00:25:58,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:58,073 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:58,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:58,277 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-28 00:25:58,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:58,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266455555] [2019-11-28 00:25:58,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-28 00:25:58,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266455555] [2019-11-28 00:25:58,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020601541] [2019-11-28 00:25:58,736 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:58,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:58,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:58,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 00:25:58,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-28 00:25:58,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:58,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-11-28 00:25:58,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395376852] [2019-11-28 00:25:58,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 00:25:58,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 00:25:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:25:58,863 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 21 states. [2019-11-28 00:25:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:59,055 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-28 00:25:59,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 00:25:59,055 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2019-11-28 00:25:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:59,057 INFO L225 Difference]: With dead ends: 60 [2019-11-28 00:25:59,057 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 00:25:59,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=446, Invalid=814, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 00:25:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 00:25:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 00:25:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:25:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-28 00:25:59,064 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-28 00:25:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:59,065 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-28 00:25:59,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 00:25:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-28 00:25:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 00:25:59,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:59,067 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:59,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:59,271 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-28 00:25:59,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:59,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316543820] [2019-11-28 00:25:59,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-28 00:25:59,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316543820] [2019-11-28 00:25:59,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525288981] [2019-11-28 00:25:59,812 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:59,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-28 00:25:59,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:59,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 00:25:59,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-28 00:25:59,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:59,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2019-11-28 00:25:59,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196513104] [2019-11-28 00:25:59,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 00:25:59,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 00:25:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:25:59,943 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 22 states. [2019-11-28 00:26:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:00,167 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-28 00:26:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 00:26:00,167 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 99 [2019-11-28 00:26:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:00,168 INFO L225 Difference]: With dead ends: 63 [2019-11-28 00:26:00,168 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 00:26:00,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=499, Invalid=907, Unknown=0, NotChecked=0, Total=1406 [2019-11-28 00:26:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 00:26:00,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 00:26:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 00:26:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-28 00:26:00,175 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-11-28 00:26:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:00,175 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-28 00:26:00,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 00:26:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-28 00:26:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 00:26:00,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:00,177 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:00,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:00,381 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:00,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-11-28 00:26:00,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:00,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761899820] [2019-11-28 00:26:00,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-28 00:26:01,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761899820] [2019-11-28 00:26:01,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865662246] [2019-11-28 00:26:01,027 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:01,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:26:01,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:01,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 00:26:01,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-28 00:26:01,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:01,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-11-28 00:26:01,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18627111] [2019-11-28 00:26:01,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 00:26:01,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:01,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 00:26:01,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:26:01,153 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 23 states. [2019-11-28 00:26:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:01,435 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-28 00:26:01,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 00:26:01,436 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 105 [2019-11-28 00:26:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:01,437 INFO L225 Difference]: With dead ends: 66 [2019-11-28 00:26:01,437 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 00:26:01,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=555, Invalid=1005, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 00:26:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 00:26:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-28 00:26:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 00:26:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-28 00:26:01,455 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-11-28 00:26:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:01,459 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-28 00:26:01,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 00:26:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-28 00:26:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-28 00:26:01,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:01,461 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:01,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:01,676 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:01,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:01,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-11-28 00:26:01,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:01,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817114021] [2019-11-28 00:26:01,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-28 00:26:02,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817114021] [2019-11-28 00:26:02,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596439762] [2019-11-28 00:26:02,489 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:02,564 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-28 00:26:02,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:02,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 00:26:02,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-28 00:26:02,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:02,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2019-11-28 00:26:02,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885627074] [2019-11-28 00:26:02,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 00:26:02,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:02,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 00:26:02,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:26:02,635 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 24 states. [2019-11-28 00:26:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:02,886 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-11-28 00:26:02,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 00:26:02,887 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 111 [2019-11-28 00:26:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:02,889 INFO L225 Difference]: With dead ends: 69 [2019-11-28 00:26:02,889 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 00:26:02,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=614, Invalid=1108, Unknown=0, NotChecked=0, Total=1722 [2019-11-28 00:26:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 00:26:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 00:26:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 00:26:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-28 00:26:02,895 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-11-28 00:26:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:02,895 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-28 00:26:02,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 00:26:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-28 00:26:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-28 00:26:02,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:02,897 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:03,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:03,101 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:03,102 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-11-28 00:26:03,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:03,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207928597] [2019-11-28 00:26:03,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-28 00:26:03,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207928597] [2019-11-28 00:26:03,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007356677] [2019-11-28 00:26:03,775 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:03,832 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-28 00:26:03,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:03,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-28 00:26:03,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-28 00:26:03,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:03,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-11-28 00:26:03,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086044692] [2019-11-28 00:26:03,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 00:26:03,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:03,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 00:26:03,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:26:03,927 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 25 states. [2019-11-28 00:26:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:04,172 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-28 00:26:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 00:26:04,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 117 [2019-11-28 00:26:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:04,173 INFO L225 Difference]: With dead ends: 72 [2019-11-28 00:26:04,173 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 00:26:04,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=676, Invalid=1216, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 00:26:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 00:26:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 00:26:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 00:26:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-28 00:26:04,179 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-11-28 00:26:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:04,180 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-28 00:26:04,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 00:26:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-28 00:26:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-28 00:26:04,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:04,181 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:04,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:04,385 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:04,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:04,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-11-28 00:26:04,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:04,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332010074] [2019-11-28 00:26:04,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-28 00:26:05,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332010074] [2019-11-28 00:26:05,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122557501] [2019-11-28 00:26:05,110 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 00:26:05,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-28 00:26:05,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:05,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2019-11-28 00:26:05,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736515679] [2019-11-28 00:26:05,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 00:26:05,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 00:26:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:26:05,244 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 26 states. [2019-11-28 00:26:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:05,529 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-11-28 00:26:05,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 00:26:05,530 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 123 [2019-11-28 00:26:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:05,531 INFO L225 Difference]: With dead ends: 75 [2019-11-28 00:26:05,531 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 00:26:05,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=1329, Unknown=0, NotChecked=0, Total=2070 [2019-11-28 00:26:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 00:26:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 00:26:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 00:26:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-28 00:26:05,537 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-11-28 00:26:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:05,538 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-28 00:26:05,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 00:26:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-28 00:26:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 00:26:05,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:05,539 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:05,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:05,743 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:05,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:05,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-11-28 00:26:05,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:05,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250670450] [2019-11-28 00:26:05,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-11-28 00:26:06,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250670450] [2019-11-28 00:26:06,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250148026] [2019-11-28 00:26:06,609 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:06,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:06,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:06,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-28 00:26:06,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-11-28 00:26:06,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:06,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-11-28 00:26:06,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219994661] [2019-11-28 00:26:06,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 00:26:06,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:06,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 00:26:06,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2019-11-28 00:26:06,745 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 27 states. [2019-11-28 00:26:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:07,059 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-11-28 00:26:07,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 00:26:07,059 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 129 [2019-11-28 00:26:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:07,061 INFO L225 Difference]: With dead ends: 78 [2019-11-28 00:26:07,061 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 00:26:07,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=809, Invalid=1447, Unknown=0, NotChecked=0, Total=2256 [2019-11-28 00:26:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 00:26:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 00:26:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 00:26:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-11-28 00:26:07,067 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-11-28 00:26:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:07,067 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-11-28 00:26:07,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 00:26:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-11-28 00:26:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-28 00:26:07,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:07,068 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:07,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:07,273 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:07,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-11-28 00:26:07,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:07,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359071578] [2019-11-28 00:26:07,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-28 00:26:08,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359071578] [2019-11-28 00:26:08,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709311618] [2019-11-28 00:26:08,069 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:08,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-11-28 00:26:08,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:08,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-28 00:26:08,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-28 00:26:08,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:08,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2019-11-28 00:26:08,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099433012] [2019-11-28 00:26:08,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 00:26:08,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:08,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 00:26:08,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:26:08,248 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 28 states. [2019-11-28 00:26:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:08,594 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-11-28 00:26:08,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 00:26:08,597 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 135 [2019-11-28 00:26:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:08,598 INFO L225 Difference]: With dead ends: 81 [2019-11-28 00:26:08,598 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 00:26:08,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=880, Invalid=1570, Unknown=0, NotChecked=0, Total=2450 [2019-11-28 00:26:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 00:26:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-28 00:26:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 00:26:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-11-28 00:26:08,604 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2019-11-28 00:26:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:08,604 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-11-28 00:26:08,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 00:26:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-11-28 00:26:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-28 00:26:08,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:08,606 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:08,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:08,810 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash -555819607, now seen corresponding path program 22 times [2019-11-28 00:26:08,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:08,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971918619] [2019-11-28 00:26:08,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-28 00:26:09,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971918619] [2019-11-28 00:26:09,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256739981] [2019-11-28 00:26:09,682 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:09,736 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:26:09,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:09,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-28 00:26:09,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-28 00:26:09,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:09,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-11-28 00:26:09,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937441822] [2019-11-28 00:26:09,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 00:26:09,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 00:26:09,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2019-11-28 00:26:09,862 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 29 states. [2019-11-28 00:26:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:10,211 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-11-28 00:26:10,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 00:26:10,212 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 141 [2019-11-28 00:26:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:10,213 INFO L225 Difference]: With dead ends: 84 [2019-11-28 00:26:10,213 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 00:26:10,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=954, Invalid=1698, Unknown=0, NotChecked=0, Total=2652 [2019-11-28 00:26:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 00:26:10,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 00:26:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 00:26:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-11-28 00:26:10,219 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2019-11-28 00:26:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:10,219 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-11-28 00:26:10,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 00:26:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-11-28 00:26:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-28 00:26:10,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:10,220 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:10,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:10,424 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash -945685357, now seen corresponding path program 23 times [2019-11-28 00:26:10,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:10,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879713659] [2019-11-28 00:26:10,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-11-28 00:26:11,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879713659] [2019-11-28 00:26:11,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800527703] [2019-11-28 00:26:11,616 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:11,703 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-11-28 00:26:11,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:11,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-28 00:26:11,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-11-28 00:26:11,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:11,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2019-11-28 00:26:11,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503902657] [2019-11-28 00:26:11,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 00:26:11,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 00:26:11,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2019-11-28 00:26:11,799 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 30 states. [2019-11-28 00:26:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:12,141 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-11-28 00:26:12,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 00:26:12,142 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 147 [2019-11-28 00:26:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:12,144 INFO L225 Difference]: With dead ends: 87 [2019-11-28 00:26:12,144 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:26:12,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1031, Invalid=1831, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 00:26:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:26:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-28 00:26:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 00:26:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-11-28 00:26:12,150 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2019-11-28 00:26:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:12,150 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-11-28 00:26:12,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 00:26:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-11-28 00:26:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-28 00:26:12,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:12,151 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:12,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:12,355 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1588806697, now seen corresponding path program 24 times [2019-11-28 00:26:12,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:12,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128025062] [2019-11-28 00:26:12,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-28 00:26:13,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128025062] [2019-11-28 00:26:13,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098718865] [2019-11-28 00:26:13,501 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:13,585 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-11-28 00:26:13,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:13,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-28 00:26:13,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-28 00:26:13,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:13,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-11-28 00:26:13,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966140946] [2019-11-28 00:26:13,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 00:26:13,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:13,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 00:26:13,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=545, Unknown=0, NotChecked=0, Total=930 [2019-11-28 00:26:13,671 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 31 states. [2019-11-28 00:26:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:14,063 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-11-28 00:26:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 00:26:14,064 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 153 [2019-11-28 00:26:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:14,066 INFO L225 Difference]: With dead ends: 90 [2019-11-28 00:26:14,066 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 00:26:14,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1111, Invalid=1969, Unknown=0, NotChecked=0, Total=3080 [2019-11-28 00:26:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 00:26:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-28 00:26:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 00:26:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-11-28 00:26:14,071 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2019-11-28 00:26:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:14,072 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-11-28 00:26:14,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 00:26:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-11-28 00:26:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-28 00:26:14,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:14,073 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:14,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:14,277 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash 959677331, now seen corresponding path program 25 times [2019-11-28 00:26:14,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:14,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356641993] [2019-11-28 00:26:14,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-11-28 00:26:16,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356641993] [2019-11-28 00:26:16,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562416464] [2019-11-28 00:26:16,917 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 107 conjunts are in the unsatisfiable core [2019-11-28 00:26:16,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-11-28 00:26:17,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:17,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-11-28 00:26:17,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947386935] [2019-11-28 00:26:17,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-28 00:26:17,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:17,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-28 00:26:17,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 00:26:17,098 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 55 states. [2019-11-28 00:26:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:18,525 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-11-28 00:26:18,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-28 00:26:18,527 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 159 [2019-11-28 00:26:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:18,528 INFO L225 Difference]: With dead ends: 93 [2019-11-28 00:26:18,529 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 00:26:18,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 00:26:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 00:26:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 00:26:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 00:26:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-11-28 00:26:18,535 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 159 [2019-11-28 00:26:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:18,535 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-11-28 00:26:18,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-28 00:26:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-11-28 00:26:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-28 00:26:18,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:18,537 INFO L410 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:18,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:18,740 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:18,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1468417367, now seen corresponding path program 26 times [2019-11-28 00:26:18,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:18,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147844774] [2019-11-28 00:26:18,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 975 proven. 52 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-11-28 00:26:19,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147844774] [2019-11-28 00:26:19,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476714118] [2019-11-28 00:26:19,976 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:20,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:20,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:20,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-28 00:26:20,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-11-28 00:26:20,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:26:20,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [31] total 33 [2019-11-28 00:26:20,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291806258] [2019-11-28 00:26:20,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 00:26:20,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:20,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 00:26:20,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=640, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 00:26:20,173 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 31 states. [2019-11-28 00:26:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:20,833 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-11-28 00:26:20,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 00:26:20,834 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 165 [2019-11-28 00:26:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:20,834 INFO L225 Difference]: With dead ends: 89 [2019-11-28 00:26:20,834 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:26:20,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1226, Invalid=2314, Unknown=0, NotChecked=0, Total=3540 [2019-11-28 00:26:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:26:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:26:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:26:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:26:20,838 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2019-11-28 00:26:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:20,838 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:26:20,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 00:26:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:26:20,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:26:21,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:21,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:26:21,060 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:26:21,061 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:26:21,061 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:26:21,061 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2019-11-28 00:26:21,061 INFO L246 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2019-11-28 00:26:21,061 INFO L246 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2019-11-28 00:26:21,061 INFO L242 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= ULTIMATE.start_main_~input~0 25) (<= 25 ULTIMATE.start_main_~input~0)) [2019-11-28 00:26:21,061 INFO L246 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-11-28 00:26:21,062 INFO L246 CegarLoopResult]: For program point L9(lines 9 15) no Hoare annotation was computed. [2019-11-28 00:26:21,062 INFO L246 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2019-11-28 00:26:21,062 INFO L246 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2019-11-28 00:26:21,062 INFO L249 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2019-11-28 00:26:21,062 INFO L242 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2019-11-28 00:26:21,062 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-28 00:26:21,062 INFO L246 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-11-28 00:26:21,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:26:21 BoogieIcfgContainer [2019-11-28 00:26:21,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:26:21,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:26:21,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:26:21,071 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:26:21,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:47" (3/4) ... [2019-11-28 00:26:21,081 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:26:21,089 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-11-28 00:26:21,093 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:26:21,093 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:26:21,129 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:26:21,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:26:21,131 INFO L168 Benchmark]: Toolchain (without parser) took 33948.96 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 766.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -138.3 MB). Peak memory consumption was 627.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:21,131 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:21,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.17 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 949.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:21,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.35 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:21,132 INFO L168 Benchmark]: Boogie Preprocessor took 79.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -119.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:21,133 INFO L168 Benchmark]: RCFGBuilder took 214.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:21,133 INFO L168 Benchmark]: TraceAbstraction took 33221.02 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 686.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -50.9 MB). Peak memory consumption was 635.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:21,133 INFO L168 Benchmark]: Witness Printer took 57.80 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:21,135 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.61 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.17 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 949.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.35 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -119.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 214.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33221.02 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 686.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -50.9 MB). Peak memory consumption was 635.4 MB. Max. memory is 11.5 GB. * Witness Printer took 57.80 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Result: SAFE, OverallTime: 33.1s, OverallIterations: 27, TraceHistogramMax: 27, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 346 SDtfs, 1217 SDslu, 3985 SDs, 0 SdLazy, 3250 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3881 GetRequests, 3020 SyntacticMatches, 2 SemanticMatches, 859 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5551 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 11 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 4689 NumberOfCodeBlocks, 4689 NumberOfCodeBlocksAsserted, 226 NumberOfCheckSat, 4636 ConstructedInterpolants, 0 QuantifiedInterpolants, 1419088 SizeOfPredicates, 377 NumberOfNonLiveVariables, 5512 ConjunctsInSsa, 859 ConjunctsInUnsatCore, 53 InterpolantComputations, 2 PerfectInterpolantSequences, 20956/37908 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...