./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/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 d33dcc608b21d2bdbfa0a947775d4e23b857cf07 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:46:19,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:46:19,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:46:19,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:46:19,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:46:19,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:46:19,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:46:19,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:46:19,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:46:19,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:46:19,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:46:19,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:46:19,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:46:19,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:46:19,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:46:19,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:46:19,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:46:19,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:46:19,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:46:19,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:46:19,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:46:19,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:46:19,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:46:19,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:46:19,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:46:19,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:46:19,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:46:19,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:46:19,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:46:19,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:46:19,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:46:19,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:46:19,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:46:19,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:46:19,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:46:19,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:46:19,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:46:19,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:46:19,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:46:19,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:46:19,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:46:19,190 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:46:19,201 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:46:19,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:46:19,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:46:19,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:46:19,203 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:46:19,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:46:19,204 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:46:19,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:46:19,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:46:19,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:46:19,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:46:19,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:46:19,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:46:19,205 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:46:19,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:46:19,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:46:19,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:46:19,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:46:19,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:46:19,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:46:19,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:46:19,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:46:19,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:46:19,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:46:19,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:46:19,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:46:19,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:46:19,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:46:19,208 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_dd74eb70-9734-4826-996d-ab116f505da6/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 -> d33dcc608b21d2bdbfa0a947775d4e23b857cf07 [2019-11-20 05:46:19,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:46:19,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:46:19,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:46:19,347 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:46:19,347 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:46:19,348 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-20 05:46:19,396 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/data/4ac75c740/642e77bf87214a3bb6307230b70212e8/FLAG0c5368d36 [2019-11-20 05:46:19,842 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:46:19,843 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-20 05:46:19,859 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/data/4ac75c740/642e77bf87214a3bb6307230b70212e8/FLAG0c5368d36 [2019-11-20 05:46:20,368 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/data/4ac75c740/642e77bf87214a3bb6307230b70212e8 [2019-11-20 05:46:20,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:46:20,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:46:20,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:46:20,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:46:20,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:46:20,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d486204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20, skipping insertion in model container [2019-11-20 05:46:20,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,385 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:46:20,438 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:46:20,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:46:20,790 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:46:20,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:46:20,851 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:46:20,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20 WrapperNode [2019-11-20 05:46:20,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:46:20,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:46:20,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:46:20,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:46:20,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:46:20,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:46:20,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:46:20,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:46:20,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (1/1) ... [2019-11-20 05:46:20,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:46:20,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:46:20,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:46:20,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:46:20,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:46:20,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:46:20,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:46:21,137 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 05:46:21,617 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 05:46:21,617 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 05:46:21,618 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:46:21,619 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 05:46:21,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:46:21 BoogieIcfgContainer [2019-11-20 05:46:21,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:46:21,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:46:21,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:46:21,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:46:21,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:46:20" (1/3) ... [2019-11-20 05:46:21,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49774a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:46:21, skipping insertion in model container [2019-11-20 05:46:21,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:46:20" (2/3) ... [2019-11-20 05:46:21,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49774a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:46:21, skipping insertion in model container [2019-11-20 05:46:21,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:46:21" (3/3) ... [2019-11-20 05:46:21,627 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-11-20 05:46:21,635 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:46:21,641 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:46:21,650 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:46:21,671 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:46:21,672 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:46:21,672 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:46:21,672 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:46:21,672 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:46:21,672 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:46:21,673 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:46:21,673 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:46:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-20 05:46:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 05:46:21,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:21,699 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] [2019-11-20 05:46:21,700 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:21,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-20 05:46:21,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:21,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674663617] [2019-11-20 05:46:21,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:46:21,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674663617] [2019-11-20 05:46:21,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:21,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:46:21,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105226851] [2019-11-20 05:46:21,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:21,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:21,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:21,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:21,924 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-20 05:46:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:22,103 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-20 05:46:22,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:22,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 05:46:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:22,115 INFO L225 Difference]: With dead ends: 251 [2019-11-20 05:46:22,116 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 05:46:22,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:22,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 05:46:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-20 05:46:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 05:46:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-20 05:46:22,161 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-20 05:46:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:22,161 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-20 05:46:22,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-20 05:46:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 05:46:22,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:22,163 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:46:22,163 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-20 05:46:22,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:22,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211747243] [2019-11-20 05:46:22,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:46:22,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211747243] [2019-11-20 05:46:22,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:22,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:22,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127459471] [2019-11-20 05:46:22,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:22,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:22,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:22,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:22,253 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-20 05:46:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:22,405 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2019-11-20 05:46:22,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:22,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-20 05:46:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:22,407 INFO L225 Difference]: With dead ends: 238 [2019-11-20 05:46:22,407 INFO L226 Difference]: Without dead ends: 133 [2019-11-20 05:46:22,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-11-20 05:46:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-20 05:46:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-11-20 05:46:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-20 05:46:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-20 05:46:22,428 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-20 05:46:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:22,429 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-20 05:46:22,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-20 05:46:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 05:46:22,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:22,431 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:46:22,432 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash -134115002, now seen corresponding path program 1 times [2019-11-20 05:46:22,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:22,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806076972] [2019-11-20 05:46:22,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:46:22,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806076972] [2019-11-20 05:46:22,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:22,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:22,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424792841] [2019-11-20 05:46:22,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:22,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:22,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:22,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:22,550 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-20 05:46:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:22,698 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-11-20 05:46:22,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:22,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-20 05:46:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:22,702 INFO L225 Difference]: With dead ends: 270 [2019-11-20 05:46:22,702 INFO L226 Difference]: Without dead ends: 150 [2019-11-20 05:46:22,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-20 05:46:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-20 05:46:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 05:46:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-20 05:46:22,715 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-20 05:46:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:22,718 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-20 05:46:22,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-20 05:46:22,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 05:46:22,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:22,721 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-20 05:46:22,721 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:22,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:22,722 INFO L82 PathProgramCache]: Analyzing trace with hash -121422705, now seen corresponding path program 1 times [2019-11-20 05:46:22,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:22,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223745749] [2019-11-20 05:46:22,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 05:46:22,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223745749] [2019-11-20 05:46:22,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:22,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:22,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624508679] [2019-11-20 05:46:22,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:22,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:22,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:22,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:22,784 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-20 05:46:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:23,019 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-20 05:46:23,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:23,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-20 05:46:23,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:23,022 INFO L225 Difference]: With dead ends: 334 [2019-11-20 05:46:23,022 INFO L226 Difference]: Without dead ends: 196 [2019-11-20 05:46:23,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-20 05:46:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-20 05:46:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-20 05:46:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-20 05:46:23,038 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-20 05:46:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:23,039 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-20 05:46:23,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-20 05:46:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 05:46:23,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:23,041 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-20 05:46:23,042 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:23,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1926861039, now seen corresponding path program 1 times [2019-11-20 05:46:23,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:23,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934139362] [2019-11-20 05:46:23,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 05:46:23,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934139362] [2019-11-20 05:46:23,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:23,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:23,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904555334] [2019-11-20 05:46:23,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:23,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:23,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:23,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:23,101 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-20 05:46:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:23,245 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-20 05:46:23,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:23,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-20 05:46:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:23,247 INFO L225 Difference]: With dead ends: 389 [2019-11-20 05:46:23,247 INFO L226 Difference]: Without dead ends: 211 [2019-11-20 05:46:23,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-20 05:46:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-20 05:46:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-20 05:46:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-20 05:46:23,260 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-20 05:46:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:23,261 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-20 05:46:23,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-20 05:46:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:46:23,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:23,263 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-11-20 05:46:23,264 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:23,264 INFO L82 PathProgramCache]: Analyzing trace with hash 398996882, now seen corresponding path program 1 times [2019-11-20 05:46:23,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:23,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129087545] [2019-11-20 05:46:23,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 05:46:23,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129087545] [2019-11-20 05:46:23,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:23,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:23,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922748652] [2019-11-20 05:46:23,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:23,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:23,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:23,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:23,331 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-20 05:46:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:23,471 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-20 05:46:23,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:23,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 05:46:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:23,474 INFO L225 Difference]: With dead ends: 427 [2019-11-20 05:46:23,474 INFO L226 Difference]: Without dead ends: 230 [2019-11-20 05:46:23,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-20 05:46:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-20 05:46:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-20 05:46:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-20 05:46:23,490 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-20 05:46:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:23,490 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-20 05:46:23,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-20 05:46:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 05:46:23,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:23,493 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:23,493 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash 90409290, now seen corresponding path program 1 times [2019-11-20 05:46:23,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:23,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301358128] [2019-11-20 05:46:23,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 05:46:23,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301358128] [2019-11-20 05:46:23,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:23,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:23,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621202369] [2019-11-20 05:46:23,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:23,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:23,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:23,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:23,560 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-20 05:46:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:23,597 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-20 05:46:23,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:23,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 05:46:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:23,601 INFO L225 Difference]: With dead ends: 661 [2019-11-20 05:46:23,601 INFO L226 Difference]: Without dead ends: 443 [2019-11-20 05:46:23,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-20 05:46:23,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-20 05:46:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-20 05:46:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-20 05:46:23,616 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-20 05:46:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:23,617 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-20 05:46:23,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-20 05:46:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 05:46:23,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:23,620 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:23,620 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 935055156, now seen corresponding path program 1 times [2019-11-20 05:46:23,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:23,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683609610] [2019-11-20 05:46:23,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-20 05:46:23,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683609610] [2019-11-20 05:46:23,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:23,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:23,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315331842] [2019-11-20 05:46:23,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:23,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:23,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:23,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:23,681 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-20 05:46:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:23,741 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-20 05:46:23,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:23,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-20 05:46:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:23,745 INFO L225 Difference]: With dead ends: 661 [2019-11-20 05:46:23,745 INFO L226 Difference]: Without dead ends: 659 [2019-11-20 05:46:23,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-20 05:46:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-20 05:46:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-20 05:46:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-20 05:46:23,765 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-20 05:46:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:23,765 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-20 05:46:23,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-20 05:46:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 05:46:23,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:23,769 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1] [2019-11-20 05:46:23,769 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -365763014, now seen corresponding path program 1 times [2019-11-20 05:46:23,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:23,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866602216] [2019-11-20 05:46:23,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-20 05:46:23,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866602216] [2019-11-20 05:46:23,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:23,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:23,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057899625] [2019-11-20 05:46:23,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:23,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:23,843 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-20 05:46:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:24,027 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-20 05:46:24,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:24,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-20 05:46:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:24,032 INFO L225 Difference]: With dead ends: 1462 [2019-11-20 05:46:24,032 INFO L226 Difference]: Without dead ends: 809 [2019-11-20 05:46:24,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-20 05:46:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-20 05:46:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-20 05:46:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-20 05:46:24,058 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 175 [2019-11-20 05:46:24,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:24,058 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-20 05:46:24,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-20 05:46:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 05:46:24,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:24,062 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:24,062 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:24,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1933345798, now seen corresponding path program 2 times [2019-11-20 05:46:24,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:24,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680598679] [2019-11-20 05:46:24,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-20 05:46:24,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680598679] [2019-11-20 05:46:24,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:24,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:24,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450894233] [2019-11-20 05:46:24,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:24,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:24,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:24,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:24,138 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-20 05:46:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:24,306 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-11-20 05:46:24,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:24,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-20 05:46:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:24,312 INFO L225 Difference]: With dead ends: 1824 [2019-11-20 05:46:24,313 INFO L226 Difference]: Without dead ends: 1006 [2019-11-20 05:46:24,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-20 05:46:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-11-20 05:46:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-20 05:46:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-11-20 05:46:24,342 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-11-20 05:46:24,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:24,343 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-11-20 05:46:24,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-11-20 05:46:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-20 05:46:24,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:24,347 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:24,347 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1781023665, now seen corresponding path program 1 times [2019-11-20 05:46:24,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:24,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487921975] [2019-11-20 05:46:24,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-20 05:46:24,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487921975] [2019-11-20 05:46:24,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:24,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:24,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55845336] [2019-11-20 05:46:24,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:24,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:24,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:24,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:24,418 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-11-20 05:46:24,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:24,582 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-11-20 05:46:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:24,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-20 05:46:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:24,589 INFO L225 Difference]: With dead ends: 2080 [2019-11-20 05:46:24,589 INFO L226 Difference]: Without dead ends: 1079 [2019-11-20 05:46:24,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-20 05:46:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-11-20 05:46:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-20 05:46:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-11-20 05:46:24,617 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-11-20 05:46:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:24,618 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-11-20 05:46:24,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-11-20 05:46:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-20 05:46:24,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:24,622 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1] [2019-11-20 05:46:24,622 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:24,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:24,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1647744508, now seen corresponding path program 1 times [2019-11-20 05:46:24,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:24,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555495522] [2019-11-20 05:46:24,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-20 05:46:24,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555495522] [2019-11-20 05:46:24,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:24,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:24,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750510626] [2019-11-20 05:46:24,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:24,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:24,714 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-11-20 05:46:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:24,893 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-11-20 05:46:24,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:24,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-20 05:46:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:24,900 INFO L225 Difference]: With dead ends: 2230 [2019-11-20 05:46:24,900 INFO L226 Difference]: Without dead ends: 1160 [2019-11-20 05:46:24,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-20 05:46:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-11-20 05:46:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-20 05:46:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-11-20 05:46:24,939 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-11-20 05:46:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:24,939 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-11-20 05:46:24,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-11-20 05:46:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-20 05:46:24,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:24,944 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1] [2019-11-20 05:46:24,945 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:24,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:24,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1766185982, now seen corresponding path program 1 times [2019-11-20 05:46:24,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:24,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753144872] [2019-11-20 05:46:24,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-20 05:46:25,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753144872] [2019-11-20 05:46:25,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:25,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:25,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970249855] [2019-11-20 05:46:25,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:25,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:25,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:25,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:25,061 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-11-20 05:46:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:25,237 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-11-20 05:46:25,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:25,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-20 05:46:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:25,245 INFO L225 Difference]: With dead ends: 2398 [2019-11-20 05:46:25,245 INFO L226 Difference]: Without dead ends: 1256 [2019-11-20 05:46:25,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-11-20 05:46:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-11-20 05:46:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-20 05:46:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-11-20 05:46:25,279 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-11-20 05:46:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:25,280 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-11-20 05:46:25,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-11-20 05:46:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-20 05:46:25,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:25,287 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:25,287 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:25,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1276246012, now seen corresponding path program 1 times [2019-11-20 05:46:25,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:25,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650542685] [2019-11-20 05:46:25,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-11-20 05:46:25,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650542685] [2019-11-20 05:46:25,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:25,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:25,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16258204] [2019-11-20 05:46:25,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:25,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:25,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:25,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:25,390 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-11-20 05:46:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:25,433 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-11-20 05:46:25,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:25,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-20 05:46:25,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:25,447 INFO L225 Difference]: With dead ends: 3630 [2019-11-20 05:46:25,448 INFO L226 Difference]: Without dead ends: 2422 [2019-11-20 05:46:25,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-11-20 05:46:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-11-20 05:46:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-20 05:46:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-11-20 05:46:25,520 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-11-20 05:46:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:25,520 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-11-20 05:46:25,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-11-20 05:46:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-20 05:46:25,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:25,527 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:25,528 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:25,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:25,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1394687486, now seen corresponding path program 1 times [2019-11-20 05:46:25,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:25,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133449073] [2019-11-20 05:46:25,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-20 05:46:25,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133449073] [2019-11-20 05:46:25,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:25,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:25,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084257283] [2019-11-20 05:46:25,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:25,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:25,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:25,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:25,628 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-11-20 05:46:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:25,836 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-11-20 05:46:25,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:25,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-20 05:46:25,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:25,851 INFO L225 Difference]: With dead ends: 5143 [2019-11-20 05:46:25,852 INFO L226 Difference]: Without dead ends: 2702 [2019-11-20 05:46:25,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-11-20 05:46:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-11-20 05:46:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-11-20 05:46:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-11-20 05:46:25,930 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-11-20 05:46:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:25,931 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-11-20 05:46:25,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-11-20 05:46:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-20 05:46:25,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:25,938 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:25,938 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:25,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:25,939 INFO L82 PathProgramCache]: Analyzing trace with hash -777084420, now seen corresponding path program 1 times [2019-11-20 05:46:25,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:25,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91491913] [2019-11-20 05:46:25,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-20 05:46:26,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91491913] [2019-11-20 05:46:26,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:26,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:26,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673145951] [2019-11-20 05:46:26,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:26,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:26,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:26,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:26,100 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-11-20 05:46:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:26,308 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-11-20 05:46:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:26,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-20 05:46:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:26,324 INFO L225 Difference]: With dead ends: 5335 [2019-11-20 05:46:26,324 INFO L226 Difference]: Without dead ends: 2696 [2019-11-20 05:46:26,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-20 05:46:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-11-20 05:46:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-20 05:46:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-11-20 05:46:26,404 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-11-20 05:46:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:26,405 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-11-20 05:46:26,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-11-20 05:46:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-20 05:46:26,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:26,413 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 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, 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] [2019-11-20 05:46:26,413 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:26,413 INFO L82 PathProgramCache]: Analyzing trace with hash -844895981, now seen corresponding path program 1 times [2019-11-20 05:46:26,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:26,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837944072] [2019-11-20 05:46:26,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-20 05:46:26,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837944072] [2019-11-20 05:46:26,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:26,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:26,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391805420] [2019-11-20 05:46:26,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:26,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:26,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:26,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:26,544 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-11-20 05:46:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:26,713 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-11-20 05:46:26,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:26,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-20 05:46:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:26,729 INFO L225 Difference]: With dead ends: 5299 [2019-11-20 05:46:26,729 INFO L226 Difference]: Without dead ends: 2684 [2019-11-20 05:46:26,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-20 05:46:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-11-20 05:46:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-20 05:46:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-11-20 05:46:26,806 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 321 [2019-11-20 05:46:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:26,807 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-11-20 05:46:26,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-11-20 05:46:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-20 05:46:26,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:26,815 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:26,815 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:26,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:26,815 INFO L82 PathProgramCache]: Analyzing trace with hash 798876465, now seen corresponding path program 1 times [2019-11-20 05:46:26,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:26,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515250165] [2019-11-20 05:46:26,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-20 05:46:26,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515250165] [2019-11-20 05:46:26,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:26,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:26,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449863800] [2019-11-20 05:46:26,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:26,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:26,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:26,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:26,947 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-11-20 05:46:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:27,162 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-11-20 05:46:27,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:27,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-20 05:46:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:27,182 INFO L225 Difference]: With dead ends: 5545 [2019-11-20 05:46:27,182 INFO L226 Difference]: Without dead ends: 2930 [2019-11-20 05:46:27,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-11-20 05:46:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-11-20 05:46:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-20 05:46:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-11-20 05:46:27,268 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-11-20 05:46:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:27,268 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-11-20 05:46:27,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-11-20 05:46:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-20 05:46:27,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:27,277 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:27,277 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:27,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:27,277 INFO L82 PathProgramCache]: Analyzing trace with hash 668596020, now seen corresponding path program 1 times [2019-11-20 05:46:27,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:27,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463404886] [2019-11-20 05:46:27,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-20 05:46:27,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463404886] [2019-11-20 05:46:27,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:27,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:27,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879138300] [2019-11-20 05:46:27,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:27,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:27,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:27,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:27,465 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-11-20 05:46:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:27,562 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-11-20 05:46:27,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:27,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-20 05:46:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:27,608 INFO L225 Difference]: With dead ends: 7734 [2019-11-20 05:46:27,609 INFO L226 Difference]: Without dead ends: 5029 [2019-11-20 05:46:27,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-11-20 05:46:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-11-20 05:46:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-20 05:46:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-11-20 05:46:27,746 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-11-20 05:46:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:27,747 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-11-20 05:46:27,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-11-20 05:46:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-11-20 05:46:27,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:27,757 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:27,757 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1546862455, now seen corresponding path program 1 times [2019-11-20 05:46:27,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:27,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627897834] [2019-11-20 05:46:27,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-20 05:46:27,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627897834] [2019-11-20 05:46:27,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037364389] [2019-11-20 05:46:27,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/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-11-20 05:46:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:28,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:46:28,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:46:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-20 05:46:28,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:46:28,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 05:46:28,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614206187] [2019-11-20 05:46:28,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:46:28,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:28,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:46:28,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:46:28,320 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-11-20 05:46:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:28,754 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-11-20 05:46:28,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:46:28,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2019-11-20 05:46:28,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:28,769 INFO L225 Difference]: With dead ends: 9987 [2019-11-20 05:46:28,770 INFO L226 Difference]: Without dead ends: 7540 [2019-11-20 05:46:28,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:46:28,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-11-20 05:46:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-11-20 05:46:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-20 05:46:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-11-20 05:46:28,941 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 360 [2019-11-20 05:46:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:28,942 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-11-20 05:46:28,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:46:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-11-20 05:46:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-20 05:46:28,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:28,955 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1] [2019-11-20 05:46:29,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:46:29,159 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:29,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:29,159 INFO L82 PathProgramCache]: Analyzing trace with hash 774755817, now seen corresponding path program 2 times [2019-11-20 05:46:29,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:29,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74456805] [2019-11-20 05:46:29,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-20 05:46:29,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74456805] [2019-11-20 05:46:29,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964558724] [2019-11-20 05:46:29,344 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/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-11-20 05:46:29,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:46:29,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:46:29,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:46:29,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:46:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-20 05:46:29,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:46:29,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 05:46:29,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171744513] [2019-11-20 05:46:29,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:46:29,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:29,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:46:29,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:46:29,601 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-11-20 05:46:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:30,054 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-11-20 05:46:30,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:46:30,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-20 05:46:30,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:30,070 INFO L225 Difference]: With dead ends: 12544 [2019-11-20 05:46:30,070 INFO L226 Difference]: Without dead ends: 6979 [2019-11-20 05:46:30,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:46:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-20 05:46:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-11-20 05:46:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-11-20 05:46:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-11-20 05:46:30,247 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-11-20 05:46:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:30,248 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-11-20 05:46:30,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:46:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-11-20 05:46:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-20 05:46:30,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:30,262 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:30,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:46:30,474 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash 256545513, now seen corresponding path program 1 times [2019-11-20 05:46:30,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:30,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583367455] [2019-11-20 05:46:30,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-20 05:46:30,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583367455] [2019-11-20 05:46:30,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:46:30,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:46:30,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871189817] [2019-11-20 05:46:30,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:30,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:30,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:30,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:30,657 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-11-20 05:46:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:30,866 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-11-20 05:46:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:30,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-20 05:46:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:30,873 INFO L225 Difference]: With dead ends: 11015 [2019-11-20 05:46:30,873 INFO L226 Difference]: Without dead ends: 3069 [2019-11-20 05:46:30,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:46:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-20 05:46:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-11-20 05:46:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-20 05:46:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-11-20 05:46:30,956 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-11-20 05:46:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:30,956 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-11-20 05:46:30,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-11-20 05:46:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-11-20 05:46:30,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:30,968 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 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, 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] [2019-11-20 05:46:30,968 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:30,969 INFO L82 PathProgramCache]: Analyzing trace with hash 930203824, now seen corresponding path program 1 times [2019-11-20 05:46:30,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:30,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340186626] [2019-11-20 05:46:30,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-11-20 05:46:31,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340186626] [2019-11-20 05:46:31,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865015533] [2019-11-20 05:46:31,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/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-11-20 05:46:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:31,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:46:31,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:46:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-11-20 05:46:31,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:46:31,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 05:46:31,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134248033] [2019-11-20 05:46:31,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:31,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:31,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:31,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:46:31,796 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-11-20 05:46:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:31,832 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-11-20 05:46:31,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:31,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2019-11-20 05:46:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:31,838 INFO L225 Difference]: With dead ends: 3028 [2019-11-20 05:46:31,838 INFO L226 Difference]: Without dead ends: 2531 [2019-11-20 05:46:31,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:46:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-11-20 05:46:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-11-20 05:46:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-20 05:46:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-11-20 05:46:31,894 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 510 [2019-11-20 05:46:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:31,895 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-11-20 05:46:31,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-11-20 05:46:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-11-20 05:46:31,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:31,907 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:32,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:46:32,112 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:32,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:32,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1673743471, now seen corresponding path program 1 times [2019-11-20 05:46:32,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:32,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690344907] [2019-11-20 05:46:32,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1623 proven. 14 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-11-20 05:46:32,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690344907] [2019-11-20 05:46:32,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121478095] [2019-11-20 05:46:32,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/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-11-20 05:46:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:32,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:46:32,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:46:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2019-11-20 05:46:32,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:46:32,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 05:46:32,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159677059] [2019-11-20 05:46:32,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:46:32,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:32,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:46:32,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:46:32,687 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-11-20 05:46:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:32,858 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-11-20 05:46:32,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:46:32,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2019-11-20 05:46:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:32,864 INFO L225 Difference]: With dead ends: 5060 [2019-11-20 05:46:32,864 INFO L226 Difference]: Without dead ends: 2589 [2019-11-20 05:46:32,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:46:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-11-20 05:46:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-11-20 05:46:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-11-20 05:46:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-11-20 05:46:32,925 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 511 [2019-11-20 05:46:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:32,926 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-11-20 05:46:32,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:46:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-11-20 05:46:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2019-11-20 05:46:32,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:46:32,942 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:46:33,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:46:33,146 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:46:33,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:46:33,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434925, now seen corresponding path program 2 times [2019-11-20 05:46:33,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:46:33,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773180679] [2019-11-20 05:46:33,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:46:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:46:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-20 05:46:33,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773180679] [2019-11-20 05:46:33,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001500217] [2019-11-20 05:46:33,512 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/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-11-20 05:46:33,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:46:33,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:46:33,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:46:33,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:46:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-20 05:46:34,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:46:34,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 05:46:34,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492217322] [2019-11-20 05:46:34,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:46:34,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:46:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:46:34,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:46:34,012 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-11-20 05:46:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:46:34,206 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-11-20 05:46:34,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:46:34,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 622 [2019-11-20 05:46:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:46:34,208 INFO L225 Difference]: With dead ends: 2848 [2019-11-20 05:46:34,208 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 05:46:34,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:46:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 05:46:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 05:46:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 05:46:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 05:46:34,212 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 622 [2019-11-20 05:46:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:46:34,212 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 05:46:34,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:46:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 05:46:34,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 05:46:34,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:46:34,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 05:46:34,948 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-11-20 05:46:35,744 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-20 05:46:36,228 WARN L191 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-20 05:46:36,350 INFO L440 ceAbstractionStarter]: At program point L168(lines 164 498) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 05:46:36,350 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 05:46:36,350 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-20 05:46:36,351 INFO L444 ceAbstractionStarter]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-20 05:46:36,351 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-11-20 05:46:36,351 INFO L444 ceAbstractionStarter]: For program point L434-2(lines 434 438) no Hoare annotation was computed. [2019-11-20 05:46:36,351 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-11-20 05:46:36,351 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 271) no Hoare annotation was computed. [2019-11-20 05:46:36,351 INFO L444 ceAbstractionStarter]: For program point L335-2(lines 335 339) no Hoare annotation was computed. [2019-11-20 05:46:36,351 INFO L444 ceAbstractionStarter]: For program point L269-2(lines 201 484) no Hoare annotation was computed. [2019-11-20 05:46:36,351 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 496) no Hoare annotation was computed. [2019-11-20 05:46:36,351 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 507) no Hoare annotation was computed. [2019-11-20 05:46:36,351 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 518) no Hoare annotation was computed. [2019-11-20 05:46:36,352 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 508) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-20 05:46:36,352 INFO L444 ceAbstractionStarter]: For program point L304(lines 304 306) no Hoare annotation was computed. [2019-11-20 05:46:36,352 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 241) no Hoare annotation was computed. [2019-11-20 05:46:36,352 INFO L444 ceAbstractionStarter]: For program point L304-2(lines 201 484) no Hoare annotation was computed. [2019-11-20 05:46:36,352 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-20 05:46:36,352 INFO L444 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-11-20 05:46:36,352 INFO L440 ceAbstractionStarter]: At program point L206(lines 104 518) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-20 05:46:36,352 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 495) no Hoare annotation was computed. [2019-11-20 05:46:36,352 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 506) no Hoare annotation was computed. [2019-11-20 05:46:36,352 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 517) no Hoare annotation was computed. [2019-11-20 05:46:36,353 INFO L440 ceAbstractionStarter]: At program point L174(lines 170 496) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 05:46:36,353 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-11-20 05:46:36,353 INFO L444 ceAbstractionStarter]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2019-11-20 05:46:36,353 INFO L447 ceAbstractionStarter]: At program point L539(lines 97 540) the Hoare annotation is: true [2019-11-20 05:46:36,353 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2019-11-20 05:46:36,353 INFO L444 ceAbstractionStarter]: For program point L275-2(lines 275 279) no Hoare annotation was computed. [2019-11-20 05:46:36,353 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 494) no Hoare annotation was computed. [2019-11-20 05:46:36,353 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 505) no Hoare annotation was computed. [2019-11-20 05:46:36,353 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 516) no Hoare annotation was computed. [2019-11-20 05:46:36,353 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 506) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 05:46:36,354 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 213) no Hoare annotation was computed. [2019-11-20 05:46:36,354 INFO L444 ceAbstractionStarter]: For program point L211-2(lines 211 213) no Hoare annotation was computed. [2019-11-20 05:46:36,354 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 493) no Hoare annotation was computed. [2019-11-20 05:46:36,354 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 504) no Hoare annotation was computed. [2019-11-20 05:46:36,354 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 515) no Hoare annotation was computed. [2019-11-20 05:46:36,354 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 479) no Hoare annotation was computed. [2019-11-20 05:46:36,354 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 455) no Hoare annotation was computed. [2019-11-20 05:46:36,354 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 425) no Hoare annotation was computed. [2019-11-20 05:46:36,354 INFO L444 ceAbstractionStarter]: For program point L411-1(lines 411 425) no Hoare annotation was computed. [2019-11-20 05:46:36,354 INFO L444 ceAbstractionStarter]: For program point L444-2(lines 444 455) no Hoare annotation was computed. [2019-11-20 05:46:36,355 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 315) no Hoare annotation was computed. [2019-11-20 05:46:36,355 INFO L440 ceAbstractionStarter]: At program point L180(lines 176 494) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))))) [2019-11-20 05:46:36,355 INFO L444 ceAbstractionStarter]: For program point L544(lines 544 546) no Hoare annotation was computed. [2019-11-20 05:46:36,355 INFO L444 ceAbstractionStarter]: For program point L544-2(lines 544 546) no Hoare annotation was computed. [2019-11-20 05:46:36,355 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-11-20 05:46:36,355 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 492) no Hoare annotation was computed. [2019-11-20 05:46:36,355 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 503) no Hoare annotation was computed. [2019-11-20 05:46:36,355 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 514) no Hoare annotation was computed. [2019-11-20 05:46:36,355 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 383) no Hoare annotation was computed. [2019-11-20 05:46:36,355 INFO L444 ceAbstractionStarter]: For program point L216(lines 216 219) no Hoare annotation was computed. [2019-11-20 05:46:36,356 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 504) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 05:46:36,356 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2019-11-20 05:46:36,356 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 421) no Hoare annotation was computed. [2019-11-20 05:46:36,356 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 256) no Hoare annotation was computed. [2019-11-20 05:46:36,356 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 452) no Hoare annotation was computed. [2019-11-20 05:46:36,356 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 05:46:36,356 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 491) no Hoare annotation was computed. [2019-11-20 05:46:36,356 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 502) no Hoare annotation was computed. [2019-11-20 05:46:36,356 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 513) no Hoare annotation was computed. [2019-11-20 05:46:36,356 INFO L447 ceAbstractionStarter]: At program point L549(lines 10 551) the Hoare annotation is: true [2019-11-20 05:46:36,357 INFO L440 ceAbstractionStarter]: At program point L186(lines 182 492) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) .cse0))) [2019-11-20 05:46:36,357 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 514) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 05:46:36,357 INFO L444 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-20 05:46:36,357 INFO L444 ceAbstractionStarter]: For program point L87-2(lines 84 90) no Hoare annotation was computed. [2019-11-20 05:46:36,357 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 296) no Hoare annotation was computed. [2019-11-20 05:46:36,357 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 255) no Hoare annotation was computed. [2019-11-20 05:46:36,357 INFO L444 ceAbstractionStarter]: For program point L286-2(lines 286 296) no Hoare annotation was computed. [2019-11-20 05:46:36,357 INFO L444 ceAbstractionStarter]: For program point L253-2(lines 201 484) no Hoare annotation was computed. [2019-11-20 05:46:36,358 INFO L440 ceAbstractionStarter]: At program point L485(lines 98 538) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (not .cse4)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse10 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse0 .cse7 .cse4) (and .cse8 .cse4 .cse5 .cse9) (and .cse6 .cse10 .cse11 .cse0) (and .cse12 .cse8 .cse4 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse12 .cse0) (and .cse10 .cse11 .cse3 .cse4 .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and .cse0 .cse4 .cse9) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse8 .cse4) (and .cse7 .cse5)))) [2019-11-20 05:46:36,361 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2019-11-20 05:46:36,361 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 490) no Hoare annotation was computed. [2019-11-20 05:46:36,361 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 501) no Hoare annotation was computed. [2019-11-20 05:46:36,361 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 512) no Hoare annotation was computed. [2019-11-20 05:46:36,361 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-11-20 05:46:36,361 INFO L440 ceAbstractionStarter]: At program point L321(lines 75 550) the Hoare annotation is: false [2019-11-20 05:46:36,362 INFO L444 ceAbstractionStarter]: For program point L387-2(lines 201 484) no Hoare annotation was computed. [2019-11-20 05:46:36,362 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 233) no Hoare annotation was computed. [2019-11-20 05:46:36,362 INFO L444 ceAbstractionStarter]: For program point L222-2(lines 201 484) no Hoare annotation was computed. [2019-11-20 05:46:36,362 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 536) no Hoare annotation was computed. [2019-11-20 05:46:36,362 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 05:46:36,363 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 535) no Hoare annotation was computed. [2019-11-20 05:46:36,363 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-20 05:46:36,363 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-20 05:46:36,363 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-20 05:46:36,364 INFO L444 ceAbstractionStarter]: For program point L224(lines 224 227) no Hoare annotation was computed. [2019-11-20 05:46:36,364 INFO L444 ceAbstractionStarter]: For program point L290-2(lines 288 296) no Hoare annotation was computed. [2019-11-20 05:46:36,364 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 489) no Hoare annotation was computed. [2019-11-20 05:46:36,365 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 500) no Hoare annotation was computed. [2019-11-20 05:46:36,365 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 511) no Hoare annotation was computed. [2019-11-20 05:46:36,365 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 96) no Hoare annotation was computed. [2019-11-20 05:46:36,365 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-11-20 05:46:36,365 INFO L444 ceAbstractionStarter]: For program point L522-2(lines 521 535) no Hoare annotation was computed. [2019-11-20 05:46:36,365 INFO L440 ceAbstractionStarter]: At program point L192(lines 188 490) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (not .cse2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-20 05:46:36,366 INFO L440 ceAbstractionStarter]: At program point L126(lines 122 512) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 05:46:36,366 INFO L444 ceAbstractionStarter]: For program point L93(lines 93 95) no Hoare annotation was computed. [2019-11-20 05:46:36,366 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 05:46:36,366 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 526) no Hoare annotation was computed. [2019-11-20 05:46:36,366 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 488) no Hoare annotation was computed. [2019-11-20 05:46:36,366 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 499) no Hoare annotation was computed. [2019-11-20 05:46:36,366 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 510) no Hoare annotation was computed. [2019-11-20 05:46:36,367 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 365) no Hoare annotation was computed. [2019-11-20 05:46:36,367 INFO L444 ceAbstractionStarter]: For program point L360-2(lines 360 365) no Hoare annotation was computed. [2019-11-20 05:46:36,367 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-11-20 05:46:36,367 INFO L440 ceAbstractionStarter]: At program point L195(lines 194 488) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (not .cse2) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1))) [2019-11-20 05:46:36,367 INFO L440 ceAbstractionStarter]: At program point L162(lines 152 502) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 05:46:36,367 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 460 462) no Hoare annotation was computed. [2019-11-20 05:46:36,368 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 264) no Hoare annotation was computed. [2019-11-20 05:46:36,368 INFO L447 ceAbstractionStarter]: At program point L560(lines 552 562) the Hoare annotation is: true [2019-11-20 05:46:36,368 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 487) no Hoare annotation was computed. [2019-11-20 05:46:36,368 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 498) no Hoare annotation was computed. [2019-11-20 05:46:36,368 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 509) no Hoare annotation was computed. [2019-11-20 05:46:36,368 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 75 550) no Hoare annotation was computed. [2019-11-20 05:46:36,369 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-11-20 05:46:36,369 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 399) no Hoare annotation was computed. [2019-11-20 05:46:36,369 INFO L447 ceAbstractionStarter]: At program point L198(lines 197 487) the Hoare annotation is: true [2019-11-20 05:46:36,369 INFO L440 ceAbstractionStarter]: At program point L132(lines 128 510) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-20 05:46:36,369 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 05:46:36,369 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-11-20 05:46:36,370 INFO L444 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-20 05:46:36,370 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 334) no Hoare annotation was computed. [2019-11-20 05:46:36,370 INFO L447 ceAbstractionStarter]: At program point L200(lines 199 487) the Hoare annotation is: true [2019-11-20 05:46:36,370 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 497) no Hoare annotation was computed. [2019-11-20 05:46:36,370 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 508) no Hoare annotation was computed. [2019-11-20 05:46:36,370 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 519) no Hoare annotation was computed. [2019-11-20 05:46:36,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:46:36 BoogieIcfgContainer [2019-11-20 05:46:36,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:46:36,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:46:36,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:46:36,403 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:46:36,404 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:46:21" (3/4) ... [2019-11-20 05:46:36,407 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 05:46:36,429 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 05:46:36,430 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 05:46:36,587 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dd74eb70-9734-4826-996d-ab116f505da6/bin/uautomizer/witness.graphml [2019-11-20 05:46:36,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:46:36,589 INFO L168 Benchmark]: Toolchain (without parser) took 16217.75 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 851.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -229.6 MB). Peak memory consumption was 621.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:46:36,589 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:46:36,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:46:36,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:46:36,591 INFO L168 Benchmark]: Boogie Preprocessor took 33.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:46:36,591 INFO L168 Benchmark]: RCFGBuilder took 681.98 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: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2019-11-20 05:46:36,592 INFO L168 Benchmark]: TraceAbstraction took 14781.91 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 730.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -137.3 MB). Peak memory consumption was 593.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:46:36,592 INFO L168 Benchmark]: Witness Printer took 184.74 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:46:36,595 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 480.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 681.98 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: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14781.91 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 730.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -137.3 MB). Peak memory consumption was 593.6 MB. Max. memory is 11.5 GB. * Witness Printer took 184.74 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && 4432 <= s__state) && s__state <= 4560) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || (4512 <= s__state && s__state <= 4528 && blastFlag <= 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (s__state == 4384 && blastFlag <= 2)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 14.7s, OverallIterations: 25, TraceHistogramMax: 22, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 4490 SDtfs, 2115 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2456 GetRequests, 2421 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 427 HoareAnnotationTreeSize, 22 FomulaSimplifications, 29279 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24849 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 8555 NumberOfCodeBlocks, 8555 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8525 ConstructedInterpolants, 0 QuantifiedInterpolants, 4552471 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3948 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 38935/39021 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...