./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer --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 b9ebacab53db4f4e6d9f51b7145688401913e247 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-678e011 [2019-11-20 05:28:35,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:28:35,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:28:35,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:28:35,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:28:35,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:28:35,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:28:35,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:28:35,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:28:35,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:28:35,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:28:35,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:28:35,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:28:35,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:28:35,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:28:35,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:28:35,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:28:35,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:28:35,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:28:35,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:28:35,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:28:35,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:28:35,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:28:35,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:28:35,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:28:35,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:28:35,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:28:35,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:28:35,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:28:35,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:28:35,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:28:35,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:28:35,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:28:35,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:28:35,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:28:35,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:28:35,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:28:35,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:28:35,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:28:35,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:28:35,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:28:35,209 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:28:35,226 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:28:35,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:28:35,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:28:35,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:28:35,227 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:28:35,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:28:35,228 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:28:35,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:28:35,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:28:35,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:28:35,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:28:35,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:28:35,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:28:35,231 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:28:35,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:28:35,231 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:28:35,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:28:35,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:28:35,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:28:35,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:28:35,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:28:35,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:28:35,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:28:35,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:28:35,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:28:35,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:28:35,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:28:35,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:28:35,234 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer 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 -> b9ebacab53db4f4e6d9f51b7145688401913e247 [2019-11-20 05:28:35,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:28:35,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:28:35,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:28:35,414 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:28:35,414 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:28:35,415 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-20 05:28:35,469 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/data/442896085/e4e3ffb6f7e24790bac5eeb254806fda/FLAG0668e1169 [2019-11-20 05:28:35,858 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:28:35,858 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-20 05:28:35,881 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/data/442896085/e4e3ffb6f7e24790bac5eeb254806fda/FLAG0668e1169 [2019-11-20 05:28:36,224 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/data/442896085/e4e3ffb6f7e24790bac5eeb254806fda [2019-11-20 05:28:36,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:28:36,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:28:36,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:28:36,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:28:36,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:28:36,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238385a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36, skipping insertion in model container [2019-11-20 05:28:36,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,241 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:28:36,291 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:28:36,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:28:36,625 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:28:36,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:28:36,705 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:28:36,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36 WrapperNode [2019-11-20 05:28:36,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:28:36,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:28:36,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:28:36,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:28:36,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:28:36,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:28:36,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:28:36,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:28:36,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (1/1) ... [2019-11-20 05:28:36,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:28:36,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:28:36,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:28:36,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:28:36,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/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-20 05:28:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:28:36,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:28:36,964 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 05:28:37,592 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 05:28:37,592 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 05:28:37,593 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:28:37,593 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 05:28:37,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:28:37 BoogieIcfgContainer [2019-11-20 05:28:37,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:28:37,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:28:37,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:28:37,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:28:37,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:28:36" (1/3) ... [2019-11-20 05:28:37,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375bd4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:28:37, skipping insertion in model container [2019-11-20 05:28:37,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:28:36" (2/3) ... [2019-11-20 05:28:37,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375bd4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:28:37, skipping insertion in model container [2019-11-20 05:28:37,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:28:37" (3/3) ... [2019-11-20 05:28:37,600 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-11-20 05:28:37,609 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:28:37,615 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:28:37,622 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:28:37,643 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:28:37,644 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:28:37,644 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:28:37,644 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:28:37,644 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:28:37,644 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:28:37,645 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:28:37,645 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:28:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-11-20 05:28:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 05:28:37,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:37,668 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-20 05:28:37,668 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash 837253908, now seen corresponding path program 1 times [2019-11-20 05:28:37,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:37,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789075828] [2019-11-20 05:28:37,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:37,855 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-20 05:28:37,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789075828] [2019-11-20 05:28:37,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:37,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:37,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099975957] [2019-11-20 05:28:37,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:37,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:37,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:37,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:37,876 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 3 states. [2019-11-20 05:28:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:38,109 INFO L93 Difference]: Finished difference Result 352 states and 612 transitions. [2019-11-20 05:28:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:38,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 05:28:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:38,123 INFO L225 Difference]: With dead ends: 352 [2019-11-20 05:28:38,123 INFO L226 Difference]: Without dead ends: 173 [2019-11-20 05:28:38,126 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-20 05:28:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-20 05:28:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-11-20 05:28:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 05:28:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-11-20 05:28:38,169 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 27 [2019-11-20 05:28:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:38,169 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-11-20 05:28:38,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-11-20 05:28:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 05:28:38,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:38,171 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-20 05:28:38,171 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:38,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1153856875, now seen corresponding path program 1 times [2019-11-20 05:28:38,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:38,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555530129] [2019-11-20 05:28:38,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:38,224 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-20 05:28:38,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555530129] [2019-11-20 05:28:38,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:38,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:38,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133351753] [2019-11-20 05:28:38,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:38,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:38,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:38,227 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 3 states. [2019-11-20 05:28:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:38,381 INFO L93 Difference]: Finished difference Result 357 states and 574 transitions. [2019-11-20 05:28:38,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:38,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-20 05:28:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:38,385 INFO L225 Difference]: With dead ends: 357 [2019-11-20 05:28:38,385 INFO L226 Difference]: Without dead ends: 193 [2019-11-20 05:28:38,387 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-20 05:28:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-20 05:28:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-20 05:28:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-20 05:28:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2019-11-20 05:28:38,411 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 28 [2019-11-20 05:28:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:38,416 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2019-11-20 05:28:38,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2019-11-20 05:28:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 05:28:38,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:38,418 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-20 05:28:38,418 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1283716064, now seen corresponding path program 1 times [2019-11-20 05:28:38,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:38,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282520826] [2019-11-20 05:28:38,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:38,492 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-20 05:28:38,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282520826] [2019-11-20 05:28:38,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:38,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:38,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890765413] [2019-11-20 05:28:38,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:38,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:38,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:38,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:38,494 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand 3 states. [2019-11-20 05:28:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:38,662 INFO L93 Difference]: Finished difference Result 387 states and 615 transitions. [2019-11-20 05:28:38,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:38,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-20 05:28:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:38,667 INFO L225 Difference]: With dead ends: 387 [2019-11-20 05:28:38,667 INFO L226 Difference]: Without dead ends: 201 [2019-11-20 05:28:38,668 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-20 05:28:38,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-20 05:28:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-11-20 05:28:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-20 05:28:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2019-11-20 05:28:38,695 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 28 [2019-11-20 05:28:38,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:38,702 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2019-11-20 05:28:38,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2019-11-20 05:28:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 05:28:38,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:38,706 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-20 05:28:38,707 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:38,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:38,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1700322528, now seen corresponding path program 1 times [2019-11-20 05:28:38,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:38,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101217817] [2019-11-20 05:28:38,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:38,768 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-20 05:28:38,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101217817] [2019-11-20 05:28:38,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:38,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:38,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16721592] [2019-11-20 05:28:38,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:38,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:38,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:38,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:38,773 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand 3 states. [2019-11-20 05:28:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:38,935 INFO L93 Difference]: Finished difference Result 392 states and 625 transitions. [2019-11-20 05:28:38,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:38,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-20 05:28:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:38,937 INFO L225 Difference]: With dead ends: 392 [2019-11-20 05:28:38,937 INFO L226 Difference]: Without dead ends: 200 [2019-11-20 05:28:38,938 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-20 05:28:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-20 05:28:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-11-20 05:28:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-20 05:28:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2019-11-20 05:28:38,952 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 28 [2019-11-20 05:28:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:38,953 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2019-11-20 05:28:38,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2019-11-20 05:28:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 05:28:38,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:38,955 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-20 05:28:38,955 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:38,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:38,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1839049416, now seen corresponding path program 1 times [2019-11-20 05:28:38,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:38,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394446665] [2019-11-20 05:28:38,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:38,989 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-20 05:28:38,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394446665] [2019-11-20 05:28:38,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:38,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:38,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380634811] [2019-11-20 05:28:38,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:38,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:38,991 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2019-11-20 05:28:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:39,153 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2019-11-20 05:28:39,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:39,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-20 05:28:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:39,155 INFO L225 Difference]: With dead ends: 403 [2019-11-20 05:28:39,155 INFO L226 Difference]: Without dead ends: 210 [2019-11-20 05:28:39,156 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-20 05:28:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-20 05:28:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-20 05:28:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-20 05:28:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2019-11-20 05:28:39,187 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 29 [2019-11-20 05:28:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:39,188 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2019-11-20 05:28:39,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2019-11-20 05:28:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 05:28:39,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:39,192 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] [2019-11-20 05:28:39,192 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:39,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:39,193 INFO L82 PathProgramCache]: Analyzing trace with hash 208599556, now seen corresponding path program 1 times [2019-11-20 05:28:39,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:39,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327570451] [2019-11-20 05:28:39,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:39,225 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-20 05:28:39,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327570451] [2019-11-20 05:28:39,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:39,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:39,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358648119] [2019-11-20 05:28:39,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:39,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:39,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:39,227 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand 3 states. [2019-11-20 05:28:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:39,346 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2019-11-20 05:28:39,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:39,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-20 05:28:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:39,348 INFO L225 Difference]: With dead ends: 403 [2019-11-20 05:28:39,348 INFO L226 Difference]: Without dead ends: 210 [2019-11-20 05:28:39,349 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-20 05:28:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-20 05:28:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-20 05:28:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-20 05:28:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2019-11-20 05:28:39,359 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 30 [2019-11-20 05:28:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:39,359 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2019-11-20 05:28:39,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2019-11-20 05:28:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 05:28:39,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:39,367 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] [2019-11-20 05:28:39,368 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:39,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash 317962813, now seen corresponding path program 1 times [2019-11-20 05:28:39,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:39,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034618399] [2019-11-20 05:28:39,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:39,440 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-20 05:28:39,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034618399] [2019-11-20 05:28:39,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:39,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:39,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462718177] [2019-11-20 05:28:39,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:39,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:39,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:39,442 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2019-11-20 05:28:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:39,579 INFO L93 Difference]: Finished difference Result 403 states and 629 transitions. [2019-11-20 05:28:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:39,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-20 05:28:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:39,581 INFO L225 Difference]: With dead ends: 403 [2019-11-20 05:28:39,581 INFO L226 Difference]: Without dead ends: 210 [2019-11-20 05:28:39,582 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-20 05:28:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-20 05:28:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-20 05:28:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-20 05:28:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2019-11-20 05:28:39,592 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 31 [2019-11-20 05:28:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:39,592 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2019-11-20 05:28:39,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2019-11-20 05:28:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 05:28:39,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:39,593 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] [2019-11-20 05:28:39,594 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:39,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1377718110, now seen corresponding path program 1 times [2019-11-20 05:28:39,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:39,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551919155] [2019-11-20 05:28:39,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:39,671 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-20 05:28:39,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551919155] [2019-11-20 05:28:39,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:39,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:28:39,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209061233] [2019-11-20 05:28:39,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:28:39,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:39,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:28:39,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:28:39,673 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand 4 states. [2019-11-20 05:28:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:39,957 INFO L93 Difference]: Finished difference Result 599 states and 929 transitions. [2019-11-20 05:28:39,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:28:39,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-20 05:28:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:39,960 INFO L225 Difference]: With dead ends: 599 [2019-11-20 05:28:39,960 INFO L226 Difference]: Without dead ends: 406 [2019-11-20 05:28:39,961 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-20 05:28:39,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-20 05:28:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2019-11-20 05:28:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-20 05:28:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 594 transitions. [2019-11-20 05:28:39,985 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 594 transitions. Word has length 31 [2019-11-20 05:28:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:39,986 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 594 transitions. [2019-11-20 05:28:39,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:28:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 594 transitions. [2019-11-20 05:28:39,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 05:28:39,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:39,988 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-20 05:28:39,988 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:39,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:39,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610357, now seen corresponding path program 1 times [2019-11-20 05:28:39,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:39,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308884295] [2019-11-20 05:28:39,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:40,045 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-20 05:28:40,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308884295] [2019-11-20 05:28:40,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:40,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:40,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288739597] [2019-11-20 05:28:40,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:40,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:40,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:40,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:40,047 INFO L87 Difference]: Start difference. First operand 382 states and 594 transitions. Second operand 3 states. [2019-11-20 05:28:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:40,215 INFO L93 Difference]: Finished difference Result 841 states and 1323 transitions. [2019-11-20 05:28:40,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:40,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-20 05:28:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:40,219 INFO L225 Difference]: With dead ends: 841 [2019-11-20 05:28:40,219 INFO L226 Difference]: Without dead ends: 466 [2019-11-20 05:28:40,220 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-20 05:28:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-20 05:28:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 448. [2019-11-20 05:28:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-20 05:28:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 709 transitions. [2019-11-20 05:28:40,240 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 709 transitions. Word has length 43 [2019-11-20 05:28:40,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:40,240 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 709 transitions. [2019-11-20 05:28:40,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 709 transitions. [2019-11-20 05:28:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 05:28:40,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:40,242 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-20 05:28:40,242 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:40,242 INFO L82 PathProgramCache]: Analyzing trace with hash -918181316, now seen corresponding path program 1 times [2019-11-20 05:28:40,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:40,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492019245] [2019-11-20 05:28:40,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:40,269 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-20 05:28:40,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492019245] [2019-11-20 05:28:40,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:40,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:40,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061282311] [2019-11-20 05:28:40,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:40,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:40,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:40,271 INFO L87 Difference]: Start difference. First operand 448 states and 709 transitions. Second operand 3 states. [2019-11-20 05:28:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:40,440 INFO L93 Difference]: Finished difference Result 930 states and 1481 transitions. [2019-11-20 05:28:40,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:40,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 05:28:40,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:40,443 INFO L225 Difference]: With dead ends: 930 [2019-11-20 05:28:40,444 INFO L226 Difference]: Without dead ends: 489 [2019-11-20 05:28:40,444 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-20 05:28:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-20 05:28:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2019-11-20 05:28:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-20 05:28:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 752 transitions. [2019-11-20 05:28:40,468 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 752 transitions. Word has length 44 [2019-11-20 05:28:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:40,468 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 752 transitions. [2019-11-20 05:28:40,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2019-11-20 05:28:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 05:28:40,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:40,471 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-20 05:28:40,471 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:40,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:40,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1360549312, now seen corresponding path program 1 times [2019-11-20 05:28:40,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:40,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250759563] [2019-11-20 05:28:40,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:28:40,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250759563] [2019-11-20 05:28:40,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:40,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:40,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843488824] [2019-11-20 05:28:40,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:40,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:40,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:40,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:40,514 INFO L87 Difference]: Start difference. First operand 471 states and 752 transitions. Second operand 3 states. [2019-11-20 05:28:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:40,674 INFO L93 Difference]: Finished difference Result 987 states and 1577 transitions. [2019-11-20 05:28:40,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:40,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-20 05:28:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:40,678 INFO L225 Difference]: With dead ends: 987 [2019-11-20 05:28:40,678 INFO L226 Difference]: Without dead ends: 523 [2019-11-20 05:28:40,679 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-20 05:28:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-20 05:28:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-11-20 05:28:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-20 05:28:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 803 transitions. [2019-11-20 05:28:40,700 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 803 transitions. Word has length 55 [2019-11-20 05:28:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:40,701 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 803 transitions. [2019-11-20 05:28:40,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 803 transitions. [2019-11-20 05:28:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 05:28:40,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:40,702 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-11-20 05:28:40,703 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:40,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:40,703 INFO L82 PathProgramCache]: Analyzing trace with hash -938767092, now seen corresponding path program 1 times [2019-11-20 05:28:40,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:40,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109969723] [2019-11-20 05:28:40,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:28:40,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109969723] [2019-11-20 05:28:40,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:40,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:40,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537405265] [2019-11-20 05:28:40,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:40,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:40,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:40,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:40,749 INFO L87 Difference]: Start difference. First operand 505 states and 803 transitions. Second operand 3 states. [2019-11-20 05:28:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:40,896 INFO L93 Difference]: Finished difference Result 1021 states and 1625 transitions. [2019-11-20 05:28:40,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:40,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-20 05:28:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:40,900 INFO L225 Difference]: With dead ends: 1021 [2019-11-20 05:28:40,900 INFO L226 Difference]: Without dead ends: 523 [2019-11-20 05:28:40,901 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-20 05:28:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-20 05:28:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-11-20 05:28:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-20 05:28:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions. [2019-11-20 05:28:40,922 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 56 [2019-11-20 05:28:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:40,923 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 800 transitions. [2019-11-20 05:28:40,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions. [2019-11-20 05:28:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 05:28:40,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:40,924 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, 1, 1] [2019-11-20 05:28:40,925 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:40,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:40,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1817934782, now seen corresponding path program 1 times [2019-11-20 05:28:40,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:40,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936981002] [2019-11-20 05:28:40,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:40,961 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-20 05:28:40,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936981002] [2019-11-20 05:28:40,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:40,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:40,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060431184] [2019-11-20 05:28:40,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:40,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:40,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:40,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:40,963 INFO L87 Difference]: Start difference. First operand 505 states and 800 transitions. Second operand 3 states. [2019-11-20 05:28:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:41,117 INFO L93 Difference]: Finished difference Result 1068 states and 1696 transitions. [2019-11-20 05:28:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:41,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-20 05:28:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:41,121 INFO L225 Difference]: With dead ends: 1068 [2019-11-20 05:28:41,121 INFO L226 Difference]: Without dead ends: 570 [2019-11-20 05:28:41,122 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-20 05:28:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-20 05:28:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-11-20 05:28:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-11-20 05:28:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 897 transitions. [2019-11-20 05:28:41,145 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 897 transitions. Word has length 56 [2019-11-20 05:28:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:41,146 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 897 transitions. [2019-11-20 05:28:41,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 897 transitions. [2019-11-20 05:28:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 05:28:41,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:41,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:28:41,148 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1041214451, now seen corresponding path program 1 times [2019-11-20 05:28:41,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:41,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209715086] [2019-11-20 05:28:41,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:28:41,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209715086] [2019-11-20 05:28:41,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:41,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:41,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413803589] [2019-11-20 05:28:41,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:41,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:41,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:41,188 INFO L87 Difference]: Start difference. First operand 568 states and 897 transitions. Second operand 3 states. [2019-11-20 05:28:41,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:41,354 INFO L93 Difference]: Finished difference Result 1178 states and 1858 transitions. [2019-11-20 05:28:41,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:41,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-20 05:28:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:41,358 INFO L225 Difference]: With dead ends: 1178 [2019-11-20 05:28:41,358 INFO L226 Difference]: Without dead ends: 617 [2019-11-20 05:28:41,360 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-20 05:28:41,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-20 05:28:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-11-20 05:28:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-20 05:28:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2019-11-20 05:28:41,390 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 78 [2019-11-20 05:28:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:41,390 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2019-11-20 05:28:41,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:41,391 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2019-11-20 05:28:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 05:28:41,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:41,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:28:41,393 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash 45471174, now seen corresponding path program 1 times [2019-11-20 05:28:41,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:41,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245422117] [2019-11-20 05:28:41,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:28:41,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245422117] [2019-11-20 05:28:41,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:41,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:41,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357041589] [2019-11-20 05:28:41,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:41,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:41,442 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 3 states. [2019-11-20 05:28:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:41,631 INFO L93 Difference]: Finished difference Result 1221 states and 1919 transitions. [2019-11-20 05:28:41,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:41,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-20 05:28:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:41,636 INFO L225 Difference]: With dead ends: 1221 [2019-11-20 05:28:41,636 INFO L226 Difference]: Without dead ends: 617 [2019-11-20 05:28:41,639 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-20 05:28:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-20 05:28:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-11-20 05:28:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-20 05:28:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 958 transitions. [2019-11-20 05:28:41,684 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 958 transitions. Word has length 79 [2019-11-20 05:28:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:41,685 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 958 transitions. [2019-11-20 05:28:41,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 958 transitions. [2019-11-20 05:28:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:28:41,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:41,687 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, 1, 1] [2019-11-20 05:28:41,687 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash -998330754, now seen corresponding path program 1 times [2019-11-20 05:28:41,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:41,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852170682] [2019-11-20 05:28:41,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:41,718 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-20 05:28:41,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852170682] [2019-11-20 05:28:41,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:41,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:41,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258854806] [2019-11-20 05:28:41,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:41,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:41,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:41,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:41,720 INFO L87 Difference]: Start difference. First operand 611 states and 958 transitions. Second operand 3 states. [2019-11-20 05:28:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:41,875 INFO L93 Difference]: Finished difference Result 1217 states and 1907 transitions. [2019-11-20 05:28:41,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:41,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 05:28:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:41,879 INFO L225 Difference]: With dead ends: 1217 [2019-11-20 05:28:41,879 INFO L226 Difference]: Without dead ends: 613 [2019-11-20 05:28:41,880 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-20 05:28:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-20 05:28:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-11-20 05:28:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-20 05:28:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 953 transitions. [2019-11-20 05:28:41,905 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 953 transitions. Word has length 84 [2019-11-20 05:28:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:41,905 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 953 transitions. [2019-11-20 05:28:41,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 953 transitions. [2019-11-20 05:28:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 05:28:41,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:41,907 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 05:28:41,907 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash -92645170, now seen corresponding path program 1 times [2019-11-20 05:28:41,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:41,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901872087] [2019-11-20 05:28:41,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 05:28:41,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901872087] [2019-11-20 05:28:41,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:41,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:41,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496554420] [2019-11-20 05:28:41,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:41,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:41,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:41,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:41,942 INFO L87 Difference]: Start difference. First operand 611 states and 953 transitions. Second operand 3 states. [2019-11-20 05:28:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:42,084 INFO L93 Difference]: Finished difference Result 1275 states and 1990 transitions. [2019-11-20 05:28:42,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:42,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-20 05:28:42,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:42,088 INFO L225 Difference]: With dead ends: 1275 [2019-11-20 05:28:42,088 INFO L226 Difference]: Without dead ends: 671 [2019-11-20 05:28:42,089 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-20 05:28:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-20 05:28:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-11-20 05:28:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-20 05:28:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 996 transitions. [2019-11-20 05:28:42,116 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 996 transitions. Word has length 92 [2019-11-20 05:28:42,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:42,116 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 996 transitions. [2019-11-20 05:28:42,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 996 transitions. [2019-11-20 05:28:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 05:28:42,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:42,118 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 05:28:42,118 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1567438302, now seen corresponding path program 1 times [2019-11-20 05:28:42,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:42,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332254843] [2019-11-20 05:28:42,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 05:28:42,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332254843] [2019-11-20 05:28:42,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:42,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:42,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066920995] [2019-11-20 05:28:42,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:42,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:42,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:42,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:42,148 INFO L87 Difference]: Start difference. First operand 643 states and 996 transitions. Second operand 3 states. [2019-11-20 05:28:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:42,292 INFO L93 Difference]: Finished difference Result 1307 states and 2027 transitions. [2019-11-20 05:28:42,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:42,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-20 05:28:42,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:42,296 INFO L225 Difference]: With dead ends: 1307 [2019-11-20 05:28:42,296 INFO L226 Difference]: Without dead ends: 671 [2019-11-20 05:28:42,297 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-20 05:28:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-20 05:28:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-11-20 05:28:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-20 05:28:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 990 transitions. [2019-11-20 05:28:42,322 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 990 transitions. Word has length 93 [2019-11-20 05:28:42,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:42,323 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 990 transitions. [2019-11-20 05:28:42,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 990 transitions. [2019-11-20 05:28:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 05:28:42,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:42,325 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, 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] [2019-11-20 05:28:42,325 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:42,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1415900119, now seen corresponding path program 1 times [2019-11-20 05:28:42,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:42,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393269943] [2019-11-20 05:28:42,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 05:28:42,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393269943] [2019-11-20 05:28:42,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:42,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:42,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268265651] [2019-11-20 05:28:42,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:42,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:42,358 INFO L87 Difference]: Start difference. First operand 643 states and 990 transitions. Second operand 3 states. [2019-11-20 05:28:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:42,526 INFO L93 Difference]: Finished difference Result 1343 states and 2067 transitions. [2019-11-20 05:28:42,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:42,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 05:28:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:42,530 INFO L225 Difference]: With dead ends: 1343 [2019-11-20 05:28:42,530 INFO L226 Difference]: Without dead ends: 707 [2019-11-20 05:28:42,531 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-20 05:28:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-11-20 05:28:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 695. [2019-11-20 05:28:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-11-20 05:28:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1066 transitions. [2019-11-20 05:28:42,559 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1066 transitions. Word has length 99 [2019-11-20 05:28:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:42,559 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1066 transitions. [2019-11-20 05:28:42,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1066 transitions. [2019-11-20 05:28:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 05:28:42,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:42,561 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, 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] [2019-11-20 05:28:42,562 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:42,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:42,562 INFO L82 PathProgramCache]: Analyzing trace with hash 128670256, now seen corresponding path program 1 times [2019-11-20 05:28:42,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:42,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411713296] [2019-11-20 05:28:42,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 05:28:42,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411713296] [2019-11-20 05:28:42,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:42,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:42,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92276329] [2019-11-20 05:28:42,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:42,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:42,595 INFO L87 Difference]: Start difference. First operand 695 states and 1066 transitions. Second operand 3 states. [2019-11-20 05:28:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:42,753 INFO L93 Difference]: Finished difference Result 1400 states and 2149 transitions. [2019-11-20 05:28:42,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:42,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 05:28:42,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:42,758 INFO L225 Difference]: With dead ends: 1400 [2019-11-20 05:28:42,758 INFO L226 Difference]: Without dead ends: 708 [2019-11-20 05:28:42,759 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-20 05:28:42,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-11-20 05:28:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2019-11-20 05:28:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-20 05:28:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2019-11-20 05:28:42,787 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2019-11-20 05:28:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:42,787 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2019-11-20 05:28:42,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2019-11-20 05:28:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 05:28:42,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:42,789 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, 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-20 05:28:42,789 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:42,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:42,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1243086285, now seen corresponding path program 1 times [2019-11-20 05:28:42,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:42,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126425210] [2019-11-20 05:28:42,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 05:28:42,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126425210] [2019-11-20 05:28:42,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:42,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:42,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531843166] [2019-11-20 05:28:42,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:42,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:42,823 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2019-11-20 05:28:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:42,970 INFO L93 Difference]: Finished difference Result 1432 states and 2191 transitions. [2019-11-20 05:28:42,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:42,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-20 05:28:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:42,975 INFO L225 Difference]: With dead ends: 1432 [2019-11-20 05:28:42,975 INFO L226 Difference]: Without dead ends: 743 [2019-11-20 05:28:42,976 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-20 05:28:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-20 05:28:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-11-20 05:28:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-20 05:28:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1122 transitions. [2019-11-20 05:28:43,005 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1122 transitions. Word has length 111 [2019-11-20 05:28:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:43,005 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1122 transitions. [2019-11-20 05:28:43,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1122 transitions. [2019-11-20 05:28:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 05:28:43,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:43,007 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, 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-20 05:28:43,007 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:43,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2098703404, now seen corresponding path program 1 times [2019-11-20 05:28:43,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:43,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666740795] [2019-11-20 05:28:43,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 05:28:43,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666740795] [2019-11-20 05:28:43,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:43,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:43,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7680107] [2019-11-20 05:28:43,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:43,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:43,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:43,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:43,046 INFO L87 Difference]: Start difference. First operand 737 states and 1122 transitions. Second operand 3 states. [2019-11-20 05:28:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:43,221 INFO L93 Difference]: Finished difference Result 1473 states and 2241 transitions. [2019-11-20 05:28:43,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:43,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-20 05:28:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:43,226 INFO L225 Difference]: With dead ends: 1473 [2019-11-20 05:28:43,226 INFO L226 Difference]: Without dead ends: 743 [2019-11-20 05:28:43,228 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-20 05:28:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-20 05:28:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-11-20 05:28:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-20 05:28:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1117 transitions. [2019-11-20 05:28:43,263 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1117 transitions. Word has length 112 [2019-11-20 05:28:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:43,264 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1117 transitions. [2019-11-20 05:28:43,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1117 transitions. [2019-11-20 05:28:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 05:28:43,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:43,266 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 05:28:43,266 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:43,267 INFO L82 PathProgramCache]: Analyzing trace with hash -742521014, now seen corresponding path program 1 times [2019-11-20 05:28:43,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:43,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124973194] [2019-11-20 05:28:43,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-20 05:28:43,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124973194] [2019-11-20 05:28:43,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:43,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:43,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542641770] [2019-11-20 05:28:43,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:43,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:43,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:43,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:43,339 INFO L87 Difference]: Start difference. First operand 737 states and 1117 transitions. Second operand 3 states. [2019-11-20 05:28:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:43,472 INFO L93 Difference]: Finished difference Result 1509 states and 2284 transitions. [2019-11-20 05:28:43,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:43,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-20 05:28:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:43,477 INFO L225 Difference]: With dead ends: 1509 [2019-11-20 05:28:43,477 INFO L226 Difference]: Without dead ends: 779 [2019-11-20 05:28:43,478 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-20 05:28:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-20 05:28:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-11-20 05:28:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-20 05:28:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1155 transitions. [2019-11-20 05:28:43,509 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1155 transitions. Word has length 114 [2019-11-20 05:28:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:43,510 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1155 transitions. [2019-11-20 05:28:43,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1155 transitions. [2019-11-20 05:28:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 05:28:43,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:43,512 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 05:28:43,512 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:43,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1633130946, now seen corresponding path program 1 times [2019-11-20 05:28:43,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:43,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105992908] [2019-11-20 05:28:43,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-20 05:28:43,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105992908] [2019-11-20 05:28:43,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:43,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:43,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739577831] [2019-11-20 05:28:43,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:43,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:43,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:43,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:43,573 INFO L87 Difference]: Start difference. First operand 769 states and 1155 transitions. Second operand 3 states. [2019-11-20 05:28:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:43,709 INFO L93 Difference]: Finished difference Result 1541 states and 2313 transitions. [2019-11-20 05:28:43,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:43,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-20 05:28:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:43,714 INFO L225 Difference]: With dead ends: 1541 [2019-11-20 05:28:43,714 INFO L226 Difference]: Without dead ends: 779 [2019-11-20 05:28:43,717 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-20 05:28:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-20 05:28:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-11-20 05:28:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-20 05:28:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1146 transitions. [2019-11-20 05:28:43,748 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1146 transitions. Word has length 115 [2019-11-20 05:28:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:43,748 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1146 transitions. [2019-11-20 05:28:43,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1146 transitions. [2019-11-20 05:28:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 05:28:43,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:43,751 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:28:43,751 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:43,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1432440334, now seen corresponding path program 1 times [2019-11-20 05:28:43,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:43,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242142476] [2019-11-20 05:28:43,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-20 05:28:43,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242142476] [2019-11-20 05:28:43,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:43,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:43,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860402610] [2019-11-20 05:28:43,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:43,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:43,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:43,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:43,789 INFO L87 Difference]: Start difference. First operand 769 states and 1146 transitions. Second operand 3 states. [2019-11-20 05:28:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:43,922 INFO L93 Difference]: Finished difference Result 1567 states and 2334 transitions. [2019-11-20 05:28:43,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:43,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-20 05:28:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:43,927 INFO L225 Difference]: With dead ends: 1567 [2019-11-20 05:28:43,927 INFO L226 Difference]: Without dead ends: 805 [2019-11-20 05:28:43,928 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-20 05:28:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-20 05:28:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-11-20 05:28:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-20 05:28:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1177 transitions. [2019-11-20 05:28:43,961 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1177 transitions. Word has length 136 [2019-11-20 05:28:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:43,962 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1177 transitions. [2019-11-20 05:28:43,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1177 transitions. [2019-11-20 05:28:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 05:28:43,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:43,964 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:28:43,964 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:43,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:43,965 INFO L82 PathProgramCache]: Analyzing trace with hash 700393094, now seen corresponding path program 1 times [2019-11-20 05:28:43,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:43,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726000205] [2019-11-20 05:28:43,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-20 05:28:44,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726000205] [2019-11-20 05:28:44,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:44,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:44,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467044056] [2019-11-20 05:28:44,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:44,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:44,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:44,009 INFO L87 Difference]: Start difference. First operand 797 states and 1177 transitions. Second operand 3 states. [2019-11-20 05:28:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:44,145 INFO L93 Difference]: Finished difference Result 1595 states and 2355 transitions. [2019-11-20 05:28:44,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:44,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-20 05:28:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:44,150 INFO L225 Difference]: With dead ends: 1595 [2019-11-20 05:28:44,150 INFO L226 Difference]: Without dead ends: 805 [2019-11-20 05:28:44,152 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-20 05:28:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-20 05:28:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-11-20 05:28:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-20 05:28:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1167 transitions. [2019-11-20 05:28:44,188 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1167 transitions. Word has length 137 [2019-11-20 05:28:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:44,188 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1167 transitions. [2019-11-20 05:28:44,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1167 transitions. [2019-11-20 05:28:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 05:28:44,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:44,191 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, 3, 3, 3, 3, 3, 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] [2019-11-20 05:28:44,193 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:44,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash 26936470, now seen corresponding path program 1 times [2019-11-20 05:28:44,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:44,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531876739] [2019-11-20 05:28:44,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-20 05:28:44,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531876739] [2019-11-20 05:28:44,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:44,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:44,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566209808] [2019-11-20 05:28:44,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:44,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:44,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:44,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:44,233 INFO L87 Difference]: Start difference. First operand 797 states and 1167 transitions. Second operand 3 states. [2019-11-20 05:28:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:44,393 INFO L93 Difference]: Finished difference Result 1650 states and 2409 transitions. [2019-11-20 05:28:44,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:44,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-20 05:28:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:44,398 INFO L225 Difference]: With dead ends: 1650 [2019-11-20 05:28:44,398 INFO L226 Difference]: Without dead ends: 860 [2019-11-20 05:28:44,399 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-20 05:28:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-11-20 05:28:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 846. [2019-11-20 05:28:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-20 05:28:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1228 transitions. [2019-11-20 05:28:44,436 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1228 transitions. Word has length 140 [2019-11-20 05:28:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:44,436 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1228 transitions. [2019-11-20 05:28:44,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1228 transitions. [2019-11-20 05:28:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 05:28:44,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:44,439 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2019-11-20 05:28:44,439 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1329151537, now seen corresponding path program 1 times [2019-11-20 05:28:44,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:44,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077385677] [2019-11-20 05:28:44,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-20 05:28:44,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077385677] [2019-11-20 05:28:44,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:44,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:44,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337696041] [2019-11-20 05:28:44,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:44,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:44,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:44,480 INFO L87 Difference]: Start difference. First operand 846 states and 1228 transitions. Second operand 3 states. [2019-11-20 05:28:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:44,650 INFO L93 Difference]: Finished difference Result 1699 states and 2467 transitions. [2019-11-20 05:28:44,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:44,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-20 05:28:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:44,656 INFO L225 Difference]: With dead ends: 1699 [2019-11-20 05:28:44,656 INFO L226 Difference]: Without dead ends: 844 [2019-11-20 05:28:44,657 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-20 05:28:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-11-20 05:28:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 830. [2019-11-20 05:28:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-20 05:28:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1205 transitions. [2019-11-20 05:28:44,695 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1205 transitions. Word has length 141 [2019-11-20 05:28:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:44,695 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1205 transitions. [2019-11-20 05:28:44,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1205 transitions. [2019-11-20 05:28:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-20 05:28:44,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:44,698 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 05:28:44,698 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:44,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:44,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1387042847, now seen corresponding path program 1 times [2019-11-20 05:28:44,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:44,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850930834] [2019-11-20 05:28:44,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 05:28:44,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850930834] [2019-11-20 05:28:44,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:44,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:44,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432199989] [2019-11-20 05:28:44,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:44,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:44,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:44,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:44,759 INFO L87 Difference]: Start difference. First operand 830 states and 1205 transitions. Second operand 3 states. [2019-11-20 05:28:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:44,919 INFO L93 Difference]: Finished difference Result 1665 states and 2417 transitions. [2019-11-20 05:28:44,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:44,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-20 05:28:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:44,924 INFO L225 Difference]: With dead ends: 1665 [2019-11-20 05:28:44,924 INFO L226 Difference]: Without dead ends: 842 [2019-11-20 05:28:44,926 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-20 05:28:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-11-20 05:28:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 830. [2019-11-20 05:28:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-20 05:28:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2019-11-20 05:28:44,961 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 145 [2019-11-20 05:28:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:44,961 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2019-11-20 05:28:44,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2019-11-20 05:28:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 05:28:44,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:44,964 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 05:28:44,964 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:44,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash 146712776, now seen corresponding path program 1 times [2019-11-20 05:28:44,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:44,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371317684] [2019-11-20 05:28:44,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 05:28:45,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371317684] [2019-11-20 05:28:45,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:45,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:28:45,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839712740] [2019-11-20 05:28:45,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:45,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:45,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:45,018 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 3 states. [2019-11-20 05:28:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:45,175 INFO L93 Difference]: Finished difference Result 1665 states and 2403 transitions. [2019-11-20 05:28:45,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:45,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-20 05:28:45,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:45,180 INFO L225 Difference]: With dead ends: 1665 [2019-11-20 05:28:45,181 INFO L226 Difference]: Without dead ends: 825 [2019-11-20 05:28:45,184 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-20 05:28:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-11-20 05:28:45,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2019-11-20 05:28:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 05:28:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2019-11-20 05:28:45,224 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 146 [2019-11-20 05:28:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:45,224 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2019-11-20 05:28:45,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2019-11-20 05:28:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-20 05:28:45,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:45,227 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-11-20 05:28:45,227 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:45,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1643771369, now seen corresponding path program 1 times [2019-11-20 05:28:45,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:45,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892706445] [2019-11-20 05:28:45,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-20 05:28:45,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892706445] [2019-11-20 05:28:45,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:45,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:28:45,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967877182] [2019-11-20 05:28:45,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:45,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:45,275 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand 3 states. [2019-11-20 05:28:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:45,344 INFO L93 Difference]: Finished difference Result 2411 states and 3459 transitions. [2019-11-20 05:28:45,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:45,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-20 05:28:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:45,354 INFO L225 Difference]: With dead ends: 2411 [2019-11-20 05:28:45,354 INFO L226 Difference]: Without dead ends: 1605 [2019-11-20 05:28:45,355 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-20 05:28:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-11-20 05:28:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 815. [2019-11-20 05:28:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-11-20 05:28:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1171 transitions. [2019-11-20 05:28:45,405 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1171 transitions. Word has length 153 [2019-11-20 05:28:45,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:45,405 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1171 transitions. [2019-11-20 05:28:45,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1171 transitions. [2019-11-20 05:28:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-20 05:28:45,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:45,408 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-11-20 05:28:45,409 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:45,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1697255769, now seen corresponding path program 1 times [2019-11-20 05:28:45,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:45,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978250185] [2019-11-20 05:28:45,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-20 05:28:45,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978250185] [2019-11-20 05:28:45,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:45,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:28:45,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649591340] [2019-11-20 05:28:45,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:45,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:45,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:45,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:45,478 INFO L87 Difference]: Start difference. First operand 815 states and 1171 transitions. Second operand 3 states. [2019-11-20 05:28:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:45,560 INFO L93 Difference]: Finished difference Result 2410 states and 3455 transitions. [2019-11-20 05:28:45,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:45,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-20 05:28:45,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:45,569 INFO L225 Difference]: With dead ends: 2410 [2019-11-20 05:28:45,570 INFO L226 Difference]: Without dead ends: 1602 [2019-11-20 05:28:45,571 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-20 05:28:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-11-20 05:28:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1600. [2019-11-20 05:28:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-11-20 05:28:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2291 transitions. [2019-11-20 05:28:45,649 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2291 transitions. Word has length 153 [2019-11-20 05:28:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:45,649 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2291 transitions. [2019-11-20 05:28:45,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2291 transitions. [2019-11-20 05:28:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 05:28:45,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:45,652 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-11-20 05:28:45,652 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:45,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:45,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1707419253, now seen corresponding path program 1 times [2019-11-20 05:28:45,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:45,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737858111] [2019-11-20 05:28:45,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-20 05:28:45,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737858111] [2019-11-20 05:28:45,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:45,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:28:45,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143939787] [2019-11-20 05:28:45,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:45,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:45,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:45,782 INFO L87 Difference]: Start difference. First operand 1600 states and 2291 transitions. Second operand 3 states. [2019-11-20 05:28:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:45,958 INFO L93 Difference]: Finished difference Result 4746 states and 6779 transitions. [2019-11-20 05:28:45,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:45,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-20 05:28:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:45,976 INFO L225 Difference]: With dead ends: 4746 [2019-11-20 05:28:45,976 INFO L226 Difference]: Without dead ends: 3153 [2019-11-20 05:28:45,979 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-20 05:28:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-11-20 05:28:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1600. [2019-11-20 05:28:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-11-20 05:28:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2287 transitions. [2019-11-20 05:28:46,071 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2287 transitions. Word has length 155 [2019-11-20 05:28:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:46,071 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2287 transitions. [2019-11-20 05:28:46,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2287 transitions. [2019-11-20 05:28:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 05:28:46,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:46,074 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-11-20 05:28:46,075 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:46,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:46,075 INFO L82 PathProgramCache]: Analyzing trace with hash 306587411, now seen corresponding path program 1 times [2019-11-20 05:28:46,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:46,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931473187] [2019-11-20 05:28:46,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:28:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 05:28:46,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931473187] [2019-11-20 05:28:46,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:28:46,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:28:46,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283718356] [2019-11-20 05:28:46,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:28:46,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:28:46,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:28:46,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:28:46,134 INFO L87 Difference]: Start difference. First operand 1600 states and 2287 transitions. Second operand 3 states. [2019-11-20 05:28:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:28:46,352 INFO L93 Difference]: Finished difference Result 4786 states and 6839 transitions. [2019-11-20 05:28:46,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:28:46,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-20 05:28:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:28:46,377 INFO L225 Difference]: With dead ends: 4786 [2019-11-20 05:28:46,384 INFO L226 Difference]: Without dead ends: 3193 [2019-11-20 05:28:46,387 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-20 05:28:46,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-11-20 05:28:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2019-11-20 05:28:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2019-11-20 05:28:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4487 transitions. [2019-11-20 05:28:46,581 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4487 transitions. Word has length 156 [2019-11-20 05:28:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:28:46,582 INFO L462 AbstractCegarLoop]: Abstraction has 3191 states and 4487 transitions. [2019-11-20 05:28:46,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:28:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4487 transitions. [2019-11-20 05:28:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 05:28:46,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:28:46,585 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-11-20 05:28:46,586 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:28:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:28:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1260527569, now seen corresponding path program 1 times [2019-11-20 05:28:46,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:28:46,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801029338] [2019-11-20 05:28:46,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:28:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:28:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:28:46,720 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 05:28:46,720 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 05:28:46,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:28:46 BoogieIcfgContainer [2019-11-20 05:28:46,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:28:46,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:28:46,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:28:46,820 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:28:46,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:28:37" (3/4) ... [2019-11-20 05:28:46,822 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 05:28:46,957 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bede1f37-68a7-4f5e-8088-6dc84178c224/bin/uautomizer/witness.graphml [2019-11-20 05:28:46,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:28:46,959 INFO L168 Benchmark]: Toolchain (without parser) took 10731.43 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 433.6 MB). Free memory was 950.1 MB in the beginning and 1.3 GB in the end (delta: -375.6 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:28:46,960 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:28:46,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:28:46,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:28:46,960 INFO L168 Benchmark]: Boogie Preprocessor took 35.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:28:46,961 INFO L168 Benchmark]: RCFGBuilder took 797.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:28:46,961 INFO L168 Benchmark]: TraceAbstraction took 9223.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 290.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -297.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:28:46,962 INFO L168 Benchmark]: Witness Printer took 138.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:28:46,963 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 477.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 797.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9223.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 290.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -297.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 138.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 697]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L702] int s ; [L703] int tmp ; [L707] 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 ; [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 ; [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 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND FALSE !(tmp___1 + 12288) [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L303] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L304] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L305] COND TRUE __cil_tmp56 + 256UL [L306] __cil_tmp56 = 256345 [L307] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L361] ret = __VERIFIER_nondet_int() [L362] COND FALSE !(blastFlag == 3) [L365] COND FALSE !(ret <= 0) [L382] s__state = 8544 [L383] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L387] COND TRUE s__verify_mode + 1 [L388] COND TRUE s__session__peer != 0 [L389] COND TRUE s__verify_mode + 4 [L390] s__verify_mode = 123 [L391] skip = 1 [L392] s__s3__tmp__cert_request = 0 [L393] s__state = 8560 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND TRUE s__state == 8560 [L437] ret = __VERIFIER_nondet_int() [L438] COND FALSE !(ret <= 0) [L441] s__s3__tmp__next_state___0 = 8576 [L442] s__state = 8448 [L443] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND TRUE ! s__s3__tmp__reuse_message [L653] COND TRUE ! skip [L654] COND TRUE state == 8560 [L655] COND TRUE s__state == 8448 [L656] COND TRUE s__verify_mode != -1 [L657] COND TRUE s__verify_mode != -2 [L658] COND TRUE __cil_tmp61 != 9021 [L659] COND TRUE __cil_tmp58 != 4294967294 [L660] COND TRUE blastFlag != 4 [L661] COND TRUE tmp___7 != 1024 [L697] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.1s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7083 SDtfs, 6887 SDslu, 1778 SDs, 0 SdLazy, 2873 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3191occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 567746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 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...