./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/ssh-simplified/s3_srvr_11.cil.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 f4c57aae7ed3dd683b199a99be2cffcf6f23506e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:40:07,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:07,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:07,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:07,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:07,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:07,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:07,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:07,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:07,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:07,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:07,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:07,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:07,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:07,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:07,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:07,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:07,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:07,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:07,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:07,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:07,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:07,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:07,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:07,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:07,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:07,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:07,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:07,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:07,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:07,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:07,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:07,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:07,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:07,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:07,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:07,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:07,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:07,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:07,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:07,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:07,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:40:07,954 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:07,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:07,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:07,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:07,957 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:07,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:07,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:07,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:07,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:07,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:07,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:07,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:07,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:07,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:07,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:07,960 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:07,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:07,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:07,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:07,961 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:07,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:07,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:07,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:07,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:07,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:07,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:07,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:07,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:07,963 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:07,964 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 -> f4c57aae7ed3dd683b199a99be2cffcf6f23506e [2019-11-28 15:40:08,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:08,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:08,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:08,329 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:08,331 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:08,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-11-28 15:40:08,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdaa2ee27/784a7f2b708b4a3483d0d38ec7fcd744/FLAGe646e25fd [2019-11-28 15:40:08,931 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:08,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-11-28 15:40:08,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdaa2ee27/784a7f2b708b4a3483d0d38ec7fcd744/FLAGe646e25fd [2019-11-28 15:40:09,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdaa2ee27/784a7f2b708b4a3483d0d38ec7fcd744 [2019-11-28 15:40:09,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:09,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:09,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:09,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:09,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:09,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b83df50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09, skipping insertion in model container [2019-11-28 15:40:09,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:09,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:09,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:09,634 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:09,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:09,826 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:09,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09 WrapperNode [2019-11-28 15:40:09,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:09,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:09,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:09,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:09,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:09,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:09,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:09,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:09,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:09,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:09,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:09,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:09,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (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 15:40:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:10,204 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:40:10,940 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 15:40:10,941 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 15:40:10,942 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:10,943 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:40:10,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:10 BoogieIcfgContainer [2019-11-28 15:40:10,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:10,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:10,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:10,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:10,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:09" (1/3) ... [2019-11-28 15:40:10,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45954cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:10, skipping insertion in model container [2019-11-28 15:40:10,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (2/3) ... [2019-11-28 15:40:10,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45954cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:10, skipping insertion in model container [2019-11-28 15:40:10,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:10" (3/3) ... [2019-11-28 15:40:10,957 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2019-11-28 15:40:10,967 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:10,977 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:10,988 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:11,016 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:11,017 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:11,017 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:11,017 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:11,017 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:11,017 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:11,017 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:11,018 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-28 15:40:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:11,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:11,046 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:11,046 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:11,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1603119947, now seen corresponding path program 1 times [2019-11-28 15:40:11,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:11,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035627451] [2019-11-28 15:40:11,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:11,264 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 15:40:11,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035627451] [2019-11-28 15:40:11,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:11,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:11,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320172699] [2019-11-28 15:40:11,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:11,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:11,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:11,294 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-28 15:40:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:11,576 INFO L93 Difference]: Finished difference Result 315 states and 541 transitions. [2019-11-28 15:40:11,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:11,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:11,594 INFO L225 Difference]: With dead ends: 315 [2019-11-28 15:40:11,594 INFO L226 Difference]: Without dead ends: 154 [2019-11-28 15:40:11,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:11,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-28 15:40:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-11-28 15:40:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 15:40:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 240 transitions. [2019-11-28 15:40:11,656 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 240 transitions. Word has length 25 [2019-11-28 15:40:11,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:11,657 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 240 transitions. [2019-11-28 15:40:11,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 240 transitions. [2019-11-28 15:40:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:11,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:11,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:11,660 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:11,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1655306444, now seen corresponding path program 1 times [2019-11-28 15:40:11,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:11,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424922368] [2019-11-28 15:40:11,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:11,750 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 15:40:11,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424922368] [2019-11-28 15:40:11,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:11,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:11,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070451953] [2019-11-28 15:40:11,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:11,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:11,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:11,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:11,755 INFO L87 Difference]: Start difference. First operand 152 states and 240 transitions. Second operand 3 states. [2019-11-28 15:40:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:11,924 INFO L93 Difference]: Finished difference Result 318 states and 501 transitions. [2019-11-28 15:40:11,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:11,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:11,927 INFO L225 Difference]: With dead ends: 318 [2019-11-28 15:40:11,927 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 15:40:11,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 15:40:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-11-28 15:40:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-28 15:40:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2019-11-28 15:40:11,946 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 26 [2019-11-28 15:40:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:11,946 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-11-28 15:40:11,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2019-11-28 15:40:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:11,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:11,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:11,949 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2083538751, now seen corresponding path program 1 times [2019-11-28 15:40:11,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:11,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047866965] [2019-11-28 15:40:11,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,028 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 15:40:12,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047866965] [2019-11-28 15:40:12,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:12,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:12,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72733638] [2019-11-28 15:40:12,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:12,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:12,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,031 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. Second operand 3 states. [2019-11-28 15:40:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:12,242 INFO L93 Difference]: Finished difference Result 347 states and 541 transitions. [2019-11-28 15:40:12,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:12,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:12,247 INFO L225 Difference]: With dead ends: 347 [2019-11-28 15:40:12,248 INFO L226 Difference]: Without dead ends: 181 [2019-11-28 15:40:12,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-28 15:40:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-11-28 15:40:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-28 15:40:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 280 transitions. [2019-11-28 15:40:12,284 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 280 transitions. Word has length 26 [2019-11-28 15:40:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:12,288 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 280 transitions. [2019-11-28 15:40:12,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 280 transitions. [2019-11-28 15:40:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:12,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:12,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:12,291 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash -467027583, now seen corresponding path program 1 times [2019-11-28 15:40:12,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:12,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251981586] [2019-11-28 15:40:12,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,399 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 15:40:12,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251981586] [2019-11-28 15:40:12,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:12,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:12,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720076726] [2019-11-28 15:40:12,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:12,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:12,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:12,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,403 INFO L87 Difference]: Start difference. First operand 179 states and 280 transitions. Second operand 3 states. [2019-11-28 15:40:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:12,574 INFO L93 Difference]: Finished difference Result 352 states and 551 transitions. [2019-11-28 15:40:12,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:12,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:12,577 INFO L225 Difference]: With dead ends: 352 [2019-11-28 15:40:12,577 INFO L226 Difference]: Without dead ends: 180 [2019-11-28 15:40:12,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-28 15:40:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-11-28 15:40:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 15:40:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 281 transitions. [2019-11-28 15:40:12,608 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 281 transitions. Word has length 26 [2019-11-28 15:40:12,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:12,608 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 281 transitions. [2019-11-28 15:40:12,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 281 transitions. [2019-11-28 15:40:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:40:12,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:12,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:12,616 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1902471129, now seen corresponding path program 1 times [2019-11-28 15:40:12,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:12,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005656014] [2019-11-28 15:40:12,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,693 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 15:40:12,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005656014] [2019-11-28 15:40:12,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:12,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:12,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254296186] [2019-11-28 15:40:12,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:12,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:12,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:12,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,697 INFO L87 Difference]: Start difference. First operand 180 states and 281 transitions. Second operand 3 states. [2019-11-28 15:40:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:12,845 INFO L93 Difference]: Finished difference Result 363 states and 563 transitions. [2019-11-28 15:40:12,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:12,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:40:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:12,848 INFO L225 Difference]: With dead ends: 363 [2019-11-28 15:40:12,848 INFO L226 Difference]: Without dead ends: 190 [2019-11-28 15:40:12,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-28 15:40:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-28 15:40:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 15:40:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2019-11-28 15:40:12,860 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 27 [2019-11-28 15:40:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:12,861 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2019-11-28 15:40:12,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2019-11-28 15:40:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 15:40:12,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:12,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:12,863 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1605160869, now seen corresponding path program 1 times [2019-11-28 15:40:12,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:12,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392679834] [2019-11-28 15:40:12,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,896 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 15:40:12,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392679834] [2019-11-28 15:40:12,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:12,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:12,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968155972] [2019-11-28 15:40:12,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:12,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:12,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,899 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 3 states. [2019-11-28 15:40:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,050 INFO L93 Difference]: Finished difference Result 363 states and 559 transitions. [2019-11-28 15:40:13,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:13,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 15:40:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,052 INFO L225 Difference]: With dead ends: 363 [2019-11-28 15:40:13,053 INFO L226 Difference]: Without dead ends: 190 [2019-11-28 15:40:13,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-28 15:40:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-28 15:40:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 15:40:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 277 transitions. [2019-11-28 15:40:13,062 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 277 transitions. Word has length 28 [2019-11-28 15:40:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,063 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 277 transitions. [2019-11-28 15:40:13,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 277 transitions. [2019-11-28 15:40:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:40:13,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:13,065 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1051085342, now seen corresponding path program 1 times [2019-11-28 15:40:13,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483075563] [2019-11-28 15:40:13,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,091 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 15:40:13,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483075563] [2019-11-28 15:40:13,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:13,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71774968] [2019-11-28 15:40:13,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,094 INFO L87 Difference]: Start difference. First operand 180 states and 277 transitions. Second operand 3 states. [2019-11-28 15:40:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,244 INFO L93 Difference]: Finished difference Result 363 states and 555 transitions. [2019-11-28 15:40:13,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:13,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 15:40:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,246 INFO L225 Difference]: With dead ends: 363 [2019-11-28 15:40:13,246 INFO L226 Difference]: Without dead ends: 190 [2019-11-28 15:40:13,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-28 15:40:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-28 15:40:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 15:40:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-11-28 15:40:13,257 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 29 [2019-11-28 15:40:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,257 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-11-28 15:40:13,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2019-11-28 15:40:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:40:13,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:13,259 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1476768639, now seen corresponding path program 1 times [2019-11-28 15:40:13,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764845136] [2019-11-28 15:40:13,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,300 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 15:40:13,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764845136] [2019-11-28 15:40:13,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:13,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687705878] [2019-11-28 15:40:13,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:13,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:13,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:13,303 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand 4 states. [2019-11-28 15:40:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,590 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2019-11-28 15:40:13,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:40:13,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-28 15:40:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,594 INFO L225 Difference]: With dead ends: 511 [2019-11-28 15:40:13,594 INFO L226 Difference]: Without dead ends: 338 [2019-11-28 15:40:13,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-28 15:40:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2019-11-28 15:40:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-28 15:40:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2019-11-28 15:40:13,619 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 29 [2019-11-28 15:40:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,619 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2019-11-28 15:40:13,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2019-11-28 15:40:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 15:40:13,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:13,625 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash -91605738, now seen corresponding path program 1 times [2019-11-28 15:40:13,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146474008] [2019-11-28 15:40:13,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,698 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 15:40:13,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146474008] [2019-11-28 15:40:13,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:13,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048556635] [2019-11-28 15:40:13,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,703 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand 3 states. [2019-11-28 15:40:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,892 INFO L93 Difference]: Finished difference Result 698 states and 1074 transitions. [2019-11-28 15:40:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:13,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-28 15:40:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,895 INFO L225 Difference]: With dead ends: 698 [2019-11-28 15:40:13,895 INFO L226 Difference]: Without dead ends: 382 [2019-11-28 15:40:13,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-28 15:40:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-11-28 15:40:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-28 15:40:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 581 transitions. [2019-11-28 15:40:13,914 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 581 transitions. Word has length 43 [2019-11-28 15:40:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,916 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 581 transitions. [2019-11-28 15:40:13,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 581 transitions. [2019-11-28 15:40:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 15:40:13,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:13,920 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033309, now seen corresponding path program 1 times [2019-11-28 15:40:13,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686534739] [2019-11-28 15:40:13,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:13,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686534739] [2019-11-28 15:40:13,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:13,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122431428] [2019-11-28 15:40:13,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,980 INFO L87 Difference]: Start difference. First operand 374 states and 581 transitions. Second operand 3 states. [2019-11-28 15:40:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,254 INFO L93 Difference]: Finished difference Result 775 states and 1210 transitions. [2019-11-28 15:40:14,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 15:40:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,257 INFO L225 Difference]: With dead ends: 775 [2019-11-28 15:40:14,257 INFO L226 Difference]: Without dead ends: 406 [2019-11-28 15:40:14,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-28 15:40:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 398. [2019-11-28 15:40:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-28 15:40:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 627 transitions. [2019-11-28 15:40:14,277 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 627 transitions. Word has length 44 [2019-11-28 15:40:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,278 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 627 transitions. [2019-11-28 15:40:14,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 627 transitions. [2019-11-28 15:40:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 15:40:14,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,280 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:14,280 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,281 INFO L82 PathProgramCache]: Analyzing trace with hash 501139110, now seen corresponding path program 1 times [2019-11-28 15:40:14,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875184329] [2019-11-28 15:40:14,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 15:40:14,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875184329] [2019-11-28 15:40:14,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628046720] [2019-11-28 15:40:14,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,319 INFO L87 Difference]: Start difference. First operand 398 states and 627 transitions. Second operand 3 states. [2019-11-28 15:40:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,497 INFO L93 Difference]: Finished difference Result 829 states and 1310 transitions. [2019-11-28 15:40:14,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-28 15:40:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,500 INFO L225 Difference]: With dead ends: 829 [2019-11-28 15:40:14,500 INFO L226 Difference]: Without dead ends: 438 [2019-11-28 15:40:14,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-28 15:40:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-11-28 15:40:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-28 15:40:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 692 transitions. [2019-11-28 15:40:14,519 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 692 transitions. Word has length 54 [2019-11-28 15:40:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,520 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 692 transitions. [2019-11-28 15:40:14,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 692 transitions. [2019-11-28 15:40:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 15:40:14,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,522 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:14,523 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1234673389, now seen corresponding path program 1 times [2019-11-28 15:40:14,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272265817] [2019-11-28 15:40:14,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 15:40:14,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272265817] [2019-11-28 15:40:14,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393590583] [2019-11-28 15:40:14,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,590 INFO L87 Difference]: Start difference. First operand 438 states and 692 transitions. Second operand 3 states. [2019-11-28 15:40:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,754 INFO L93 Difference]: Finished difference Result 911 states and 1440 transitions. [2019-11-28 15:40:14,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-28 15:40:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,759 INFO L225 Difference]: With dead ends: 911 [2019-11-28 15:40:14,759 INFO L226 Difference]: Without dead ends: 480 [2019-11-28 15:40:14,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-28 15:40:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-11-28 15:40:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-28 15:40:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 752 transitions. [2019-11-28 15:40:14,785 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 752 transitions. Word has length 81 [2019-11-28 15:40:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,786 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 752 transitions. [2019-11-28 15:40:14,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 752 transitions. [2019-11-28 15:40:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 15:40:14,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,789 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:14,790 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,791 INFO L82 PathProgramCache]: Analyzing trace with hash -337353345, now seen corresponding path program 1 times [2019-11-28 15:40:14,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787546546] [2019-11-28 15:40:14,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 15:40:14,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787546546] [2019-11-28 15:40:14,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365074630] [2019-11-28 15:40:14,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,857 INFO L87 Difference]: Start difference. First operand 476 states and 752 transitions. Second operand 3 states. [2019-11-28 15:40:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,059 INFO L93 Difference]: Finished difference Result 949 states and 1497 transitions. [2019-11-28 15:40:15,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-28 15:40:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,065 INFO L225 Difference]: With dead ends: 949 [2019-11-28 15:40:15,065 INFO L226 Difference]: Without dead ends: 480 [2019-11-28 15:40:15,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-28 15:40:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-11-28 15:40:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-28 15:40:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 749 transitions. [2019-11-28 15:40:15,098 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 749 transitions. Word has length 82 [2019-11-28 15:40:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,100 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 749 transitions. [2019-11-28 15:40:15,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 749 transitions. [2019-11-28 15:40:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:40:15,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,103 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:15,103 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1112997795, now seen corresponding path program 1 times [2019-11-28 15:40:15,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204587354] [2019-11-28 15:40:15,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 15:40:15,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204587354] [2019-11-28 15:40:15,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039741969] [2019-11-28 15:40:15,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,176 INFO L87 Difference]: Start difference. First operand 476 states and 749 transitions. Second operand 3 states. [2019-11-28 15:40:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,363 INFO L93 Difference]: Finished difference Result 997 states and 1572 transitions. [2019-11-28 15:40:15,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:40:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,367 INFO L225 Difference]: With dead ends: 997 [2019-11-28 15:40:15,368 INFO L226 Difference]: Without dead ends: 528 [2019-11-28 15:40:15,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-28 15:40:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-11-28 15:40:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-28 15:40:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 804 transitions. [2019-11-28 15:40:15,396 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 804 transitions. Word has length 83 [2019-11-28 15:40:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,396 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 804 transitions. [2019-11-28 15:40:15,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 804 transitions. [2019-11-28 15:40:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:40:15,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,399 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:15,399 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1939998609, now seen corresponding path program 1 times [2019-11-28 15:40:15,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129045797] [2019-11-28 15:40:15,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 15:40:15,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129045797] [2019-11-28 15:40:15,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946337463] [2019-11-28 15:40:15,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,452 INFO L87 Difference]: Start difference. First operand 512 states and 804 transitions. Second operand 3 states. [2019-11-28 15:40:15,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,637 INFO L93 Difference]: Finished difference Result 1033 states and 1623 transitions. [2019-11-28 15:40:15,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:40:15,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,641 INFO L225 Difference]: With dead ends: 1033 [2019-11-28 15:40:15,642 INFO L226 Difference]: Without dead ends: 528 [2019-11-28 15:40:15,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-28 15:40:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-11-28 15:40:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-28 15:40:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 800 transitions. [2019-11-28 15:40:15,672 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 800 transitions. Word has length 84 [2019-11-28 15:40:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,672 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 800 transitions. [2019-11-28 15:40:15,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 800 transitions. [2019-11-28 15:40:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:40:15,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,674 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:15,675 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1409112293, now seen corresponding path program 1 times [2019-11-28 15:40:15,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371962648] [2019-11-28 15:40:15,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:15,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371962648] [2019-11-28 15:40:15,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017249865] [2019-11-28 15:40:15,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,751 INFO L87 Difference]: Start difference. First operand 512 states and 800 transitions. Second operand 3 states. [2019-11-28 15:40:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,915 INFO L93 Difference]: Finished difference Result 1078 states and 1682 transitions. [2019-11-28 15:40:15,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:40:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,919 INFO L225 Difference]: With dead ends: 1078 [2019-11-28 15:40:15,919 INFO L226 Difference]: Without dead ends: 573 [2019-11-28 15:40:15,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-11-28 15:40:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 565. [2019-11-28 15:40:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-11-28 15:40:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 881 transitions. [2019-11-28 15:40:15,943 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 881 transitions. Word has length 84 [2019-11-28 15:40:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,943 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 881 transitions. [2019-11-28 15:40:15,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 881 transitions. [2019-11-28 15:40:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-28 15:40:15,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,945 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:15,945 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1919478498, now seen corresponding path program 1 times [2019-11-28 15:40:15,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434731563] [2019-11-28 15:40:15,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:15,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434731563] [2019-11-28 15:40:15,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721557046] [2019-11-28 15:40:15,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,979 INFO L87 Difference]: Start difference. First operand 565 states and 881 transitions. Second operand 3 states. [2019-11-28 15:40:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,162 INFO L93 Difference]: Finished difference Result 1131 states and 1761 transitions. [2019-11-28 15:40:16,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-28 15:40:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,166 INFO L225 Difference]: With dead ends: 1131 [2019-11-28 15:40:16,166 INFO L226 Difference]: Without dead ends: 571 [2019-11-28 15:40:16,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-28 15:40:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2019-11-28 15:40:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-28 15:40:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 876 transitions. [2019-11-28 15:40:16,190 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 876 transitions. Word has length 85 [2019-11-28 15:40:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,190 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 876 transitions. [2019-11-28 15:40:16,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 876 transitions. [2019-11-28 15:40:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-28 15:40:16,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,192 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,193 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash -818800783, now seen corresponding path program 1 times [2019-11-28 15:40:16,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772889027] [2019-11-28 15:40:16,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 15:40:16,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772889027] [2019-11-28 15:40:16,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700184926] [2019-11-28 15:40:16,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,226 INFO L87 Difference]: Start difference. First operand 563 states and 876 transitions. Second operand 3 states. [2019-11-28 15:40:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,367 INFO L93 Difference]: Finished difference Result 1159 states and 1804 transitions. [2019-11-28 15:40:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-28 15:40:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,372 INFO L225 Difference]: With dead ends: 1159 [2019-11-28 15:40:16,372 INFO L226 Difference]: Without dead ends: 603 [2019-11-28 15:40:16,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-28 15:40:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-11-28 15:40:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-28 15:40:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 917 transitions. [2019-11-28 15:40:16,399 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 917 transitions. Word has length 106 [2019-11-28 15:40:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,400 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 917 transitions. [2019-11-28 15:40:16,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 917 transitions. [2019-11-28 15:40:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-28 15:40:16,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,402 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,403 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1053492997, now seen corresponding path program 1 times [2019-11-28 15:40:16,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022917876] [2019-11-28 15:40:16,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 15:40:16,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022917876] [2019-11-28 15:40:16,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118224792] [2019-11-28 15:40:16,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,444 INFO L87 Difference]: Start difference. First operand 593 states and 917 transitions. Second operand 3 states. [2019-11-28 15:40:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,599 INFO L93 Difference]: Finished difference Result 1189 states and 1839 transitions. [2019-11-28 15:40:16,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-28 15:40:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,603 INFO L225 Difference]: With dead ends: 1189 [2019-11-28 15:40:16,604 INFO L226 Difference]: Without dead ends: 603 [2019-11-28 15:40:16,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-28 15:40:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-11-28 15:40:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-28 15:40:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 911 transitions. [2019-11-28 15:40:16,630 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 911 transitions. Word has length 107 [2019-11-28 15:40:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,631 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 911 transitions. [2019-11-28 15:40:16,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 911 transitions. [2019-11-28 15:40:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-28 15:40:16,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,633 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,634 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash 532417498, now seen corresponding path program 1 times [2019-11-28 15:40:16,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943864128] [2019-11-28 15:40:16,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-28 15:40:16,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943864128] [2019-11-28 15:40:16,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826104536] [2019-11-28 15:40:16,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,673 INFO L87 Difference]: Start difference. First operand 593 states and 911 transitions. Second operand 3 states. [2019-11-28 15:40:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,818 INFO L93 Difference]: Finished difference Result 1239 states and 1906 transitions. [2019-11-28 15:40:16,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-28 15:40:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,823 INFO L225 Difference]: With dead ends: 1239 [2019-11-28 15:40:16,823 INFO L226 Difference]: Without dead ends: 653 [2019-11-28 15:40:16,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-28 15:40:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-11-28 15:40:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-28 15:40:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 958 transitions. [2019-11-28 15:40:16,851 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 958 transitions. Word has length 110 [2019-11-28 15:40:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,851 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 958 transitions. [2019-11-28 15:40:16,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 958 transitions. [2019-11-28 15:40:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-28 15:40:16,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,854 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,854 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1562226642, now seen corresponding path program 1 times [2019-11-28 15:40:16,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416196163] [2019-11-28 15:40:16,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-28 15:40:16,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416196163] [2019-11-28 15:40:16,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184170804] [2019-11-28 15:40:16,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,909 INFO L87 Difference]: Start difference. First operand 627 states and 958 transitions. Second operand 3 states. [2019-11-28 15:40:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,052 INFO L93 Difference]: Finished difference Result 1273 states and 1947 transitions. [2019-11-28 15:40:17,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-28 15:40:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,056 INFO L225 Difference]: With dead ends: 1273 [2019-11-28 15:40:17,057 INFO L226 Difference]: Without dead ends: 653 [2019-11-28 15:40:17,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-28 15:40:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-11-28 15:40:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-28 15:40:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 952 transitions. [2019-11-28 15:40:17,085 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 952 transitions. Word has length 111 [2019-11-28 15:40:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,085 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 952 transitions. [2019-11-28 15:40:17,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 952 transitions. [2019-11-28 15:40:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-28 15:40:17,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,088 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,088 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2031768980, now seen corresponding path program 1 times [2019-11-28 15:40:17,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452399523] [2019-11-28 15:40:17,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 15:40:17,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452399523] [2019-11-28 15:40:17,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:17,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474466964] [2019-11-28 15:40:17,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,140 INFO L87 Difference]: Start difference. First operand 627 states and 952 transitions. Second operand 3 states. [2019-11-28 15:40:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,361 INFO L93 Difference]: Finished difference Result 1300 states and 1972 transitions. [2019-11-28 15:40:17,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-28 15:40:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,367 INFO L225 Difference]: With dead ends: 1300 [2019-11-28 15:40:17,368 INFO L226 Difference]: Without dead ends: 680 [2019-11-28 15:40:17,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-11-28 15:40:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2019-11-28 15:40:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-28 15:40:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1020 transitions. [2019-11-28 15:40:17,406 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1020 transitions. Word has length 122 [2019-11-28 15:40:17,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,407 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 1020 transitions. [2019-11-28 15:40:17,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1020 transitions. [2019-11-28 15:40:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-28 15:40:17,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,410 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,411 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1706022811, now seen corresponding path program 1 times [2019-11-28 15:40:17,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247382625] [2019-11-28 15:40:17,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-28 15:40:17,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247382625] [2019-11-28 15:40:17,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:17,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585826732] [2019-11-28 15:40:17,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,486 INFO L87 Difference]: Start difference. First operand 674 states and 1020 transitions. Second operand 3 states. [2019-11-28 15:40:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,561 INFO L93 Difference]: Finished difference Result 1343 states and 2030 transitions. [2019-11-28 15:40:17,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-28 15:40:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,569 INFO L225 Difference]: With dead ends: 1343 [2019-11-28 15:40:17,569 INFO L226 Difference]: Without dead ends: 1341 [2019-11-28 15:40:17,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-11-28 15:40:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2019-11-28 15:40:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-11-28 15:40:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2026 transitions. [2019-11-28 15:40:17,615 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2026 transitions. Word has length 123 [2019-11-28 15:40:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,616 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2026 transitions. [2019-11-28 15:40:17,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2026 transitions. [2019-11-28 15:40:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-28 15:40:17,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,619 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,619 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,620 INFO L82 PathProgramCache]: Analyzing trace with hash 601196500, now seen corresponding path program 1 times [2019-11-28 15:40:17,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273106968] [2019-11-28 15:40:17,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-28 15:40:17,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273106968] [2019-11-28 15:40:17,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:17,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166582663] [2019-11-28 15:40:17,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,656 INFO L87 Difference]: Start difference. First operand 1339 states and 2026 transitions. Second operand 3 states. [2019-11-28 15:40:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,723 INFO L93 Difference]: Finished difference Result 3328 states and 5034 transitions. [2019-11-28 15:40:17,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-28 15:40:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,732 INFO L225 Difference]: With dead ends: 3328 [2019-11-28 15:40:17,733 INFO L226 Difference]: Without dead ends: 1996 [2019-11-28 15:40:17,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-11-28 15:40:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2019-11-28 15:40:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-28 15:40:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 3012 transitions. [2019-11-28 15:40:17,800 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 3012 transitions. Word has length 124 [2019-11-28 15:40:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,800 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 3012 transitions. [2019-11-28 15:40:17,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 3012 transitions. [2019-11-28 15:40:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-28 15:40:17,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,804 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,804 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1540663978, now seen corresponding path program 1 times [2019-11-28 15:40:17,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617943561] [2019-11-28 15:40:17,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-28 15:40:17,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617943561] [2019-11-28 15:40:17,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:17,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800398645] [2019-11-28 15:40:17,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,838 INFO L87 Difference]: Start difference. First operand 1994 states and 3012 transitions. Second operand 3 states. [2019-11-28 15:40:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,929 INFO L93 Difference]: Finished difference Result 4616 states and 6971 transitions. [2019-11-28 15:40:17,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-28 15:40:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,942 INFO L225 Difference]: With dead ends: 4616 [2019-11-28 15:40:17,943 INFO L226 Difference]: Without dead ends: 2629 [2019-11-28 15:40:17,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-11-28 15:40:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2627. [2019-11-28 15:40:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2627 states. [2019-11-28 15:40:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3961 transitions. [2019-11-28 15:40:18,033 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3961 transitions. Word has length 124 [2019-11-28 15:40:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,033 INFO L462 AbstractCegarLoop]: Abstraction has 2627 states and 3961 transitions. [2019-11-28 15:40:18,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3961 transitions. [2019-11-28 15:40:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-28 15:40:18,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,038 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,039 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1091794830, now seen corresponding path program 1 times [2019-11-28 15:40:18,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150139634] [2019-11-28 15:40:18,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-28 15:40:18,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150139634] [2019-11-28 15:40:18,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:18,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939743528] [2019-11-28 15:40:18,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,082 INFO L87 Difference]: Start difference. First operand 2627 states and 3961 transitions. Second operand 3 states. [2019-11-28 15:40:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:18,285 INFO L93 Difference]: Finished difference Result 5375 states and 8098 transitions. [2019-11-28 15:40:18,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:18,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-28 15:40:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:18,298 INFO L225 Difference]: With dead ends: 5375 [2019-11-28 15:40:18,298 INFO L226 Difference]: Without dead ends: 2755 [2019-11-28 15:40:18,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-28 15:40:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-11-28 15:40:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-28 15:40:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4076 transitions. [2019-11-28 15:40:18,387 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4076 transitions. Word has length 132 [2019-11-28 15:40:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,387 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4076 transitions. [2019-11-28 15:40:18,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4076 transitions. [2019-11-28 15:40:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-28 15:40:18,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,392 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,392 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash -106917274, now seen corresponding path program 1 times [2019-11-28 15:40:18,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398104504] [2019-11-28 15:40:18,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-28 15:40:18,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398104504] [2019-11-28 15:40:18,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:18,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276189311] [2019-11-28 15:40:18,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,427 INFO L87 Difference]: Start difference. First operand 2723 states and 4076 transitions. Second operand 3 states. [2019-11-28 15:40:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:18,617 INFO L93 Difference]: Finished difference Result 5471 states and 8181 transitions. [2019-11-28 15:40:18,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:18,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-28 15:40:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:18,628 INFO L225 Difference]: With dead ends: 5471 [2019-11-28 15:40:18,628 INFO L226 Difference]: Without dead ends: 2755 [2019-11-28 15:40:18,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-28 15:40:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-11-28 15:40:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-28 15:40:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4044 transitions. [2019-11-28 15:40:18,756 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4044 transitions. Word has length 133 [2019-11-28 15:40:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,757 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4044 transitions. [2019-11-28 15:40:18,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4044 transitions. [2019-11-28 15:40:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-28 15:40:18,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,761 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,761 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2091342634, now seen corresponding path program 1 times [2019-11-28 15:40:18,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529033696] [2019-11-28 15:40:18,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-28 15:40:18,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529033696] [2019-11-28 15:40:18,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:18,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140823804] [2019-11-28 15:40:18,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,818 INFO L87 Difference]: Start difference. First operand 2723 states and 4044 transitions. Second operand 3 states. [2019-11-28 15:40:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:19,057 INFO L93 Difference]: Finished difference Result 5521 states and 8174 transitions. [2019-11-28 15:40:19,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:19,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-28 15:40:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:19,070 INFO L225 Difference]: With dead ends: 5521 [2019-11-28 15:40:19,070 INFO L226 Difference]: Without dead ends: 2805 [2019-11-28 15:40:19,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2019-11-28 15:40:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2723. [2019-11-28 15:40:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-28 15:40:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3956 transitions. [2019-11-28 15:40:19,173 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3956 transitions. Word has length 163 [2019-11-28 15:40:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:19,174 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 3956 transitions. [2019-11-28 15:40:19,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3956 transitions. [2019-11-28 15:40:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-28 15:40:19,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:19,179 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:19,179 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:19,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1144304748, now seen corresponding path program 1 times [2019-11-28 15:40:19,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:19,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562349812] [2019-11-28 15:40:19,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-28 15:40:19,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562349812] [2019-11-28 15:40:19,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:19,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:19,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012205229] [2019-11-28 15:40:19,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:19,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:19,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:19,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,229 INFO L87 Difference]: Start difference. First operand 2723 states and 3956 transitions. Second operand 3 states. [2019-11-28 15:40:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:19,663 INFO L93 Difference]: Finished difference Result 5711 states and 8273 transitions. [2019-11-28 15:40:19,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:19,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-28 15:40:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:19,679 INFO L225 Difference]: With dead ends: 5711 [2019-11-28 15:40:19,679 INFO L226 Difference]: Without dead ends: 2995 [2019-11-28 15:40:19,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-11-28 15:40:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2839. [2019-11-28 15:40:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-11-28 15:40:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4044 transitions. [2019-11-28 15:40:19,823 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4044 transitions. Word has length 163 [2019-11-28 15:40:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:19,824 INFO L462 AbstractCegarLoop]: Abstraction has 2839 states and 4044 transitions. [2019-11-28 15:40:19,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4044 transitions. [2019-11-28 15:40:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-28 15:40:19,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:19,832 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:19,832 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1925800112, now seen corresponding path program 1 times [2019-11-28 15:40:19,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:19,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183837648] [2019-11-28 15:40:19,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:40:19,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183837648] [2019-11-28 15:40:19,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115983956] [2019-11-28 15:40:19,970 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 15:40:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:20,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:20,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-28 15:40:20,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:20,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:20,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388236342] [2019-11-28 15:40:20,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:20,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:20,186 INFO L87 Difference]: Start difference. First operand 2839 states and 4044 transitions. Second operand 3 states. [2019-11-28 15:40:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:20,401 INFO L93 Difference]: Finished difference Result 8484 states and 12071 transitions. [2019-11-28 15:40:20,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:20,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-28 15:40:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:20,429 INFO L225 Difference]: With dead ends: 8484 [2019-11-28 15:40:20,429 INFO L226 Difference]: Without dead ends: 5652 [2019-11-28 15:40:20,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2019-11-28 15:40:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5650. [2019-11-28 15:40:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-11-28 15:40:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 8033 transitions. [2019-11-28 15:40:20,707 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 8033 transitions. Word has length 171 [2019-11-28 15:40:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:20,708 INFO L462 AbstractCegarLoop]: Abstraction has 5650 states and 8033 transitions. [2019-11-28 15:40:20,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 8033 transitions. [2019-11-28 15:40:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-28 15:40:20,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:20,721 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:20,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:20,929 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:20,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1741886925, now seen corresponding path program 1 times [2019-11-28 15:40:20,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:20,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951135181] [2019-11-28 15:40:20,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:40:21,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951135181] [2019-11-28 15:40:21,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379333187] [2019-11-28 15:40:21,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 15:40:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:21,165 INFO L264 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:40:21,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-28 15:40:21,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:21,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:21,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980985156] [2019-11-28 15:40:21,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:21,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:21,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:21,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:21,261 INFO L87 Difference]: Start difference. First operand 5650 states and 8033 transitions. Second operand 3 states. [2019-11-28 15:40:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:21,728 INFO L93 Difference]: Finished difference Result 11836 states and 16798 transitions. [2019-11-28 15:40:21,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:21,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-28 15:40:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:21,739 INFO L225 Difference]: With dead ends: 11836 [2019-11-28 15:40:21,739 INFO L226 Difference]: Without dead ends: 5994 [2019-11-28 15:40:21,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2019-11-28 15:40:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 5834. [2019-11-28 15:40:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2019-11-28 15:40:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 8265 transitions. [2019-11-28 15:40:21,948 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 8265 transitions. Word has length 172 [2019-11-28 15:40:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:21,949 INFO L462 AbstractCegarLoop]: Abstraction has 5834 states and 8265 transitions. [2019-11-28 15:40:21,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 8265 transitions. [2019-11-28 15:40:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-28 15:40:21,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:21,958 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:22,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:22,164 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1648497422, now seen corresponding path program 1 times [2019-11-28 15:40:22,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:22,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255640460] [2019-11-28 15:40:22,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:40:22,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255640460] [2019-11-28 15:40:22,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693231056] [2019-11-28 15:40:22,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 15:40:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:22,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:40:22,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-11-28 15:40:22,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:22,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:22,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111339162] [2019-11-28 15:40:22,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:22,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:22,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:22,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:22,378 INFO L87 Difference]: Start difference. First operand 5834 states and 8265 transitions. Second operand 3 states. [2019-11-28 15:40:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:22,896 INFO L93 Difference]: Finished difference Result 10593 states and 14957 transitions. [2019-11-28 15:40:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:22,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-28 15:40:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:22,912 INFO L225 Difference]: With dead ends: 10593 [2019-11-28 15:40:22,912 INFO L226 Difference]: Without dead ends: 4615 [2019-11-28 15:40:22,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2019-11-28 15:40:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4471. [2019-11-28 15:40:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-28 15:40:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6324 transitions. [2019-11-28 15:40:23,141 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6324 transitions. Word has length 173 [2019-11-28 15:40:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,141 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6324 transitions. [2019-11-28 15:40:23,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6324 transitions. [2019-11-28 15:40:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-28 15:40:23,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,149 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:23,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:23,355 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash 492657149, now seen corresponding path program 1 times [2019-11-28 15:40:23,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332529571] [2019-11-28 15:40:23,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-28 15:40:23,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332529571] [2019-11-28 15:40:23,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975416152] [2019-11-28 15:40:23,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,549 INFO L264 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:40:23,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-11-28 15:40:23,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:23,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-28 15:40:23,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28853140] [2019-11-28 15:40:23,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:23,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:23,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:40:23,605 INFO L87 Difference]: Start difference. First operand 4471 states and 6324 transitions. Second operand 3 states. [2019-11-28 15:40:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,752 INFO L93 Difference]: Finished difference Result 8870 states and 12551 transitions. [2019-11-28 15:40:23,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-28 15:40:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,762 INFO L225 Difference]: With dead ends: 8870 [2019-11-28 15:40:23,762 INFO L226 Difference]: Without dead ends: 4473 [2019-11-28 15:40:23,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:40:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2019-11-28 15:40:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4471. [2019-11-28 15:40:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-28 15:40:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6308 transitions. [2019-11-28 15:40:23,910 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6308 transitions. Word has length 176 [2019-11-28 15:40:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,911 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6308 transitions. [2019-11-28 15:40:23,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6308 transitions. [2019-11-28 15:40:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-28 15:40:23,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,918 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:24,123 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,124 INFO L82 PathProgramCache]: Analyzing trace with hash 750822587, now seen corresponding path program 1 times [2019-11-28 15:40:24,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793797419] [2019-11-28 15:40:24,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-28 15:40:24,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793797419] [2019-11-28 15:40:24,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558803830] [2019-11-28 15:40:24,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 15:40:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,351 INFO L264 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:40:24,354 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-11-28 15:40:24,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:24,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-28 15:40:24,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078201238] [2019-11-28 15:40:24,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:40:24,387 INFO L87 Difference]: Start difference. First operand 4471 states and 6308 transitions. Second operand 3 states. [2019-11-28 15:40:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,672 INFO L93 Difference]: Finished difference Result 7803 states and 10977 transitions. [2019-11-28 15:40:24,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-28 15:40:24,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,680 INFO L225 Difference]: With dead ends: 7803 [2019-11-28 15:40:24,680 INFO L226 Difference]: Without dead ends: 3298 [2019-11-28 15:40:24,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:40:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-11-28 15:40:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3178. [2019-11-28 15:40:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-11-28 15:40:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4467 transitions. [2019-11-28 15:40:24,819 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4467 transitions. Word has length 176 [2019-11-28 15:40:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,819 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4467 transitions. [2019-11-28 15:40:24,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4467 transitions. [2019-11-28 15:40:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-28 15:40:24,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,827 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:25,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:25,030 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,031 INFO L82 PathProgramCache]: Analyzing trace with hash 290208357, now seen corresponding path program 2 times [2019-11-28 15:40:25,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104317246] [2019-11-28 15:40:25,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 191 proven. 19 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:40:25,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104317246] [2019-11-28 15:40:25,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476648670] [2019-11-28 15:40:25,163 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 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 15:40:25,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 15:40:25,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:40:25,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:40:25,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-11-28 15:40:25,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:25,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:25,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890926845] [2019-11-28 15:40:25,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:25,258 INFO L87 Difference]: Start difference. First operand 3178 states and 4467 transitions. Second operand 3 states. [2019-11-28 15:40:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,535 INFO L93 Difference]: Finished difference Result 6414 states and 9030 transitions. [2019-11-28 15:40:25,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-28 15:40:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,545 INFO L225 Difference]: With dead ends: 6414 [2019-11-28 15:40:25,546 INFO L226 Difference]: Without dead ends: 3362 [2019-11-28 15:40:25,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2019-11-28 15:40:25,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3178. [2019-11-28 15:40:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-11-28 15:40:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4451 transitions. [2019-11-28 15:40:25,658 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4451 transitions. Word has length 181 [2019-11-28 15:40:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,658 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4451 transitions. [2019-11-28 15:40:25,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4451 transitions. [2019-11-28 15:40:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-28 15:40:25,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,664 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:25,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:25,871 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1359170395, now seen corresponding path program 1 times [2019-11-28 15:40:25,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20841611] [2019-11-28 15:40:25,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:40:25,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20841611] [2019-11-28 15:40:25,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370147632] [2019-11-28 15:40:25,950 INFO L94 rtionOrderModulation]: Keeping assertion order 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 15:40:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,034 INFO L264 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:26,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-28 15:40:26,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:26,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:26,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35677967] [2019-11-28 15:40:26,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:26,083 INFO L87 Difference]: Start difference. First operand 3178 states and 4451 transitions. Second operand 3 states. [2019-11-28 15:40:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,309 INFO L93 Difference]: Finished difference Result 9098 states and 12761 transitions. [2019-11-28 15:40:26,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-28 15:40:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,324 INFO L225 Difference]: With dead ends: 9098 [2019-11-28 15:40:26,325 INFO L226 Difference]: Without dead ends: 6110 [2019-11-28 15:40:26,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2019-11-28 15:40:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6108. [2019-11-28 15:40:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-11-28 15:40:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 8553 transitions. [2019-11-28 15:40:26,540 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 8553 transitions. Word has length 183 [2019-11-28 15:40:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,541 INFO L462 AbstractCegarLoop]: Abstraction has 6108 states and 8553 transitions. [2019-11-28 15:40:26,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 8553 transitions. [2019-11-28 15:40:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-28 15:40:26,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,550 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:26,763 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,764 INFO L82 PathProgramCache]: Analyzing trace with hash -580968611, now seen corresponding path program 1 times [2019-11-28 15:40:26,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657424344] [2019-11-28 15:40:26,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:40:26,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657424344] [2019-11-28 15:40:26,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562236430] [2019-11-28 15:40:26,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 15:40:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:26,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-28 15:40:26,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:26,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:26,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909237604] [2019-11-28 15:40:26,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:26,962 INFO L87 Difference]: Start difference. First operand 6108 states and 8553 transitions. Second operand 3 states. [2019-11-28 15:40:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,286 INFO L93 Difference]: Finished difference Result 12076 states and 16919 transitions. [2019-11-28 15:40:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-28 15:40:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,312 INFO L225 Difference]: With dead ends: 12076 [2019-11-28 15:40:27,313 INFO L226 Difference]: Without dead ends: 9088 [2019-11-28 15:40:27,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2019-11-28 15:40:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9086. [2019-11-28 15:40:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2019-11-28 15:40:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 12719 transitions. [2019-11-28 15:40:27,641 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 12719 transitions. Word has length 185 [2019-11-28 15:40:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,641 INFO L462 AbstractCegarLoop]: Abstraction has 9086 states and 12719 transitions. [2019-11-28 15:40:27,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 12719 transitions. [2019-11-28 15:40:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-28 15:40:27,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,653 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:27,861 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,862 INFO L82 PathProgramCache]: Analyzing trace with hash -607881575, now seen corresponding path program 1 times [2019-11-28 15:40:27,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665599342] [2019-11-28 15:40:27,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:40:27,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665599342] [2019-11-28 15:40:27,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402119093] [2019-11-28 15:40:27,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 15:40:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:28,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:28,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-28 15:40:28,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:28,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:28,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691043254] [2019-11-28 15:40:28,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:28,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:28,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:28,051 INFO L87 Difference]: Start difference. First operand 9086 states and 12719 transitions. Second operand 3 states. [2019-11-28 15:40:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,458 INFO L93 Difference]: Finished difference Result 20674 states and 28969 transitions. [2019-11-28 15:40:28,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:28,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-28 15:40:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:28,485 INFO L225 Difference]: With dead ends: 20674 [2019-11-28 15:40:28,485 INFO L226 Difference]: Without dead ends: 14708 [2019-11-28 15:40:28,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14708 states. [2019-11-28 15:40:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14708 to 14706. [2019-11-28 15:40:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-28 15:40:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20587 transitions. [2019-11-28 15:40:29,210 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20587 transitions. Word has length 186 [2019-11-28 15:40:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:29,210 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20587 transitions. [2019-11-28 15:40:29,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20587 transitions. [2019-11-28 15:40:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-28 15:40:29,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:29,226 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:29,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:29,430 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash 9813042, now seen corresponding path program 3 times [2019-11-28 15:40:29,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:29,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766337686] [2019-11-28 15:40:29,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 198 proven. 21 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:40:29,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766337686] [2019-11-28 15:40:29,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256719159] [2019-11-28 15:40:29,501 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 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 15:40:29,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-28 15:40:29,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:40:29,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:40:29,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-11-28 15:40:29,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:29,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:29,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991839801] [2019-11-28 15:40:29,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:29,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:29,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:29,605 INFO L87 Difference]: Start difference. First operand 14706 states and 20587 transitions. Second operand 3 states. [2019-11-28 15:40:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:30,322 INFO L93 Difference]: Finished difference Result 30070 states and 42014 transitions. [2019-11-28 15:40:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:30,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-28 15:40:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:30,350 INFO L225 Difference]: With dead ends: 30070 [2019-11-28 15:40:30,351 INFO L226 Difference]: Without dead ends: 15314 [2019-11-28 15:40:30,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2019-11-28 15:40:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 14706. [2019-11-28 15:40:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-28 15:40:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20547 transitions. [2019-11-28 15:40:30,979 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20547 transitions. Word has length 186 [2019-11-28 15:40:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:30,979 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20547 transitions. [2019-11-28 15:40:30,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20547 transitions. [2019-11-28 15:40:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-28 15:40:30,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:30,989 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:31,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:31,193 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:31,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash 854141729, now seen corresponding path program 1 times [2019-11-28 15:40:31,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:31,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236616157] [2019-11-28 15:40:31,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 198 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:40:31,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236616157] [2019-11-28 15:40:31,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813248180] [2019-11-28 15:40:31,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 15:40:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:31,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:40:31,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-11-28 15:40:31,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:31,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:31,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562545275] [2019-11-28 15:40:31,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:31,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:31,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:31,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:31,453 INFO L87 Difference]: Start difference. First operand 14706 states and 20547 transitions. Second operand 3 states. [2019-11-28 15:40:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:32,096 INFO L93 Difference]: Finished difference Result 29822 states and 41582 transitions. [2019-11-28 15:40:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:32,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-28 15:40:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:32,122 INFO L225 Difference]: With dead ends: 29822 [2019-11-28 15:40:32,122 INFO L226 Difference]: Without dead ends: 15186 [2019-11-28 15:40:32,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:32,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2019-11-28 15:40:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 14706. [2019-11-28 15:40:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-28 15:40:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20523 transitions. [2019-11-28 15:40:32,541 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20523 transitions. Word has length 187 [2019-11-28 15:40:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:32,541 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20523 transitions. [2019-11-28 15:40:32,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20523 transitions. [2019-11-28 15:40:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-28 15:40:32,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:32,551 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:32,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:32,755 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:32,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1508265096, now seen corresponding path program 4 times [2019-11-28 15:40:32,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:32,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177435818] [2019-11-28 15:40:32,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 196 proven. 27 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:40:32,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177435818] [2019-11-28 15:40:32,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916640618] [2019-11-28 15:40:32,814 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 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 15:40:32,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 15:40:32,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:40:32,904 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:40:32,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-28 15:40:32,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:32,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-28 15:40:32,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221864019] [2019-11-28 15:40:32,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:40:32,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:40:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:40:32,949 INFO L87 Difference]: Start difference. First operand 14706 states and 20523 transitions. Second operand 7 states. [2019-11-28 15:40:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:35,023 INFO L93 Difference]: Finished difference Result 50232 states and 68987 transitions. [2019-11-28 15:40:35,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 15:40:35,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-11-28 15:40:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:35,060 INFO L225 Difference]: With dead ends: 50232 [2019-11-28 15:40:35,060 INFO L226 Difference]: Without dead ends: 34696 [2019-11-28 15:40:35,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-28 15:40:35,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34696 states. [2019-11-28 15:40:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34696 to 17906. [2019-11-28 15:40:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17906 states. [2019-11-28 15:40:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17906 states to 17906 states and 24463 transitions. [2019-11-28 15:40:35,636 INFO L78 Accepts]: Start accepts. Automaton has 17906 states and 24463 transitions. Word has length 188 [2019-11-28 15:40:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:35,636 INFO L462 AbstractCegarLoop]: Abstraction has 17906 states and 24463 transitions. [2019-11-28 15:40:35,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:40:35,637 INFO L276 IsEmpty]: Start isEmpty. Operand 17906 states and 24463 transitions. [2019-11-28 15:40:35,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-28 15:40:35,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:35,641 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:35,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:35,842 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash 941780496, now seen corresponding path program 1 times [2019-11-28 15:40:35,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:35,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487666838] [2019-11-28 15:40:35,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:35,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:40:35,990 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:40:36,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:36 BoogieIcfgContainer [2019-11-28 15:40:36,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:36,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:36,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:36,076 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:36,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:10" (3/4) ... [2019-11-28 15:40:36,079 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 15:40:36,203 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:36,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:36,206 INFO L168 Benchmark]: Toolchain (without parser) took 26958.99 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 996.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 817.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:36,206 INFO L168 Benchmark]: CDTParser took 0.99 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 15:40:36,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:36,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:36,208 INFO L168 Benchmark]: Boogie Preprocessor took 41.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:36,208 INFO L168 Benchmark]: RCFGBuilder took 1003.39 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: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:36,209 INFO L168 Benchmark]: TraceAbstraction took 25127.74 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 885.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -130.4 MB). Peak memory consumption was 755.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:36,209 INFO L168 Benchmark]: Witness Printer took 128.24 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:36,212 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.99 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 580.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1003.39 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: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25127.74 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 885.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -130.4 MB). Peak memory consumption was 755.1 MB. Max. memory is 11.5 GB. * Witness Printer took 128.24 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L635] int s ; [L636] int tmp ; [L640] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 = __VERIFIER_nondet_int() ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L296] COND FALSE !(\read(s__hit)) [L299] s__state = 8512 [L301] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND TRUE s__state == 8512 [L306] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L307] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L308] COND TRUE __cil_tmp56 + 256UL [L309] skip = 1 [L317] s__state = 8528 [L318] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND TRUE s__state == 8528 [L322] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L323] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L325] __cil_tmp57 = (unsigned long )s__options [L326] COND TRUE __cil_tmp57 + 2097152UL [L327] s__s3__tmp__use_rsa_tmp = 1 [L332] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L359] ret = __VERIFIER_nondet_int() [L360] COND FALSE !(ret <= 0) [L377] s__state = 8544 [L378] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND TRUE s__state == 8544 [L382] COND TRUE s__verify_mode + 1 [L383] COND FALSE !(s__session__peer != 0) [L394] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L395] __cil_tmp61 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L396] COND FALSE !(__cil_tmp61 + 256UL) [L406] s__s3__tmp__cert_request = 1 [L407] ret = __VERIFIER_nondet_int() [L408] COND FALSE !(ret <= 0) [L411] s__state = 8448 [L412] s__s3__tmp__next_state___0 = 8576 [L413] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND TRUE s__state == 8448 [L434] COND FALSE !(num1 > 0L) [L443] s__state = s__s3__tmp__next_state___0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND TRUE s__state == 8576 [L447] ret = __VERIFIER_nondet_int() [L448] COND FALSE !(ret <= 0) [L451] COND FALSE !(ret == 2) [L454] ret = __VERIFIER_nondet_int() [L455] COND FALSE !(ret <= 0) [L458] s__init_num = 0 [L459] s__state = 8592 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND TRUE state == 8576 [L603] COND TRUE s__state == 8592 [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE tmp___2 != -16384 [L606] COND TRUE __cil_tmp56 != 4294967040 [L607] COND TRUE __cil_tmp58 != 4294967294 [L608] COND TRUE tmp___7 != 1024 [L609] COND TRUE tmp___7 != 512 [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 24.9s, OverallIterations: 42, TraceHistogramMax: 7, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8062 SDtfs, 6835 SDslu, 4489 SDs, 0 SdLazy, 4523 SolverSat, 1377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2283 GetRequests, 2203 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17906occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 41 MinimizatonAttempts, 19003 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 6893 NumberOfCodeBlocks, 6601 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 6649 ConstructedInterpolants, 0 QuantifiedInterpolants, 1685570 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3883 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 53 InterpolantComputations, 40 PerfectInterpolantSequences, 9886/10231 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 incorrect! Received shutdown request...