./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/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 f4c57aae7ed3dd683b199a99be2cffcf6f23506e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:33:41,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:33:41,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:33:41,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:33:41,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:33:41,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:33:41,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:33:41,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:33:41,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:33:41,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:33:41,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:33:41,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:33:41,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:33:41,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:33:41,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:33:41,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:33:41,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:33:41,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:33:41,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:33:41,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:33:41,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:33:41,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:33:41,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:33:41,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:33:41,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:33:41,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:33:41,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:33:41,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:33:41,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:33:41,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:33:41,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:33:41,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:33:41,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:33:41,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:33:41,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:33:41,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:33:41,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:33:41,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:33:41,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:33:41,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:33:41,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:33:41,488 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:33:41,500 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:33:41,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:33:41,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:33:41,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:33:41,502 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:33:41,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:33:41,502 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:33:41,502 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:33:41,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:33:41,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:33:41,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:33:41,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:33:41,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:33:41,504 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:33:41,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:33:41,504 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:33:41,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:33:41,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:33:41,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:33:41,505 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:33:41,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:33:41,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:33:41,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:33:41,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:33:41,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:33:41,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:33:41,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:33:41,506 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:33:41,506 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:33:41,506 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_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/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 -> f4c57aae7ed3dd683b199a99be2cffcf6f23506e [2019-12-07 14:33:41,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:33:41,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:33:41,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:33:41,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:33:41,625 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:33:41,626 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-12-07 14:33:41,662 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/data/6c0aa05a9/78188a11c2ef44b288cfeab7d1d699bc/FLAG98dfc816d [2019-12-07 14:33:42,078 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:33:42,079 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-12-07 14:33:42,086 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/data/6c0aa05a9/78188a11c2ef44b288cfeab7d1d699bc/FLAG98dfc816d [2019-12-07 14:33:42,095 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/data/6c0aa05a9/78188a11c2ef44b288cfeab7d1d699bc [2019-12-07 14:33:42,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:33:42,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:33:42,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:33:42,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:33:42,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:33:42,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408e5454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42, skipping insertion in model container [2019-12-07 14:33:42,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:33:42,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:33:42,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:33:42,305 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:33:42,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:33:42,351 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:33:42,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42 WrapperNode [2019-12-07 14:33:42,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:33:42,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:33:42,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:33:42,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:33:42,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:33:42,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:33:42,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:33:42,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:33:42,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (1/1) ... [2019-12-07 14:33:42,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:33:42,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:33:42,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:33:42,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:33:42,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/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-12-07 14:33:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:33:42,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:33:42,527 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:33:42,855 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 14:33:42,855 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 14:33:42,856 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:33:42,856 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:33:42,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:33:42 BoogieIcfgContainer [2019-12-07 14:33:42,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:33:42,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:33:42,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:33:42,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:33:42,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:33:42" (1/3) ... [2019-12-07 14:33:42,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f62e8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:33:42, skipping insertion in model container [2019-12-07 14:33:42,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:33:42" (2/3) ... [2019-12-07 14:33:42,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f62e8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:33:42, skipping insertion in model container [2019-12-07 14:33:42,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:33:42" (3/3) ... [2019-12-07 14:33:42,861 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2019-12-07 14:33:42,867 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:33:42,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:33:42,879 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:33:42,895 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:33:42,895 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:33:42,895 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:33:42,895 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:33:42,895 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:33:42,895 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:33:42,895 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:33:42,895 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:33:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 14:33:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:33:42,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:42,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:42,913 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:42,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:42,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1603119947, now seen corresponding path program 1 times [2019-12-07 14:33:42,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:42,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585542851] [2019-12-07 14:33:42,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:43,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585542851] [2019-12-07 14:33:43,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:43,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:43,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223426873] [2019-12-07 14:33:43,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:43,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:43,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:43,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:43,063 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-12-07 14:33:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:43,199 INFO L93 Difference]: Finished difference Result 315 states and 541 transitions. [2019-12-07 14:33:43,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:43,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 14:33:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:43,209 INFO L225 Difference]: With dead ends: 315 [2019-12-07 14:33:43,209 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 14:33:43,212 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-12-07 14:33:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 14:33:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-12-07 14:33:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 14:33:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 240 transitions. [2019-12-07 14:33:43,245 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 240 transitions. Word has length 25 [2019-12-07 14:33:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:43,246 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 240 transitions. [2019-12-07 14:33:43,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 240 transitions. [2019-12-07 14:33:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:33:43,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:43,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:43,247 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:43,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:43,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1655306444, now seen corresponding path program 1 times [2019-12-07 14:33:43,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:43,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360839691] [2019-12-07 14:33:43,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:43,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360839691] [2019-12-07 14:33:43,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:43,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:43,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856463834] [2019-12-07 14:33:43,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:43,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:43,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:43,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:43,284 INFO L87 Difference]: Start difference. First operand 152 states and 240 transitions. Second operand 3 states. [2019-12-07 14:33:43,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:43,366 INFO L93 Difference]: Finished difference Result 318 states and 501 transitions. [2019-12-07 14:33:43,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:43,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 14:33:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:43,367 INFO L225 Difference]: With dead ends: 318 [2019-12-07 14:33:43,367 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 14:33:43,369 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-12-07 14:33:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 14:33:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-12-07 14:33:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 14:33:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2019-12-07 14:33:43,379 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 26 [2019-12-07 14:33:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:43,379 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-12-07 14:33:43,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2019-12-07 14:33:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:33:43,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:43,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:43,381 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:43,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:43,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2083538751, now seen corresponding path program 1 times [2019-12-07 14:33:43,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:43,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623137178] [2019-12-07 14:33:43,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:43,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623137178] [2019-12-07 14:33:43,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:43,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:43,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302062007] [2019-12-07 14:33:43,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:43,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:43,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:43,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:43,413 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. Second operand 3 states. [2019-12-07 14:33:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:43,503 INFO L93 Difference]: Finished difference Result 347 states and 541 transitions. [2019-12-07 14:33:43,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:43,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 14:33:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:43,505 INFO L225 Difference]: With dead ends: 347 [2019-12-07 14:33:43,506 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 14:33:43,507 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-12-07 14:33:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 14:33:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-12-07 14:33:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 14:33:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 280 transitions. [2019-12-07 14:33:43,519 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 280 transitions. Word has length 26 [2019-12-07 14:33:43,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:43,519 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 280 transitions. [2019-12-07 14:33:43,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 280 transitions. [2019-12-07 14:33:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:33:43,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:43,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:43,521 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash -467027583, now seen corresponding path program 1 times [2019-12-07 14:33:43,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:43,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857606928] [2019-12-07 14:33:43,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:43,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857606928] [2019-12-07 14:33:43,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:43,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:43,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575252675] [2019-12-07 14:33:43,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:43,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:43,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:43,562 INFO L87 Difference]: Start difference. First operand 179 states and 280 transitions. Second operand 3 states. [2019-12-07 14:33:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:43,650 INFO L93 Difference]: Finished difference Result 352 states and 551 transitions. [2019-12-07 14:33:43,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:43,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 14:33:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:43,651 INFO L225 Difference]: With dead ends: 352 [2019-12-07 14:33:43,652 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 14:33:43,652 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-12-07 14:33:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 14:33:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-12-07 14:33:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:33:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 281 transitions. [2019-12-07 14:33:43,660 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 281 transitions. Word has length 26 [2019-12-07 14:33:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:43,660 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 281 transitions. [2019-12-07 14:33:43,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 281 transitions. [2019-12-07 14:33:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:33:43,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:43,661 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-12-07 14:33:43,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:43,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1902471129, now seen corresponding path program 1 times [2019-12-07 14:33:43,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:43,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216132601] [2019-12-07 14:33:43,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:43,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216132601] [2019-12-07 14:33:43,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:43,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:43,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017433360] [2019-12-07 14:33:43,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:43,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:43,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:43,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:43,685 INFO L87 Difference]: Start difference. First operand 180 states and 281 transitions. Second operand 3 states. [2019-12-07 14:33:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:43,764 INFO L93 Difference]: Finished difference Result 363 states and 563 transitions. [2019-12-07 14:33:43,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:43,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 14:33:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:43,765 INFO L225 Difference]: With dead ends: 363 [2019-12-07 14:33:43,766 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 14:33:43,766 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-12-07 14:33:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 14:33:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-12-07 14:33:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:33:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2019-12-07 14:33:43,773 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 27 [2019-12-07 14:33:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:43,773 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2019-12-07 14:33:43,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2019-12-07 14:33:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:33:43,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:43,774 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-12-07 14:33:43,775 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1605160869, now seen corresponding path program 1 times [2019-12-07 14:33:43,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:43,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518190874] [2019-12-07 14:33:43,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:43,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518190874] [2019-12-07 14:33:43,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:43,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:43,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190111881] [2019-12-07 14:33:43,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:43,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:43,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:43,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:43,796 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 3 states. [2019-12-07 14:33:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:43,881 INFO L93 Difference]: Finished difference Result 363 states and 559 transitions. [2019-12-07 14:33:43,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:43,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 14:33:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:43,883 INFO L225 Difference]: With dead ends: 363 [2019-12-07 14:33:43,883 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 14:33:43,884 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-12-07 14:33:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 14:33:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-12-07 14:33:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:33:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 277 transitions. [2019-12-07 14:33:43,892 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 277 transitions. Word has length 28 [2019-12-07 14:33:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:43,892 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 277 transitions. [2019-12-07 14:33:43,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 277 transitions. [2019-12-07 14:33:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:33:43,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:43,893 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-12-07 14:33:43,894 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1051085342, now seen corresponding path program 1 times [2019-12-07 14:33:43,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:43,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989184660] [2019-12-07 14:33:43,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:43,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989184660] [2019-12-07 14:33:43,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:43,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:43,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455577795] [2019-12-07 14:33:43,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:43,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:43,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:43,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:43,916 INFO L87 Difference]: Start difference. First operand 180 states and 277 transitions. Second operand 3 states. [2019-12-07 14:33:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:43,993 INFO L93 Difference]: Finished difference Result 363 states and 555 transitions. [2019-12-07 14:33:43,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:43,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 14:33:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:43,995 INFO L225 Difference]: With dead ends: 363 [2019-12-07 14:33:43,995 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 14:33:43,995 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-12-07 14:33:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 14:33:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-12-07 14:33:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:33:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-12-07 14:33:44,003 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 29 [2019-12-07 14:33:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:44,003 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-12-07 14:33:44,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2019-12-07 14:33:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:33:44,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:44,004 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-12-07 14:33:44,004 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1476768639, now seen corresponding path program 1 times [2019-12-07 14:33:44,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:44,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386699758] [2019-12-07 14:33:44,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:44,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386699758] [2019-12-07 14:33:44,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:44,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:33:44,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412952853] [2019-12-07 14:33:44,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:33:44,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:44,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:33:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:33:44,037 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand 4 states. [2019-12-07 14:33:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:44,170 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2019-12-07 14:33:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:33:44,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 14:33:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:44,172 INFO L225 Difference]: With dead ends: 511 [2019-12-07 14:33:44,172 INFO L226 Difference]: Without dead ends: 338 [2019-12-07 14:33:44,172 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-12-07 14:33:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-07 14:33:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2019-12-07 14:33:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-07 14:33:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2019-12-07 14:33:44,183 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 29 [2019-12-07 14:33:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:44,183 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2019-12-07 14:33:44,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:33:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2019-12-07 14:33:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:33:44,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:44,185 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-12-07 14:33:44,185 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:44,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:44,185 INFO L82 PathProgramCache]: Analyzing trace with hash -91605738, now seen corresponding path program 1 times [2019-12-07 14:33:44,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:44,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430589377] [2019-12-07 14:33:44,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:44,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430589377] [2019-12-07 14:33:44,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:44,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:44,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185610000] [2019-12-07 14:33:44,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:44,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:44,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:44,214 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand 3 states. [2019-12-07 14:33:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:44,315 INFO L93 Difference]: Finished difference Result 698 states and 1074 transitions. [2019-12-07 14:33:44,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:44,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 14:33:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:44,317 INFO L225 Difference]: With dead ends: 698 [2019-12-07 14:33:44,317 INFO L226 Difference]: Without dead ends: 382 [2019-12-07 14:33:44,318 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-12-07 14:33:44,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-12-07 14:33:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-12-07 14:33:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-07 14:33:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 581 transitions. [2019-12-07 14:33:44,328 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 581 transitions. Word has length 43 [2019-12-07 14:33:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:44,328 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 581 transitions. [2019-12-07 14:33:44,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 581 transitions. [2019-12-07 14:33:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 14:33:44,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:44,329 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-12-07 14:33:44,329 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033309, now seen corresponding path program 1 times [2019-12-07 14:33:44,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:44,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768648261] [2019-12-07 14:33:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:44,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768648261] [2019-12-07 14:33:44,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:44,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:44,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179899732] [2019-12-07 14:33:44,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:44,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:44,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:44,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:44,350 INFO L87 Difference]: Start difference. First operand 374 states and 581 transitions. Second operand 3 states. [2019-12-07 14:33:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:44,459 INFO L93 Difference]: Finished difference Result 775 states and 1210 transitions. [2019-12-07 14:33:44,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:44,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 14:33:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:44,461 INFO L225 Difference]: With dead ends: 775 [2019-12-07 14:33:44,462 INFO L226 Difference]: Without dead ends: 406 [2019-12-07 14:33:44,462 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-12-07 14:33:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-07 14:33:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 398. [2019-12-07 14:33:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-12-07 14:33:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 627 transitions. [2019-12-07 14:33:44,472 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 627 transitions. Word has length 44 [2019-12-07 14:33:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:44,473 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 627 transitions. [2019-12-07 14:33:44,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 627 transitions. [2019-12-07 14:33:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:33:44,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:44,473 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:44,474 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:44,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:44,474 INFO L82 PathProgramCache]: Analyzing trace with hash 501139110, now seen corresponding path program 1 times [2019-12-07 14:33:44,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:44,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203107659] [2019-12-07 14:33:44,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:33:44,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203107659] [2019-12-07 14:33:44,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:44,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:44,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735862416] [2019-12-07 14:33:44,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:44,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:44,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:44,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:44,493 INFO L87 Difference]: Start difference. First operand 398 states and 627 transitions. Second operand 3 states. [2019-12-07 14:33:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:44,595 INFO L93 Difference]: Finished difference Result 829 states and 1310 transitions. [2019-12-07 14:33:44,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:44,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 14:33:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:44,597 INFO L225 Difference]: With dead ends: 829 [2019-12-07 14:33:44,597 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 14:33:44,598 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-12-07 14:33:44,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 14:33:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-07 14:33:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-07 14:33:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 692 transitions. [2019-12-07 14:33:44,608 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 692 transitions. Word has length 54 [2019-12-07 14:33:44,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:44,608 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 692 transitions. [2019-12-07 14:33:44,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 692 transitions. [2019-12-07 14:33:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 14:33:44,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:44,610 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:44,610 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1234673389, now seen corresponding path program 1 times [2019-12-07 14:33:44,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:44,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603720037] [2019-12-07 14:33:44,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 14:33:44,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603720037] [2019-12-07 14:33:44,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:44,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:44,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998841368] [2019-12-07 14:33:44,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:44,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:44,642 INFO L87 Difference]: Start difference. First operand 438 states and 692 transitions. Second operand 3 states. [2019-12-07 14:33:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:44,748 INFO L93 Difference]: Finished difference Result 911 states and 1440 transitions. [2019-12-07 14:33:44,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:44,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-07 14:33:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:44,752 INFO L225 Difference]: With dead ends: 911 [2019-12-07 14:33:44,752 INFO L226 Difference]: Without dead ends: 480 [2019-12-07 14:33:44,753 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-12-07 14:33:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-07 14:33:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-12-07 14:33:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-07 14:33:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 752 transitions. [2019-12-07 14:33:44,770 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 752 transitions. Word has length 81 [2019-12-07 14:33:44,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:44,770 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 752 transitions. [2019-12-07 14:33:44,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 752 transitions. [2019-12-07 14:33:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 14:33:44,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:44,772 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:44,772 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:44,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:44,772 INFO L82 PathProgramCache]: Analyzing trace with hash -337353345, now seen corresponding path program 1 times [2019-12-07 14:33:44,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:44,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999843884] [2019-12-07 14:33:44,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 14:33:44,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999843884] [2019-12-07 14:33:44,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:44,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:44,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166917809] [2019-12-07 14:33:44,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:44,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:44,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:44,807 INFO L87 Difference]: Start difference. First operand 476 states and 752 transitions. Second operand 3 states. [2019-12-07 14:33:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:44,907 INFO L93 Difference]: Finished difference Result 949 states and 1497 transitions. [2019-12-07 14:33:44,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:44,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-07 14:33:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:44,909 INFO L225 Difference]: With dead ends: 949 [2019-12-07 14:33:44,909 INFO L226 Difference]: Without dead ends: 480 [2019-12-07 14:33:44,910 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-12-07 14:33:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-07 14:33:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-12-07 14:33:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-07 14:33:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 749 transitions. [2019-12-07 14:33:44,922 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 749 transitions. Word has length 82 [2019-12-07 14:33:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:44,922 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 749 transitions. [2019-12-07 14:33:44,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 749 transitions. [2019-12-07 14:33:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 14:33:44,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:44,923 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:44,923 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:44,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:44,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1112997795, now seen corresponding path program 1 times [2019-12-07 14:33:44,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:44,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558793923] [2019-12-07 14:33:44,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 14:33:44,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558793923] [2019-12-07 14:33:44,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:44,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:44,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643663036] [2019-12-07 14:33:44,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:44,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:44,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:44,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:44,947 INFO L87 Difference]: Start difference. First operand 476 states and 749 transitions. Second operand 3 states. [2019-12-07 14:33:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:45,045 INFO L93 Difference]: Finished difference Result 997 states and 1572 transitions. [2019-12-07 14:33:45,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:45,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 14:33:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:45,048 INFO L225 Difference]: With dead ends: 997 [2019-12-07 14:33:45,048 INFO L226 Difference]: Without dead ends: 528 [2019-12-07 14:33:45,049 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-12-07 14:33:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-12-07 14:33:45,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-12-07 14:33:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-07 14:33:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 804 transitions. [2019-12-07 14:33:45,062 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 804 transitions. Word has length 83 [2019-12-07 14:33:45,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:45,062 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 804 transitions. [2019-12-07 14:33:45,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 804 transitions. [2019-12-07 14:33:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:33:45,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:45,063 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:45,063 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:45,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1939998609, now seen corresponding path program 1 times [2019-12-07 14:33:45,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:45,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976699833] [2019-12-07 14:33:45,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 14:33:45,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976699833] [2019-12-07 14:33:45,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:45,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:45,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392283922] [2019-12-07 14:33:45,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:45,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:45,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:45,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:45,087 INFO L87 Difference]: Start difference. First operand 512 states and 804 transitions. Second operand 3 states. [2019-12-07 14:33:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:45,188 INFO L93 Difference]: Finished difference Result 1033 states and 1623 transitions. [2019-12-07 14:33:45,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:45,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 14:33:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:45,192 INFO L225 Difference]: With dead ends: 1033 [2019-12-07 14:33:45,192 INFO L226 Difference]: Without dead ends: 528 [2019-12-07 14:33:45,193 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-12-07 14:33:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-12-07 14:33:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-12-07 14:33:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-07 14:33:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 800 transitions. [2019-12-07 14:33:45,212 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 800 transitions. Word has length 84 [2019-12-07 14:33:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:45,213 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 800 transitions. [2019-12-07 14:33:45,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 800 transitions. [2019-12-07 14:33:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:33:45,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:45,214 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:45,214 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1409112293, now seen corresponding path program 1 times [2019-12-07 14:33:45,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:45,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011838846] [2019-12-07 14:33:45,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:45,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011838846] [2019-12-07 14:33:45,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:45,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:45,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964616398] [2019-12-07 14:33:45,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:45,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:45,245 INFO L87 Difference]: Start difference. First operand 512 states and 800 transitions. Second operand 3 states. [2019-12-07 14:33:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:45,357 INFO L93 Difference]: Finished difference Result 1078 states and 1682 transitions. [2019-12-07 14:33:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:45,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 14:33:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:45,359 INFO L225 Difference]: With dead ends: 1078 [2019-12-07 14:33:45,360 INFO L226 Difference]: Without dead ends: 573 [2019-12-07 14:33:45,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-12-07 14:33:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-12-07 14:33:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 565. [2019-12-07 14:33:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-12-07 14:33:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 881 transitions. [2019-12-07 14:33:45,375 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 881 transitions. Word has length 84 [2019-12-07 14:33:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:45,375 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 881 transitions. [2019-12-07 14:33:45,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 881 transitions. [2019-12-07 14:33:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:33:45,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:45,376 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:45,376 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:45,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1919478498, now seen corresponding path program 1 times [2019-12-07 14:33:45,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:45,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813209319] [2019-12-07 14:33:45,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:33:45,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813209319] [2019-12-07 14:33:45,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:45,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:45,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044611985] [2019-12-07 14:33:45,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:45,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:45,400 INFO L87 Difference]: Start difference. First operand 565 states and 881 transitions. Second operand 3 states. [2019-12-07 14:33:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:45,526 INFO L93 Difference]: Finished difference Result 1131 states and 1761 transitions. [2019-12-07 14:33:45,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:45,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-12-07 14:33:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:45,528 INFO L225 Difference]: With dead ends: 1131 [2019-12-07 14:33:45,528 INFO L226 Difference]: Without dead ends: 571 [2019-12-07 14:33:45,529 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-12-07 14:33:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-07 14:33:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2019-12-07 14:33:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-12-07 14:33:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 876 transitions. [2019-12-07 14:33:45,544 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 876 transitions. Word has length 85 [2019-12-07 14:33:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:45,544 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 876 transitions. [2019-12-07 14:33:45,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 876 transitions. [2019-12-07 14:33:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 14:33:45,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:45,545 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:45,546 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:45,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash -818800783, now seen corresponding path program 1 times [2019-12-07 14:33:45,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:45,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587582335] [2019-12-07 14:33:45,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 14:33:45,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587582335] [2019-12-07 14:33:45,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:45,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:45,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885110341] [2019-12-07 14:33:45,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:45,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:45,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:45,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:45,580 INFO L87 Difference]: Start difference. First operand 563 states and 876 transitions. Second operand 3 states. [2019-12-07 14:33:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:45,670 INFO L93 Difference]: Finished difference Result 1159 states and 1804 transitions. [2019-12-07 14:33:45,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:45,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 14:33:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:45,673 INFO L225 Difference]: With dead ends: 1159 [2019-12-07 14:33:45,673 INFO L226 Difference]: Without dead ends: 603 [2019-12-07 14:33:45,674 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-12-07 14:33:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-12-07 14:33:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-12-07 14:33:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-12-07 14:33:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 917 transitions. [2019-12-07 14:33:45,690 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 917 transitions. Word has length 106 [2019-12-07 14:33:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:45,690 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 917 transitions. [2019-12-07 14:33:45,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 917 transitions. [2019-12-07 14:33:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 14:33:45,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:45,692 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:45,692 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:45,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1053492997, now seen corresponding path program 1 times [2019-12-07 14:33:45,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:45,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353259195] [2019-12-07 14:33:45,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 14:33:45,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353259195] [2019-12-07 14:33:45,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:45,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:45,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872848071] [2019-12-07 14:33:45,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:45,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:45,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:45,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:45,712 INFO L87 Difference]: Start difference. First operand 593 states and 917 transitions. Second operand 3 states. [2019-12-07 14:33:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:45,805 INFO L93 Difference]: Finished difference Result 1189 states and 1839 transitions. [2019-12-07 14:33:45,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:45,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-12-07 14:33:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:45,807 INFO L225 Difference]: With dead ends: 1189 [2019-12-07 14:33:45,807 INFO L226 Difference]: Without dead ends: 603 [2019-12-07 14:33:45,808 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-12-07 14:33:45,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-12-07 14:33:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-12-07 14:33:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-12-07 14:33:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 911 transitions. [2019-12-07 14:33:45,824 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 911 transitions. Word has length 107 [2019-12-07 14:33:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:45,824 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 911 transitions. [2019-12-07 14:33:45,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 911 transitions. [2019-12-07 14:33:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 14:33:45,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:45,825 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:45,825 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:45,826 INFO L82 PathProgramCache]: Analyzing trace with hash 532417498, now seen corresponding path program 1 times [2019-12-07 14:33:45,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:45,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373157174] [2019-12-07 14:33:45,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 14:33:45,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373157174] [2019-12-07 14:33:45,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:45,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:45,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970989885] [2019-12-07 14:33:45,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:45,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:45,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:45,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:45,849 INFO L87 Difference]: Start difference. First operand 593 states and 911 transitions. Second operand 3 states. [2019-12-07 14:33:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:45,941 INFO L93 Difference]: Finished difference Result 1239 states and 1906 transitions. [2019-12-07 14:33:45,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:45,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-12-07 14:33:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:45,944 INFO L225 Difference]: With dead ends: 1239 [2019-12-07 14:33:45,944 INFO L226 Difference]: Without dead ends: 653 [2019-12-07 14:33:45,945 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-12-07 14:33:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-07 14:33:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-12-07 14:33:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-12-07 14:33:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 958 transitions. [2019-12-07 14:33:45,962 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 958 transitions. Word has length 110 [2019-12-07 14:33:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:45,963 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 958 transitions. [2019-12-07 14:33:45,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 958 transitions. [2019-12-07 14:33:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 14:33:45,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:45,964 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:45,964 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1562226642, now seen corresponding path program 1 times [2019-12-07 14:33:45,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:45,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086702432] [2019-12-07 14:33:45,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 14:33:45,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086702432] [2019-12-07 14:33:45,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:45,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:45,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313282092] [2019-12-07 14:33:45,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:45,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:45,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:45,986 INFO L87 Difference]: Start difference. First operand 627 states and 958 transitions. Second operand 3 states. [2019-12-07 14:33:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:46,081 INFO L93 Difference]: Finished difference Result 1273 states and 1947 transitions. [2019-12-07 14:33:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:46,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-12-07 14:33:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:46,084 INFO L225 Difference]: With dead ends: 1273 [2019-12-07 14:33:46,084 INFO L226 Difference]: Without dead ends: 653 [2019-12-07 14:33:46,085 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-12-07 14:33:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-07 14:33:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-12-07 14:33:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-12-07 14:33:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 952 transitions. [2019-12-07 14:33:46,100 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 952 transitions. Word has length 111 [2019-12-07 14:33:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:46,100 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 952 transitions. [2019-12-07 14:33:46,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 952 transitions. [2019-12-07 14:33:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 14:33:46,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:46,102 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:46,102 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:46,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:46,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2031768980, now seen corresponding path program 1 times [2019-12-07 14:33:46,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:46,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581777090] [2019-12-07 14:33:46,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 14:33:46,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581777090] [2019-12-07 14:33:46,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:46,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:46,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355426268] [2019-12-07 14:33:46,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:46,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:46,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:46,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:46,126 INFO L87 Difference]: Start difference. First operand 627 states and 952 transitions. Second operand 3 states. [2019-12-07 14:33:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:46,231 INFO L93 Difference]: Finished difference Result 1300 states and 1972 transitions. [2019-12-07 14:33:46,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:46,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-12-07 14:33:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:46,235 INFO L225 Difference]: With dead ends: 1300 [2019-12-07 14:33:46,235 INFO L226 Difference]: Without dead ends: 680 [2019-12-07 14:33:46,236 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-12-07 14:33:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-12-07 14:33:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2019-12-07 14:33:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-12-07 14:33:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1020 transitions. [2019-12-07 14:33:46,270 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1020 transitions. Word has length 122 [2019-12-07 14:33:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:46,270 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 1020 transitions. [2019-12-07 14:33:46,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1020 transitions. [2019-12-07 14:33:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 14:33:46,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:46,272 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:46,272 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:46,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:46,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1706022811, now seen corresponding path program 1 times [2019-12-07 14:33:46,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:46,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155576953] [2019-12-07 14:33:46,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:33:46,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155576953] [2019-12-07 14:33:46,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:46,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:33:46,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280717420] [2019-12-07 14:33:46,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:46,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:46,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:46,309 INFO L87 Difference]: Start difference. First operand 674 states and 1020 transitions. Second operand 3 states. [2019-12-07 14:33:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:46,341 INFO L93 Difference]: Finished difference Result 1343 states and 2030 transitions. [2019-12-07 14:33:46,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:46,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-12-07 14:33:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:46,347 INFO L225 Difference]: With dead ends: 1343 [2019-12-07 14:33:46,347 INFO L226 Difference]: Without dead ends: 1341 [2019-12-07 14:33:46,347 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-12-07 14:33:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-12-07 14:33:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2019-12-07 14:33:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-12-07 14:33:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2026 transitions. [2019-12-07 14:33:46,377 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2026 transitions. Word has length 123 [2019-12-07 14:33:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:46,377 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2026 transitions. [2019-12-07 14:33:46,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:46,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2026 transitions. [2019-12-07 14:33:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 14:33:46,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:46,379 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:46,379 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:46,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:46,379 INFO L82 PathProgramCache]: Analyzing trace with hash 601196500, now seen corresponding path program 1 times [2019-12-07 14:33:46,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:46,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933432468] [2019-12-07 14:33:46,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 14:33:46,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933432468] [2019-12-07 14:33:46,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:46,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:33:46,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077118072] [2019-12-07 14:33:46,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:46,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:46,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:46,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:46,402 INFO L87 Difference]: Start difference. First operand 1339 states and 2026 transitions. Second operand 3 states. [2019-12-07 14:33:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:46,445 INFO L93 Difference]: Finished difference Result 3328 states and 5034 transitions. [2019-12-07 14:33:46,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:46,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-12-07 14:33:46,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:46,453 INFO L225 Difference]: With dead ends: 3328 [2019-12-07 14:33:46,453 INFO L226 Difference]: Without dead ends: 1996 [2019-12-07 14:33:46,454 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-12-07 14:33:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-12-07 14:33:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2019-12-07 14:33:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-12-07 14:33:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 3012 transitions. [2019-12-07 14:33:46,498 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 3012 transitions. Word has length 124 [2019-12-07 14:33:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:46,498 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 3012 transitions. [2019-12-07 14:33:46,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 3012 transitions. [2019-12-07 14:33:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 14:33:46,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:46,500 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:46,501 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:46,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1540663978, now seen corresponding path program 1 times [2019-12-07 14:33:46,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:46,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996821302] [2019-12-07 14:33:46,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-07 14:33:46,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996821302] [2019-12-07 14:33:46,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:46,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:46,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106058884] [2019-12-07 14:33:46,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:46,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:46,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:46,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:46,524 INFO L87 Difference]: Start difference. First operand 1994 states and 3012 transitions. Second operand 3 states. [2019-12-07 14:33:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:46,590 INFO L93 Difference]: Finished difference Result 4616 states and 6971 transitions. [2019-12-07 14:33:46,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:46,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-12-07 14:33:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:46,600 INFO L225 Difference]: With dead ends: 4616 [2019-12-07 14:33:46,600 INFO L226 Difference]: Without dead ends: 2629 [2019-12-07 14:33:46,602 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-12-07 14:33:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-12-07 14:33:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2627. [2019-12-07 14:33:46,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2627 states. [2019-12-07 14:33:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3961 transitions. [2019-12-07 14:33:46,660 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3961 transitions. Word has length 124 [2019-12-07 14:33:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:46,660 INFO L462 AbstractCegarLoop]: Abstraction has 2627 states and 3961 transitions. [2019-12-07 14:33:46,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3961 transitions. [2019-12-07 14:33:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 14:33:46,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:46,662 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:46,663 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:46,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1091794830, now seen corresponding path program 1 times [2019-12-07 14:33:46,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:46,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485259494] [2019-12-07 14:33:46,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 14:33:46,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485259494] [2019-12-07 14:33:46,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:46,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:46,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130684354] [2019-12-07 14:33:46,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:46,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:46,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:46,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:46,686 INFO L87 Difference]: Start difference. First operand 2627 states and 3961 transitions. Second operand 3 states. [2019-12-07 14:33:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:46,843 INFO L93 Difference]: Finished difference Result 5375 states and 8098 transitions. [2019-12-07 14:33:46,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:46,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-12-07 14:33:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:46,857 INFO L225 Difference]: With dead ends: 5375 [2019-12-07 14:33:46,857 INFO L226 Difference]: Without dead ends: 2755 [2019-12-07 14:33:46,860 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-12-07 14:33:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-12-07 14:33:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-12-07 14:33:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-12-07 14:33:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4076 transitions. [2019-12-07 14:33:46,950 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4076 transitions. Word has length 132 [2019-12-07 14:33:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:46,950 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4076 transitions. [2019-12-07 14:33:46,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4076 transitions. [2019-12-07 14:33:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 14:33:46,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:46,955 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:46,955 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:46,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash -106917274, now seen corresponding path program 1 times [2019-12-07 14:33:46,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:46,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456103409] [2019-12-07 14:33:46,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 14:33:46,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456103409] [2019-12-07 14:33:46,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:46,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:33:46,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898569620] [2019-12-07 14:33:46,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:46,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:46,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:46,980 INFO L87 Difference]: Start difference. First operand 2723 states and 4076 transitions. Second operand 3 states. [2019-12-07 14:33:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:47,125 INFO L93 Difference]: Finished difference Result 5471 states and 8181 transitions. [2019-12-07 14:33:47,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:47,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-12-07 14:33:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:47,139 INFO L225 Difference]: With dead ends: 5471 [2019-12-07 14:33:47,140 INFO L226 Difference]: Without dead ends: 2755 [2019-12-07 14:33:47,143 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-12-07 14:33:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-12-07 14:33:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-12-07 14:33:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-12-07 14:33:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4044 transitions. [2019-12-07 14:33:47,206 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4044 transitions. Word has length 133 [2019-12-07 14:33:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:47,206 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4044 transitions. [2019-12-07 14:33:47,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4044 transitions. [2019-12-07 14:33:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 14:33:47,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:47,209 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:47,209 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:47,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:47,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2091342634, now seen corresponding path program 1 times [2019-12-07 14:33:47,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:47,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675020413] [2019-12-07 14:33:47,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-12-07 14:33:47,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675020413] [2019-12-07 14:33:47,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:47,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:33:47,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660022815] [2019-12-07 14:33:47,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:47,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:47,238 INFO L87 Difference]: Start difference. First operand 2723 states and 4044 transitions. Second operand 3 states. [2019-12-07 14:33:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:47,397 INFO L93 Difference]: Finished difference Result 5521 states and 8174 transitions. [2019-12-07 14:33:47,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:47,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-12-07 14:33:47,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:47,406 INFO L225 Difference]: With dead ends: 5521 [2019-12-07 14:33:47,406 INFO L226 Difference]: Without dead ends: 2805 [2019-12-07 14:33:47,409 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-12-07 14:33:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2019-12-07 14:33:47,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2723. [2019-12-07 14:33:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-12-07 14:33:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3956 transitions. [2019-12-07 14:33:47,463 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3956 transitions. Word has length 163 [2019-12-07 14:33:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:47,463 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 3956 transitions. [2019-12-07 14:33:47,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3956 transitions. [2019-12-07 14:33:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 14:33:47,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:47,466 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:47,466 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:47,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:47,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1144304748, now seen corresponding path program 1 times [2019-12-07 14:33:47,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:47,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107880219] [2019-12-07 14:33:47,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-12-07 14:33:47,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107880219] [2019-12-07 14:33:47,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:47,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:33:47,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930879906] [2019-12-07 14:33:47,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:47,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:47,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:33:47,495 INFO L87 Difference]: Start difference. First operand 2723 states and 3956 transitions. Second operand 3 states. [2019-12-07 14:33:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:47,662 INFO L93 Difference]: Finished difference Result 5711 states and 8273 transitions. [2019-12-07 14:33:47,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:47,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-12-07 14:33:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:47,677 INFO L225 Difference]: With dead ends: 5711 [2019-12-07 14:33:47,677 INFO L226 Difference]: Without dead ends: 2995 [2019-12-07 14:33:47,679 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-12-07 14:33:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-12-07 14:33:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2839. [2019-12-07 14:33:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-12-07 14:33:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4044 transitions. [2019-12-07 14:33:47,734 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4044 transitions. Word has length 163 [2019-12-07 14:33:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:47,734 INFO L462 AbstractCegarLoop]: Abstraction has 2839 states and 4044 transitions. [2019-12-07 14:33:47,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4044 transitions. [2019-12-07 14:33:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 14:33:47,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:47,736 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:47,736 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:47,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:47,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1925800112, now seen corresponding path program 1 times [2019-12-07 14:33:47,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:47,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791769885] [2019-12-07 14:33:47,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:33:47,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791769885] [2019-12-07 14:33:47,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262955929] [2019-12-07 14:33:47,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:47,853 INFO L264 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:33:47,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-12-07 14:33:47,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:47,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 14:33:47,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039708541] [2019-12-07 14:33:47,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:47,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:47,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:47,916 INFO L87 Difference]: Start difference. First operand 2839 states and 4044 transitions. Second operand 3 states. [2019-12-07 14:33:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:48,043 INFO L93 Difference]: Finished difference Result 8484 states and 12071 transitions. [2019-12-07 14:33:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:48,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-12-07 14:33:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:48,052 INFO L225 Difference]: With dead ends: 8484 [2019-12-07 14:33:48,052 INFO L226 Difference]: Without dead ends: 5652 [2019-12-07 14:33:48,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2019-12-07 14:33:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5650. [2019-12-07 14:33:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-12-07 14:33:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 8033 transitions. [2019-12-07 14:33:48,183 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 8033 transitions. Word has length 171 [2019-12-07 14:33:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:48,184 INFO L462 AbstractCegarLoop]: Abstraction has 5650 states and 8033 transitions. [2019-12-07 14:33:48,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 8033 transitions. [2019-12-07 14:33:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 14:33:48,189 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:48,189 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:48,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:48,390 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:48,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1741886925, now seen corresponding path program 1 times [2019-12-07 14:33:48,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:48,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76886304] [2019-12-07 14:33:48,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:33:48,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76886304] [2019-12-07 14:33:48,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856028549] [2019-12-07 14:33:48,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:48,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:33:48,502 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-12-07 14:33:48,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:48,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 14:33:48,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430678724] [2019-12-07 14:33:48,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:48,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:48,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:48,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:48,549 INFO L87 Difference]: Start difference. First operand 5650 states and 8033 transitions. Second operand 3 states. [2019-12-07 14:33:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:48,869 INFO L93 Difference]: Finished difference Result 11836 states and 16798 transitions. [2019-12-07 14:33:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:48,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-12-07 14:33:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:48,881 INFO L225 Difference]: With dead ends: 11836 [2019-12-07 14:33:48,881 INFO L226 Difference]: Without dead ends: 5994 [2019-12-07 14:33:48,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2019-12-07 14:33:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 5834. [2019-12-07 14:33:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2019-12-07 14:33:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 8265 transitions. [2019-12-07 14:33:49,070 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 8265 transitions. Word has length 172 [2019-12-07 14:33:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:49,070 INFO L462 AbstractCegarLoop]: Abstraction has 5834 states and 8265 transitions. [2019-12-07 14:33:49,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 8265 transitions. [2019-12-07 14:33:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 14:33:49,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:49,075 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:49,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:49,275 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1648497422, now seen corresponding path program 1 times [2019-12-07 14:33:49,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:49,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879600305] [2019-12-07 14:33:49,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:33:49,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879600305] [2019-12-07 14:33:49,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142797474] [2019-12-07 14:33:49,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:49,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:33:49,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-12-07 14:33:49,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:49,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 14:33:49,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249627019] [2019-12-07 14:33:49,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:49,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:49,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:49,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:49,414 INFO L87 Difference]: Start difference. First operand 5834 states and 8265 transitions. Second operand 3 states. [2019-12-07 14:33:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:49,613 INFO L93 Difference]: Finished difference Result 10593 states and 14957 transitions. [2019-12-07 14:33:49,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:49,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-12-07 14:33:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:49,620 INFO L225 Difference]: With dead ends: 10593 [2019-12-07 14:33:49,621 INFO L226 Difference]: Without dead ends: 4615 [2019-12-07 14:33:49,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2019-12-07 14:33:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4471. [2019-12-07 14:33:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-12-07 14:33:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6324 transitions. [2019-12-07 14:33:49,716 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6324 transitions. Word has length 173 [2019-12-07 14:33:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:49,717 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6324 transitions. [2019-12-07 14:33:49,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6324 transitions. [2019-12-07 14:33:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-07 14:33:49,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:49,720 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:49,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:49,921 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:49,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:49,922 INFO L82 PathProgramCache]: Analyzing trace with hash 492657149, now seen corresponding path program 1 times [2019-12-07 14:33:49,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:49,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379174122] [2019-12-07 14:33:49,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-12-07 14:33:50,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379174122] [2019-12-07 14:33:50,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984300825] [2019-12-07 14:33:50,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:50,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:33:50,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-12-07 14:33:50,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:50,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-12-07 14:33:50,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859041034] [2019-12-07 14:33:50,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:50,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:33:50,196 INFO L87 Difference]: Start difference. First operand 4471 states and 6324 transitions. Second operand 3 states. [2019-12-07 14:33:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:50,278 INFO L93 Difference]: Finished difference Result 8870 states and 12551 transitions. [2019-12-07 14:33:50,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:50,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-12-07 14:33:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:50,282 INFO L225 Difference]: With dead ends: 8870 [2019-12-07 14:33:50,282 INFO L226 Difference]: Without dead ends: 4473 [2019-12-07 14:33:50,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:33:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2019-12-07 14:33:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4471. [2019-12-07 14:33:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-12-07 14:33:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6308 transitions. [2019-12-07 14:33:50,366 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6308 transitions. Word has length 176 [2019-12-07 14:33:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:50,366 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6308 transitions. [2019-12-07 14:33:50,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6308 transitions. [2019-12-07 14:33:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-07 14:33:50,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:50,369 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:50,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:50,570 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:50,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:50,570 INFO L82 PathProgramCache]: Analyzing trace with hash 750822587, now seen corresponding path program 1 times [2019-12-07 14:33:50,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:50,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131065067] [2019-12-07 14:33:50,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-12-07 14:33:50,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131065067] [2019-12-07 14:33:50,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801780984] [2019-12-07 14:33:50,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:50,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:33:50,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-12-07 14:33:50,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:50,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-12-07 14:33:50,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436346565] [2019-12-07 14:33:50,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:50,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:50,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:50,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:33:50,701 INFO L87 Difference]: Start difference. First operand 4471 states and 6308 transitions. Second operand 3 states. [2019-12-07 14:33:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:50,844 INFO L93 Difference]: Finished difference Result 7803 states and 10977 transitions. [2019-12-07 14:33:50,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:50,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-12-07 14:33:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:50,848 INFO L225 Difference]: With dead ends: 7803 [2019-12-07 14:33:50,848 INFO L226 Difference]: Without dead ends: 3298 [2019-12-07 14:33:50,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:33:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-12-07 14:33:50,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3178. [2019-12-07 14:33:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-12-07 14:33:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4467 transitions. [2019-12-07 14:33:50,911 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4467 transitions. Word has length 176 [2019-12-07 14:33:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:50,911 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4467 transitions. [2019-12-07 14:33:50,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4467 transitions. [2019-12-07 14:33:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-12-07 14:33:50,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:50,914 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:51,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:51,116 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:51,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash 290208357, now seen corresponding path program 2 times [2019-12-07 14:33:51,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:51,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814736330] [2019-12-07 14:33:51,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 191 proven. 19 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:33:51,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814736330] [2019-12-07 14:33:51,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459838903] [2019-12-07 14:33:51,177 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:51,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 14:33:51,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:33:51,222 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:33:51,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-12-07 14:33:51,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:51,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 14:33:51,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651437629] [2019-12-07 14:33:51,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:51,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:51,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:51,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:51,281 INFO L87 Difference]: Start difference. First operand 3178 states and 4467 transitions. Second operand 3 states. [2019-12-07 14:33:51,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:51,453 INFO L93 Difference]: Finished difference Result 6414 states and 9030 transitions. [2019-12-07 14:33:51,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:51,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-12-07 14:33:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:51,456 INFO L225 Difference]: With dead ends: 6414 [2019-12-07 14:33:51,456 INFO L226 Difference]: Without dead ends: 3362 [2019-12-07 14:33:51,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2019-12-07 14:33:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3178. [2019-12-07 14:33:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-12-07 14:33:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4451 transitions. [2019-12-07 14:33:51,521 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4451 transitions. Word has length 181 [2019-12-07 14:33:51,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:51,521 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4451 transitions. [2019-12-07 14:33:51,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4451 transitions. [2019-12-07 14:33:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-12-07 14:33:51,524 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:51,524 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:51,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:51,725 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:51,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:51,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1359170395, now seen corresponding path program 1 times [2019-12-07 14:33:51,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:51,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361835441] [2019-12-07 14:33:51,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:33:51,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361835441] [2019-12-07 14:33:51,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833059358] [2019-12-07 14:33:51,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:51,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:33:51,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:33:51,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:51,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 14:33:51,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058065928] [2019-12-07 14:33:51,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:51,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:51,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:51,869 INFO L87 Difference]: Start difference. First operand 3178 states and 4451 transitions. Second operand 3 states. [2019-12-07 14:33:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:51,973 INFO L93 Difference]: Finished difference Result 9098 states and 12761 transitions. [2019-12-07 14:33:51,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:51,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-12-07 14:33:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:51,977 INFO L225 Difference]: With dead ends: 9098 [2019-12-07 14:33:51,977 INFO L226 Difference]: Without dead ends: 6110 [2019-12-07 14:33:51,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2019-12-07 14:33:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6108. [2019-12-07 14:33:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-12-07 14:33:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 8553 transitions. [2019-12-07 14:33:52,095 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 8553 transitions. Word has length 183 [2019-12-07 14:33:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:52,095 INFO L462 AbstractCegarLoop]: Abstraction has 6108 states and 8553 transitions. [2019-12-07 14:33:52,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 8553 transitions. [2019-12-07 14:33:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 14:33:52,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:52,099 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:52,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:52,300 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash -580968611, now seen corresponding path program 1 times [2019-12-07 14:33:52,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:52,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363839977] [2019-12-07 14:33:52,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:33:52,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363839977] [2019-12-07 14:33:52,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527564324] [2019-12-07 14:33:52,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:52,406 INFO L264 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:33:52,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:33:52,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:52,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 14:33:52,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522585954] [2019-12-07 14:33:52,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:52,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:52,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:52,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:52,435 INFO L87 Difference]: Start difference. First operand 6108 states and 8553 transitions. Second operand 3 states. [2019-12-07 14:33:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:52,581 INFO L93 Difference]: Finished difference Result 12076 states and 16919 transitions. [2019-12-07 14:33:52,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:52,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-12-07 14:33:52,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:52,587 INFO L225 Difference]: With dead ends: 12076 [2019-12-07 14:33:52,588 INFO L226 Difference]: Without dead ends: 9088 [2019-12-07 14:33:52,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2019-12-07 14:33:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9086. [2019-12-07 14:33:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2019-12-07 14:33:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 12719 transitions. [2019-12-07 14:33:52,756 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 12719 transitions. Word has length 185 [2019-12-07 14:33:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:52,756 INFO L462 AbstractCegarLoop]: Abstraction has 9086 states and 12719 transitions. [2019-12-07 14:33:52,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 12719 transitions. [2019-12-07 14:33:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 14:33:52,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:52,761 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:52,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:52,962 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:52,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:52,963 INFO L82 PathProgramCache]: Analyzing trace with hash -607881575, now seen corresponding path program 1 times [2019-12-07 14:33:52,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:52,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772226534] [2019-12-07 14:33:52,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:33:53,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772226534] [2019-12-07 14:33:53,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807472702] [2019-12-07 14:33:53,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:53,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:33:53,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:33:53,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:53,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 14:33:53,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886120860] [2019-12-07 14:33:53,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:53,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:53,102 INFO L87 Difference]: Start difference. First operand 9086 states and 12719 transitions. Second operand 3 states. [2019-12-07 14:33:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:53,324 INFO L93 Difference]: Finished difference Result 20674 states and 28969 transitions. [2019-12-07 14:33:53,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:53,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-12-07 14:33:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:53,335 INFO L225 Difference]: With dead ends: 20674 [2019-12-07 14:33:53,335 INFO L226 Difference]: Without dead ends: 14708 [2019-12-07 14:33:53,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14708 states. [2019-12-07 14:33:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14708 to 14706. [2019-12-07 14:33:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-12-07 14:33:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20587 transitions. [2019-12-07 14:33:53,676 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20587 transitions. Word has length 186 [2019-12-07 14:33:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:53,676 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20587 transitions. [2019-12-07 14:33:53,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20587 transitions. [2019-12-07 14:33:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 14:33:53,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:53,681 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:53,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:53,882 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:53,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:53,883 INFO L82 PathProgramCache]: Analyzing trace with hash 9813042, now seen corresponding path program 3 times [2019-12-07 14:33:53,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:53,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45737280] [2019-12-07 14:33:53,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 198 proven. 21 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:33:53,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45737280] [2019-12-07 14:33:53,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388638336] [2019-12-07 14:33:53,932 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:53,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-12-07 14:33:53,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:33:53,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:33:53,971 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-12-07 14:33:53,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:53,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 14:33:53,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368018734] [2019-12-07 14:33:53,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:53,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:53,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:53,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:53,992 INFO L87 Difference]: Start difference. First operand 14706 states and 20587 transitions. Second operand 3 states. [2019-12-07 14:33:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:54,334 INFO L93 Difference]: Finished difference Result 30070 states and 42014 transitions. [2019-12-07 14:33:54,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:54,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-12-07 14:33:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:54,345 INFO L225 Difference]: With dead ends: 30070 [2019-12-07 14:33:54,345 INFO L226 Difference]: Without dead ends: 15314 [2019-12-07 14:33:54,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2019-12-07 14:33:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 14706. [2019-12-07 14:33:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-12-07 14:33:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20547 transitions. [2019-12-07 14:33:54,684 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20547 transitions. Word has length 186 [2019-12-07 14:33:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:54,684 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20547 transitions. [2019-12-07 14:33:54,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20547 transitions. [2019-12-07 14:33:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 14:33:54,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:54,689 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:54,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:54,891 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:54,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash 854141729, now seen corresponding path program 1 times [2019-12-07 14:33:54,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:54,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276952808] [2019-12-07 14:33:54,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 198 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:33:54,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276952808] [2019-12-07 14:33:54,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857344002] [2019-12-07 14:33:54,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:54,993 INFO L264 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:33:54,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-12-07 14:33:55,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:33:55,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 14:33:55,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142549840] [2019-12-07 14:33:55,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:33:55,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:33:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:55,015 INFO L87 Difference]: Start difference. First operand 14706 states and 20547 transitions. Second operand 3 states. [2019-12-07 14:33:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:55,350 INFO L93 Difference]: Finished difference Result 29822 states and 41582 transitions. [2019-12-07 14:33:55,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:33:55,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-12-07 14:33:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:55,362 INFO L225 Difference]: With dead ends: 29822 [2019-12-07 14:33:55,363 INFO L226 Difference]: Without dead ends: 15186 [2019-12-07 14:33:55,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:33:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2019-12-07 14:33:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 14706. [2019-12-07 14:33:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-12-07 14:33:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20523 transitions. [2019-12-07 14:33:55,694 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20523 transitions. Word has length 187 [2019-12-07 14:33:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:55,694 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20523 transitions. [2019-12-07 14:33:55,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:33:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20523 transitions. [2019-12-07 14:33:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 14:33:55,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:55,700 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:55,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:55,901 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1508265096, now seen corresponding path program 4 times [2019-12-07 14:33:55,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:55,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204279081] [2019-12-07 14:33:55,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 196 proven. 27 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:33:55,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204279081] [2019-12-07 14:33:55,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575178272] [2019-12-07 14:33:55,990 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:56,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:33:56,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:33:56,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:33:56,082 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 14:33:56,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:33:56,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-12-07 14:33:56,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398712029] [2019-12-07 14:33:56,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:33:56,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:33:56,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:33:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:33:56,114 INFO L87 Difference]: Start difference. First operand 14706 states and 20523 transitions. Second operand 7 states. [2019-12-07 14:33:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:57,316 INFO L93 Difference]: Finished difference Result 50232 states and 68987 transitions. [2019-12-07 14:33:57,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:33:57,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-12-07 14:33:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:57,343 INFO L225 Difference]: With dead ends: 50232 [2019-12-07 14:33:57,343 INFO L226 Difference]: Without dead ends: 34696 [2019-12-07 14:33:57,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:33:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34696 states. [2019-12-07 14:33:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34696 to 17906. [2019-12-07 14:33:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17906 states. [2019-12-07 14:33:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17906 states to 17906 states and 24463 transitions. [2019-12-07 14:33:57,874 INFO L78 Accepts]: Start accepts. Automaton has 17906 states and 24463 transitions. Word has length 188 [2019-12-07 14:33:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:57,875 INFO L462 AbstractCegarLoop]: Abstraction has 17906 states and 24463 transitions. [2019-12-07 14:33:57,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:33:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 17906 states and 24463 transitions. [2019-12-07 14:33:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 14:33:57,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:57,878 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:58,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:58,079 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:58,079 INFO L82 PathProgramCache]: Analyzing trace with hash 941780496, now seen corresponding path program 1 times [2019-12-07 14:33:58,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:33:58,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654273570] [2019-12-07 14:33:58,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:33:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:33:58,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:33:58,166 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:33:58,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:33:58 BoogieIcfgContainer [2019-12-07 14:33:58,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:33:58,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:33:58,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:33:58,225 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:33:58,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:33:42" (3/4) ... [2019-12-07 14:33:58,227 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:33:58,296 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_34729f73-c1f8-4cfd-8b75-7ab4adb1a3e7/bin/uautomizer/witness.graphml [2019-12-07 14:33:58,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:33:58,297 INFO L168 Benchmark]: Toolchain (without parser) took 16198.81 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 940.8 MB in the beginning and 1.6 GB in the end (delta: -631.7 MB). Peak memory consumption was 435.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,298 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:33:58,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:33:58,298 INFO L168 Benchmark]: Boogie Preprocessor took 24.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,299 INFO L168 Benchmark]: RCFGBuilder took 445.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,299 INFO L168 Benchmark]: TraceAbstraction took 15367.25 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 954.2 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -543.6 MB). Peak memory consumption was 410.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,299 INFO L168 Benchmark]: Witness Printer took 71.14 ms. Allocated memory is still 2.1 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,300 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 445.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15367.25 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 954.2 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -543.6 MB). Peak memory consumption was 410.6 MB. Max. memory is 11.5 GB. * Witness Printer took 71.14 ms. Allocated memory is still 2.1 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L635] int s ; [L636] int tmp ; [L640] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 = __VERIFIER_nondet_int() ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L296] COND FALSE !(\read(s__hit)) [L299] s__state = 8512 [L301] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND TRUE s__state == 8512 [L306] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L307] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L308] COND TRUE __cil_tmp56 + 256UL [L309] skip = 1 [L317] s__state = 8528 [L318] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND TRUE s__state == 8528 [L322] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L323] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L325] __cil_tmp57 = (unsigned long )s__options [L326] COND TRUE __cil_tmp57 + 2097152UL [L327] s__s3__tmp__use_rsa_tmp = 1 [L332] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L359] ret = __VERIFIER_nondet_int() [L360] COND FALSE !(ret <= 0) [L377] s__state = 8544 [L378] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND TRUE s__state == 8544 [L382] COND TRUE s__verify_mode + 1 [L383] COND FALSE !(s__session__peer != 0) [L394] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L395] __cil_tmp61 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L396] COND FALSE !(__cil_tmp61 + 256UL) [L406] s__s3__tmp__cert_request = 1 [L407] ret = __VERIFIER_nondet_int() [L408] COND FALSE !(ret <= 0) [L411] s__state = 8448 [L412] s__s3__tmp__next_state___0 = 8576 [L413] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND TRUE s__state == 8448 [L434] COND FALSE !(num1 > 0L) [L443] s__state = s__s3__tmp__next_state___0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND TRUE s__state == 8576 [L447] ret = __VERIFIER_nondet_int() [L448] COND FALSE !(ret <= 0) [L451] COND FALSE !(ret == 2) [L454] ret = __VERIFIER_nondet_int() [L455] COND FALSE !(ret <= 0) [L458] s__init_num = 0 [L459] s__state = 8592 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND TRUE state == 8576 [L603] COND TRUE s__state == 8592 [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE tmp___2 != -16384 [L606] COND TRUE __cil_tmp56 != 4294967040 [L607] COND TRUE __cil_tmp58 != 4294967294 [L608] COND TRUE tmp___7 != 1024 [L609] COND TRUE tmp___7 != 512 [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 15.2s, OverallIterations: 42, TraceHistogramMax: 7, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8062 SDtfs, 6835 SDslu, 4489 SDs, 0 SdLazy, 4523 SolverSat, 1377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2283 GetRequests, 2203 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17906occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 41 MinimizatonAttempts, 19003 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 6893 NumberOfCodeBlocks, 6601 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 6649 ConstructedInterpolants, 0 QuantifiedInterpolants, 1685570 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3883 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 53 InterpolantComputations, 40 PerfectInterpolantSequences, 9886/10231 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...