./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.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_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/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 3120445556e880fbad518fab0e301c4c6b39e1cb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/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 3120445556e880fbad518fab0e301c4c6b39e1cb ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 11:35:32,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:35:32,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:35:32,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:35:32,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:35:32,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:35:32,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:35:32,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:35:32,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:35:32,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:35:32,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:35:32,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:35:32,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:35:32,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:35:32,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:35:32,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:35:32,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:35:32,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:35:32,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:35:32,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:35:32,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:35:32,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:35:32,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:35:32,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:35:32,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:35:32,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:35:32,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:35:32,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:35:32,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:35:32,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:35:32,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:35:32,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:35:32,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:35:32,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:35:32,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:35:32,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:35:32,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:35:32,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:35:32,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:35:32,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:35:33,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:35:33,000 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 11:35:33,018 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:35:33,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:35:33,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:35:33,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:35:33,020 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:35:33,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:35:33,020 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:35:33,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:35:33,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:35:33,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:35:33,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:35:33,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:35:33,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:35:33,023 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:35:33,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:35:33,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:35:33,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:35:33,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:35:33,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:35:33,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:35:33,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:35:33,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:35:33,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:35:33,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:35:33,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:35:33,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:35:33,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 11:35:33,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:35:33,026 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_dde2fd0e-9065-4651-8770-18d4b1ce276b/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 -> 3120445556e880fbad518fab0e301c4c6b39e1cb [2019-11-20 11:35:33,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:35:33,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:35:33,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:35:33,225 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:35:33,225 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:35:33,226 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c [2019-11-20 11:35:33,283 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/data/8db9ebe5f/d72d12d18ad8489f842961bb4931d6df/FLAGb437e4690 [2019-11-20 11:35:33,775 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:35:33,775 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c [2019-11-20 11:35:33,811 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/data/8db9ebe5f/d72d12d18ad8489f842961bb4931d6df/FLAGb437e4690 [2019-11-20 11:35:34,116 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/data/8db9ebe5f/d72d12d18ad8489f842961bb4931d6df [2019-11-20 11:35:34,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:35:34,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:35:34,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:35:34,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:35:34,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:35:34,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:34,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d3e6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34, skipping insertion in model container [2019-11-20 11:35:34,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:34,133 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:35:34,192 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:35:34,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:35:34,733 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:35:34,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:35:34,858 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:35:34,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34 WrapperNode [2019-11-20 11:35:34,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:35:34,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:35:34,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:35:34,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:35:34,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:34,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:34,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:35:34,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:35:34,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:35:34,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:35:34,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:34,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:34,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:34,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:35,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:35,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:35,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (1/1) ... [2019-11-20 11:35:35,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:35:35,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:35:35,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:35:35,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:35:35,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/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 11:35:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:35:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:35:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 11:35:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 11:35:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:35:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 11:35:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:35:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:35:35,392 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 11:35:36,531 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 11:35:36,531 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 11:35:36,532 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:35:36,532 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 11:35:36,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:35:36 BoogieIcfgContainer [2019-11-20 11:35:36,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:35:36,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:35:36,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:35:36,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:35:36,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:35:34" (1/3) ... [2019-11-20 11:35:36,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243f6564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:35:36, skipping insertion in model container [2019-11-20 11:35:36,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:35:34" (2/3) ... [2019-11-20 11:35:36,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243f6564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:35:36, skipping insertion in model container [2019-11-20 11:35:36,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:35:36" (3/3) ... [2019-11-20 11:35:36,541 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-2.c [2019-11-20 11:35:36,550 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:35:36,556 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 11:35:36,566 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 11:35:36,595 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:35:36,595 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:35:36,595 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:35:36,596 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:35:36,596 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:35:36,596 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:35:36,596 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:35:36,596 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:35:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-11-20 11:35:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 11:35:36,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:36,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:36,631 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:36,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:36,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1128889191, now seen corresponding path program 1 times [2019-11-20 11:35:36,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:36,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540394487] [2019-11-20 11:35:36,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:36,903 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 11:35:36,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540394487] [2019-11-20 11:35:36,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:36,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:36,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058440694] [2019-11-20 11:35:36,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:36,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:36,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:36,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:36,924 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-11-20 11:35:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:37,587 INFO L93 Difference]: Finished difference Result 341 states and 583 transitions. [2019-11-20 11:35:37,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:37,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-20 11:35:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:37,601 INFO L225 Difference]: With dead ends: 341 [2019-11-20 11:35:37,601 INFO L226 Difference]: Without dead ends: 172 [2019-11-20 11:35:37,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-20 11:35:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-11-20 11:35:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 11:35:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 244 transitions. [2019-11-20 11:35:37,654 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 244 transitions. Word has length 44 [2019-11-20 11:35:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:37,655 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 244 transitions. [2019-11-20 11:35:37,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2019-11-20 11:35:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 11:35:37,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:37,658 INFO L410 BasicCegarLoop]: trace histogram [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 11:35:37,658 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:37,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1071790339, now seen corresponding path program 1 times [2019-11-20 11:35:37,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:37,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149580909] [2019-11-20 11:35:37,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:37,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149580909] [2019-11-20 11:35:37,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:37,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:37,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407404538] [2019-11-20 11:35:37,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:37,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:37,809 INFO L87 Difference]: Start difference. First operand 155 states and 244 transitions. Second operand 4 states. [2019-11-20 11:35:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:38,229 INFO L93 Difference]: Finished difference Result 308 states and 479 transitions. [2019-11-20 11:35:38,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:38,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 11:35:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:38,231 INFO L225 Difference]: With dead ends: 308 [2019-11-20 11:35:38,232 INFO L226 Difference]: Without dead ends: 172 [2019-11-20 11:35:38,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-20 11:35:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-11-20 11:35:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 11:35:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 243 transitions. [2019-11-20 11:35:38,297 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 243 transitions. Word has length 57 [2019-11-20 11:35:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:38,297 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 243 transitions. [2019-11-20 11:35:38,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 243 transitions. [2019-11-20 11:35:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 11:35:38,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:38,300 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, 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 11:35:38,300 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:38,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:38,302 INFO L82 PathProgramCache]: Analyzing trace with hash -286614869, now seen corresponding path program 1 times [2019-11-20 11:35:38,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:38,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582017079] [2019-11-20 11:35:38,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:38,450 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 11:35:38,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582017079] [2019-11-20 11:35:38,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:38,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:38,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660834574] [2019-11-20 11:35:38,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:38,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:38,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:38,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:38,452 INFO L87 Difference]: Start difference. First operand 155 states and 243 transitions. Second operand 4 states. [2019-11-20 11:35:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:38,849 INFO L93 Difference]: Finished difference Result 307 states and 477 transitions. [2019-11-20 11:35:38,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:38,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 11:35:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:38,852 INFO L225 Difference]: With dead ends: 307 [2019-11-20 11:35:38,852 INFO L226 Difference]: Without dead ends: 171 [2019-11-20 11:35:38,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-20 11:35:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2019-11-20 11:35:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 11:35:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 242 transitions. [2019-11-20 11:35:38,870 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 242 transitions. Word has length 58 [2019-11-20 11:35:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:38,870 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 242 transitions. [2019-11-20 11:35:38,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:38,872 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 242 transitions. [2019-11-20 11:35:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 11:35:38,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:38,876 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:38,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash -243286048, now seen corresponding path program 1 times [2019-11-20 11:35:38,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:38,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471551750] [2019-11-20 11:35:38,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:38,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471551750] [2019-11-20 11:35:38,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:38,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:38,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139684900] [2019-11-20 11:35:38,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:38,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:38,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:38,964 INFO L87 Difference]: Start difference. First operand 155 states and 242 transitions. Second operand 4 states. [2019-11-20 11:35:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:39,313 INFO L93 Difference]: Finished difference Result 305 states and 474 transitions. [2019-11-20 11:35:39,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:39,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 11:35:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:39,316 INFO L225 Difference]: With dead ends: 305 [2019-11-20 11:35:39,316 INFO L226 Difference]: Without dead ends: 169 [2019-11-20 11:35:39,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-20 11:35:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2019-11-20 11:35:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 11:35:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 241 transitions. [2019-11-20 11:35:39,331 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 241 transitions. Word has length 58 [2019-11-20 11:35:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:39,331 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 241 transitions. [2019-11-20 11:35:39,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2019-11-20 11:35:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 11:35:39,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:39,333 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:39,333 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:39,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:39,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1727000736, now seen corresponding path program 1 times [2019-11-20 11:35:39,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:39,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531647101] [2019-11-20 11:35:39,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:39,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531647101] [2019-11-20 11:35:39,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:39,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:39,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367971928] [2019-11-20 11:35:39,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:39,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:39,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:39,452 INFO L87 Difference]: Start difference. First operand 155 states and 241 transitions. Second operand 4 states. [2019-11-20 11:35:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:39,793 INFO L93 Difference]: Finished difference Result 304 states and 472 transitions. [2019-11-20 11:35:39,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:39,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 11:35:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:39,795 INFO L225 Difference]: With dead ends: 304 [2019-11-20 11:35:39,795 INFO L226 Difference]: Without dead ends: 168 [2019-11-20 11:35:39,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-20 11:35:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2019-11-20 11:35:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 11:35:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 240 transitions. [2019-11-20 11:35:39,803 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 240 transitions. Word has length 58 [2019-11-20 11:35:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:39,804 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 240 transitions. [2019-11-20 11:35:39,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 240 transitions. [2019-11-20 11:35:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 11:35:39,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:39,805 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:39,806 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1922150249, now seen corresponding path program 1 times [2019-11-20 11:35:39,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:39,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834942685] [2019-11-20 11:35:39,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:39,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834942685] [2019-11-20 11:35:39,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:39,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:39,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446965743] [2019-11-20 11:35:39,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:39,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:39,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:39,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:39,878 INFO L87 Difference]: Start difference. First operand 155 states and 240 transitions. Second operand 4 states. [2019-11-20 11:35:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:40,183 INFO L93 Difference]: Finished difference Result 304 states and 471 transitions. [2019-11-20 11:35:40,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:40,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 11:35:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:40,185 INFO L225 Difference]: With dead ends: 304 [2019-11-20 11:35:40,185 INFO L226 Difference]: Without dead ends: 168 [2019-11-20 11:35:40,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-20 11:35:40,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2019-11-20 11:35:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 11:35:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2019-11-20 11:35:40,192 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 58 [2019-11-20 11:35:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:40,193 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2019-11-20 11:35:40,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2019-11-20 11:35:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 11:35:40,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:40,194 INFO L410 BasicCegarLoop]: trace histogram [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 11:35:40,194 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:40,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:40,194 INFO L82 PathProgramCache]: Analyzing trace with hash -909044396, now seen corresponding path program 1 times [2019-11-20 11:35:40,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:40,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259171344] [2019-11-20 11:35:40,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:40,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259171344] [2019-11-20 11:35:40,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:40,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:40,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973972704] [2019-11-20 11:35:40,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:40,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:40,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:40,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:40,254 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand 4 states. [2019-11-20 11:35:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:40,567 INFO L93 Difference]: Finished difference Result 304 states and 470 transitions. [2019-11-20 11:35:40,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:40,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 11:35:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:40,569 INFO L225 Difference]: With dead ends: 304 [2019-11-20 11:35:40,569 INFO L226 Difference]: Without dead ends: 168 [2019-11-20 11:35:40,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-20 11:35:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2019-11-20 11:35:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 11:35:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2019-11-20 11:35:40,576 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 59 [2019-11-20 11:35:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:40,576 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2019-11-20 11:35:40,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2019-11-20 11:35:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 11:35:40,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:40,578 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 11:35:40,578 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:40,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash 985403794, now seen corresponding path program 1 times [2019-11-20 11:35:40,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:40,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056604494] [2019-11-20 11:35:40,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:40,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056604494] [2019-11-20 11:35:40,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:40,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:40,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309221371] [2019-11-20 11:35:40,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:40,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:40,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:40,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:40,633 INFO L87 Difference]: Start difference. First operand 155 states and 238 transitions. Second operand 4 states. [2019-11-20 11:35:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:40,946 INFO L93 Difference]: Finished difference Result 304 states and 469 transitions. [2019-11-20 11:35:40,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:40,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 11:35:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:40,948 INFO L225 Difference]: With dead ends: 304 [2019-11-20 11:35:40,948 INFO L226 Difference]: Without dead ends: 168 [2019-11-20 11:35:40,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-20 11:35:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2019-11-20 11:35:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 11:35:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 237 transitions. [2019-11-20 11:35:40,954 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 237 transitions. Word has length 60 [2019-11-20 11:35:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:40,954 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 237 transitions. [2019-11-20 11:35:40,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 237 transitions. [2019-11-20 11:35:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 11:35:40,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:40,955 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 11:35:40,955 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash 136693359, now seen corresponding path program 1 times [2019-11-20 11:35:40,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:40,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564115022] [2019-11-20 11:35:40,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:41,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564115022] [2019-11-20 11:35:41,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:41,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:41,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738341306] [2019-11-20 11:35:41,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:41,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:41,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:41,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:41,015 INFO L87 Difference]: Start difference. First operand 155 states and 237 transitions. Second operand 4 states. [2019-11-20 11:35:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:41,289 INFO L93 Difference]: Finished difference Result 294 states and 455 transitions. [2019-11-20 11:35:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:41,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-20 11:35:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:41,299 INFO L225 Difference]: With dead ends: 294 [2019-11-20 11:35:41,299 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 11:35:41,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 11:35:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2019-11-20 11:35:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 11:35:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 236 transitions. [2019-11-20 11:35:41,305 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 236 transitions. Word has length 61 [2019-11-20 11:35:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:41,305 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 236 transitions. [2019-11-20 11:35:41,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2019-11-20 11:35:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 11:35:41,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:41,307 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 11:35:41,307 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:41,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1651513849, now seen corresponding path program 1 times [2019-11-20 11:35:41,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:41,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975205936] [2019-11-20 11:35:41,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:41,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975205936] [2019-11-20 11:35:41,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:41,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:41,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317759917] [2019-11-20 11:35:41,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:41,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:41,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:41,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:41,365 INFO L87 Difference]: Start difference. First operand 155 states and 236 transitions. Second operand 4 states. [2019-11-20 11:35:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:41,736 INFO L93 Difference]: Finished difference Result 334 states and 516 transitions. [2019-11-20 11:35:41,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:41,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-20 11:35:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:41,738 INFO L225 Difference]: With dead ends: 334 [2019-11-20 11:35:41,738 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 11:35:41,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 11:35:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2019-11-20 11:35:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-20 11:35:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 274 transitions. [2019-11-20 11:35:41,745 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 274 transitions. Word has length 61 [2019-11-20 11:35:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:41,745 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 274 transitions. [2019-11-20 11:35:41,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 274 transitions. [2019-11-20 11:35:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 11:35:41,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:41,754 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:41,755 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:41,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:41,755 INFO L82 PathProgramCache]: Analyzing trace with hash -560551857, now seen corresponding path program 1 times [2019-11-20 11:35:41,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:41,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894068625] [2019-11-20 11:35:41,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:41,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894068625] [2019-11-20 11:35:41,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:41,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:41,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802547695] [2019-11-20 11:35:41,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:41,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:41,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:41,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:41,838 INFO L87 Difference]: Start difference. First operand 177 states and 274 transitions. Second operand 4 states. [2019-11-20 11:35:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:42,204 INFO L93 Difference]: Finished difference Result 356 states and 553 transitions. [2019-11-20 11:35:42,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:42,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 11:35:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:42,206 INFO L225 Difference]: With dead ends: 356 [2019-11-20 11:35:42,206 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 11:35:42,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 11:35:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2019-11-20 11:35:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-20 11:35:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 273 transitions. [2019-11-20 11:35:42,212 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 273 transitions. Word has length 74 [2019-11-20 11:35:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:42,212 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 273 transitions. [2019-11-20 11:35:42,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 273 transitions. [2019-11-20 11:35:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 11:35:42,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:42,214 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-20 11:35:42,214 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1618091111, now seen corresponding path program 1 times [2019-11-20 11:35:42,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:42,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048133488] [2019-11-20 11:35:42,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:42,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048133488] [2019-11-20 11:35:42,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:42,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:42,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475677368] [2019-11-20 11:35:42,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:42,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:42,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:42,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:42,292 INFO L87 Difference]: Start difference. First operand 177 states and 273 transitions. Second operand 4 states. [2019-11-20 11:35:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:42,677 INFO L93 Difference]: Finished difference Result 355 states and 550 transitions. [2019-11-20 11:35:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:42,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 11:35:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:42,679 INFO L225 Difference]: With dead ends: 355 [2019-11-20 11:35:42,679 INFO L226 Difference]: Without dead ends: 197 [2019-11-20 11:35:42,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-20 11:35:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 177. [2019-11-20 11:35:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-20 11:35:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 272 transitions. [2019-11-20 11:35:42,685 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 272 transitions. Word has length 75 [2019-11-20 11:35:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:42,685 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 272 transitions. [2019-11-20 11:35:42,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 272 transitions. [2019-11-20 11:35:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 11:35:42,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:42,687 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:42,687 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:42,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:42,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1574762290, now seen corresponding path program 1 times [2019-11-20 11:35:42,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:42,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687203229] [2019-11-20 11:35:42,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:42,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687203229] [2019-11-20 11:35:42,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:42,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:42,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738822615] [2019-11-20 11:35:42,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:42,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:42,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:42,738 INFO L87 Difference]: Start difference. First operand 177 states and 272 transitions. Second operand 4 states. [2019-11-20 11:35:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:43,088 INFO L93 Difference]: Finished difference Result 353 states and 546 transitions. [2019-11-20 11:35:43,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:43,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 11:35:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:43,090 INFO L225 Difference]: With dead ends: 353 [2019-11-20 11:35:43,090 INFO L226 Difference]: Without dead ends: 195 [2019-11-20 11:35:43,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-20 11:35:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2019-11-20 11:35:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-20 11:35:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 271 transitions. [2019-11-20 11:35:43,098 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 271 transitions. Word has length 75 [2019-11-20 11:35:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:43,098 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 271 transitions. [2019-11-20 11:35:43,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 271 transitions. [2019-11-20 11:35:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 11:35:43,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:43,100 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:43,100 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:43,100 INFO L82 PathProgramCache]: Analyzing trace with hash 395524494, now seen corresponding path program 1 times [2019-11-20 11:35:43,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:43,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261744903] [2019-11-20 11:35:43,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:43,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261744903] [2019-11-20 11:35:43,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:43,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:43,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585266203] [2019-11-20 11:35:43,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:43,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:43,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:43,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:43,156 INFO L87 Difference]: Start difference. First operand 177 states and 271 transitions. Second operand 4 states. [2019-11-20 11:35:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:43,541 INFO L93 Difference]: Finished difference Result 352 states and 543 transitions. [2019-11-20 11:35:43,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:43,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 11:35:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:43,543 INFO L225 Difference]: With dead ends: 352 [2019-11-20 11:35:43,543 INFO L226 Difference]: Without dead ends: 194 [2019-11-20 11:35:43,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-20 11:35:43,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2019-11-20 11:35:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-20 11:35:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 270 transitions. [2019-11-20 11:35:43,549 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 270 transitions. Word has length 75 [2019-11-20 11:35:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:43,549 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 270 transitions. [2019-11-20 11:35:43,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 270 transitions. [2019-11-20 11:35:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 11:35:43,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:43,551 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:43,551 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:43,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1041340805, now seen corresponding path program 1 times [2019-11-20 11:35:43,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:43,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493135195] [2019-11-20 11:35:43,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:43,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493135195] [2019-11-20 11:35:43,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:43,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:43,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356030240] [2019-11-20 11:35:43,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:43,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:43,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:43,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:43,597 INFO L87 Difference]: Start difference. First operand 177 states and 270 transitions. Second operand 4 states. [2019-11-20 11:35:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:43,978 INFO L93 Difference]: Finished difference Result 352 states and 541 transitions. [2019-11-20 11:35:43,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:43,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 11:35:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:43,979 INFO L225 Difference]: With dead ends: 352 [2019-11-20 11:35:43,980 INFO L226 Difference]: Without dead ends: 194 [2019-11-20 11:35:43,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-20 11:35:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2019-11-20 11:35:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-20 11:35:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 269 transitions. [2019-11-20 11:35:43,985 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 269 transitions. Word has length 75 [2019-11-20 11:35:43,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:43,986 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 269 transitions. [2019-11-20 11:35:43,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2019-11-20 11:35:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 11:35:43,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:43,987 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:43,987 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash 764865062, now seen corresponding path program 1 times [2019-11-20 11:35:43,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:43,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880464909] [2019-11-20 11:35:43,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:44,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880464909] [2019-11-20 11:35:44,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:44,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:44,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950465750] [2019-11-20 11:35:44,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:44,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:44,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:44,031 INFO L87 Difference]: Start difference. First operand 177 states and 269 transitions. Second operand 4 states. [2019-11-20 11:35:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:44,376 INFO L93 Difference]: Finished difference Result 352 states and 539 transitions. [2019-11-20 11:35:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:44,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 11:35:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:44,378 INFO L225 Difference]: With dead ends: 352 [2019-11-20 11:35:44,378 INFO L226 Difference]: Without dead ends: 194 [2019-11-20 11:35:44,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-20 11:35:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2019-11-20 11:35:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-20 11:35:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 268 transitions. [2019-11-20 11:35:44,384 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 268 transitions. Word has length 76 [2019-11-20 11:35:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:44,384 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 268 transitions. [2019-11-20 11:35:44,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 268 transitions. [2019-11-20 11:35:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 11:35:44,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:44,390 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 11:35:44,391 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1336989440, now seen corresponding path program 1 times [2019-11-20 11:35:44,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:44,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504970778] [2019-11-20 11:35:44,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:44,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504970778] [2019-11-20 11:35:44,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:44,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:44,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877838561] [2019-11-20 11:35:44,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:44,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:44,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:44,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:44,447 INFO L87 Difference]: Start difference. First operand 177 states and 268 transitions. Second operand 4 states. [2019-11-20 11:35:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:44,809 INFO L93 Difference]: Finished difference Result 352 states and 537 transitions. [2019-11-20 11:35:44,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:44,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-20 11:35:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:44,812 INFO L225 Difference]: With dead ends: 352 [2019-11-20 11:35:44,812 INFO L226 Difference]: Without dead ends: 194 [2019-11-20 11:35:44,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-20 11:35:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2019-11-20 11:35:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-20 11:35:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2019-11-20 11:35:44,817 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 77 [2019-11-20 11:35:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:44,818 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2019-11-20 11:35:44,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2019-11-20 11:35:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 11:35:44,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:44,819 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:44,819 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:44,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1849053503, now seen corresponding path program 1 times [2019-11-20 11:35:44,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:44,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094555652] [2019-11-20 11:35:44,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:35:44,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094555652] [2019-11-20 11:35:44,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:44,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:44,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832863764] [2019-11-20 11:35:44,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:44,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:44,881 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand 4 states. [2019-11-20 11:35:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:45,226 INFO L93 Difference]: Finished difference Result 342 states and 522 transitions. [2019-11-20 11:35:45,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:45,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-20 11:35:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:45,228 INFO L225 Difference]: With dead ends: 342 [2019-11-20 11:35:45,228 INFO L226 Difference]: Without dead ends: 184 [2019-11-20 11:35:45,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-20 11:35:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2019-11-20 11:35:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-20 11:35:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 266 transitions. [2019-11-20 11:35:45,235 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 266 transitions. Word has length 78 [2019-11-20 11:35:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:45,235 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 266 transitions. [2019-11-20 11:35:45,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 266 transitions. [2019-11-20 11:35:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 11:35:45,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:45,237 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:45,237 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2109463487, now seen corresponding path program 1 times [2019-11-20 11:35:45,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:45,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75417377] [2019-11-20 11:35:45,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:45,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75417377] [2019-11-20 11:35:45,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:45,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:45,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501987029] [2019-11-20 11:35:45,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:45,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:45,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:45,345 INFO L87 Difference]: Start difference. First operand 177 states and 266 transitions. Second operand 4 states. [2019-11-20 11:35:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:45,915 INFO L93 Difference]: Finished difference Result 449 states and 689 transitions. [2019-11-20 11:35:45,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:45,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-20 11:35:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:45,918 INFO L225 Difference]: With dead ends: 449 [2019-11-20 11:35:45,918 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 11:35:45,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 11:35:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 218. [2019-11-20 11:35:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-20 11:35:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 340 transitions. [2019-11-20 11:35:45,929 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 340 transitions. Word has length 83 [2019-11-20 11:35:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:45,930 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 340 transitions. [2019-11-20 11:35:45,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 340 transitions. [2019-11-20 11:35:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 11:35:45,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:45,931 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:45,931 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1937357315, now seen corresponding path program 1 times [2019-11-20 11:35:45,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:45,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43308348] [2019-11-20 11:35:45,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:45,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43308348] [2019-11-20 11:35:45,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:45,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:45,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448317809] [2019-11-20 11:35:45,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:45,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:45,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:45,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:45,997 INFO L87 Difference]: Start difference. First operand 218 states and 340 transitions. Second operand 4 states. [2019-11-20 11:35:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:46,374 INFO L93 Difference]: Finished difference Result 467 states and 735 transitions. [2019-11-20 11:35:46,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:46,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-20 11:35:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:46,376 INFO L225 Difference]: With dead ends: 467 [2019-11-20 11:35:46,377 INFO L226 Difference]: Without dead ends: 268 [2019-11-20 11:35:46,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-20 11:35:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 242. [2019-11-20 11:35:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-20 11:35:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 382 transitions. [2019-11-20 11:35:46,384 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 382 transitions. Word has length 83 [2019-11-20 11:35:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:46,385 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 382 transitions. [2019-11-20 11:35:46,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 382 transitions. [2019-11-20 11:35:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 11:35:46,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:46,386 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:46,386 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:46,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:46,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1110712789, now seen corresponding path program 1 times [2019-11-20 11:35:46,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:46,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642050851] [2019-11-20 11:35:46,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:46,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642050851] [2019-11-20 11:35:46,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:46,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:46,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954752279] [2019-11-20 11:35:46,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:46,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:46,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:46,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:46,464 INFO L87 Difference]: Start difference. First operand 242 states and 382 transitions. Second operand 4 states. [2019-11-20 11:35:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:46,950 INFO L93 Difference]: Finished difference Result 529 states and 833 transitions. [2019-11-20 11:35:46,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:46,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-20 11:35:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:46,953 INFO L225 Difference]: With dead ends: 529 [2019-11-20 11:35:46,953 INFO L226 Difference]: Without dead ends: 306 [2019-11-20 11:35:46,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-20 11:35:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 243. [2019-11-20 11:35:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-20 11:35:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 383 transitions. [2019-11-20 11:35:46,960 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 383 transitions. Word has length 84 [2019-11-20 11:35:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:46,960 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 383 transitions. [2019-11-20 11:35:46,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 383 transitions. [2019-11-20 11:35:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 11:35:46,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:46,962 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:46,962 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:46,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1974058391, now seen corresponding path program 1 times [2019-11-20 11:35:46,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:46,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601918049] [2019-11-20 11:35:46,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:47,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601918049] [2019-11-20 11:35:47,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:47,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:47,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818518407] [2019-11-20 11:35:47,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:47,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:47,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:47,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:47,036 INFO L87 Difference]: Start difference. First operand 243 states and 383 transitions. Second operand 4 states. [2019-11-20 11:35:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:47,417 INFO L93 Difference]: Finished difference Result 530 states and 833 transitions. [2019-11-20 11:35:47,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:47,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 11:35:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:47,421 INFO L225 Difference]: With dead ends: 530 [2019-11-20 11:35:47,421 INFO L226 Difference]: Without dead ends: 306 [2019-11-20 11:35:47,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-20 11:35:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 243. [2019-11-20 11:35:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-20 11:35:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 382 transitions. [2019-11-20 11:35:47,428 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 382 transitions. Word has length 96 [2019-11-20 11:35:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:47,428 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 382 transitions. [2019-11-20 11:35:47,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 382 transitions. [2019-11-20 11:35:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 11:35:47,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:47,430 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:47,430 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash -934123495, now seen corresponding path program 1 times [2019-11-20 11:35:47,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:47,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26987781] [2019-11-20 11:35:47,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:47,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26987781] [2019-11-20 11:35:47,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:47,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:47,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221622743] [2019-11-20 11:35:47,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:47,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:47,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:47,495 INFO L87 Difference]: Start difference. First operand 243 states and 382 transitions. Second operand 4 states. [2019-11-20 11:35:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:47,886 INFO L93 Difference]: Finished difference Result 493 states and 776 transitions. [2019-11-20 11:35:47,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:47,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 11:35:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:47,888 INFO L225 Difference]: With dead ends: 493 [2019-11-20 11:35:47,888 INFO L226 Difference]: Without dead ends: 269 [2019-11-20 11:35:47,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-20 11:35:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 243. [2019-11-20 11:35:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-20 11:35:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 381 transitions. [2019-11-20 11:35:47,895 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 381 transitions. Word has length 96 [2019-11-20 11:35:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:47,895 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 381 transitions. [2019-11-20 11:35:47,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 381 transitions. [2019-11-20 11:35:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 11:35:47,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:47,896 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:47,897 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:47,898 INFO L82 PathProgramCache]: Analyzing trace with hash -354584751, now seen corresponding path program 1 times [2019-11-20 11:35:47,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:47,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430200531] [2019-11-20 11:35:47,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:47,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430200531] [2019-11-20 11:35:47,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:47,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:47,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588710188] [2019-11-20 11:35:47,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:47,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:47,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:47,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:47,959 INFO L87 Difference]: Start difference. First operand 243 states and 381 transitions. Second operand 4 states. [2019-11-20 11:35:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:48,364 INFO L93 Difference]: Finished difference Result 529 states and 828 transitions. [2019-11-20 11:35:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:48,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 11:35:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:48,366 INFO L225 Difference]: With dead ends: 529 [2019-11-20 11:35:48,367 INFO L226 Difference]: Without dead ends: 305 [2019-11-20 11:35:48,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-20 11:35:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2019-11-20 11:35:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-20 11:35:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 380 transitions. [2019-11-20 11:35:48,373 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 380 transitions. Word has length 97 [2019-11-20 11:35:48,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:48,373 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 380 transitions. [2019-11-20 11:35:48,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 380 transitions. [2019-11-20 11:35:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 11:35:48,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:48,375 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:48,375 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash -311255930, now seen corresponding path program 1 times [2019-11-20 11:35:48,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:48,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199662105] [2019-11-20 11:35:48,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:48,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199662105] [2019-11-20 11:35:48,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:48,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:48,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804629783] [2019-11-20 11:35:48,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:48,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:48,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:48,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:48,493 INFO L87 Difference]: Start difference. First operand 243 states and 380 transitions. Second operand 4 states. [2019-11-20 11:35:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:48,959 INFO L93 Difference]: Finished difference Result 527 states and 824 transitions. [2019-11-20 11:35:48,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:48,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 11:35:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:48,961 INFO L225 Difference]: With dead ends: 527 [2019-11-20 11:35:48,961 INFO L226 Difference]: Without dead ends: 303 [2019-11-20 11:35:48,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-20 11:35:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 243. [2019-11-20 11:35:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-20 11:35:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 379 transitions. [2019-11-20 11:35:48,968 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 379 transitions. Word has length 97 [2019-11-20 11:35:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:48,968 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 379 transitions. [2019-11-20 11:35:48,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 379 transitions. [2019-11-20 11:35:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 11:35:48,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:48,969 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:48,969 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:48,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1659030854, now seen corresponding path program 1 times [2019-11-20 11:35:48,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:48,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663148083] [2019-11-20 11:35:48,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:49,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663148083] [2019-11-20 11:35:49,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:49,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:49,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100340848] [2019-11-20 11:35:49,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:49,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:49,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:49,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:49,058 INFO L87 Difference]: Start difference. First operand 243 states and 379 transitions. Second operand 4 states. [2019-11-20 11:35:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:49,547 INFO L93 Difference]: Finished difference Result 526 states and 821 transitions. [2019-11-20 11:35:49,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:49,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 11:35:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:49,550 INFO L225 Difference]: With dead ends: 526 [2019-11-20 11:35:49,550 INFO L226 Difference]: Without dead ends: 302 [2019-11-20 11:35:49,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-20 11:35:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 243. [2019-11-20 11:35:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-20 11:35:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 378 transitions. [2019-11-20 11:35:49,557 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 378 transitions. Word has length 97 [2019-11-20 11:35:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:49,557 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 378 transitions. [2019-11-20 11:35:49,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 378 transitions. [2019-11-20 11:35:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 11:35:49,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:49,558 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:49,559 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:49,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1990120131, now seen corresponding path program 1 times [2019-11-20 11:35:49,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:49,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716760478] [2019-11-20 11:35:49,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 11:35:49,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716760478] [2019-11-20 11:35:49,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:49,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:35:49,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112442249] [2019-11-20 11:35:49,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:35:49,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:49,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:35:49,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:35:49,645 INFO L87 Difference]: Start difference. First operand 243 states and 378 transitions. Second operand 5 states. [2019-11-20 11:35:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:50,364 INFO L93 Difference]: Finished difference Result 488 states and 764 transitions. [2019-11-20 11:35:50,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:35:50,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-11-20 11:35:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:50,366 INFO L225 Difference]: With dead ends: 488 [2019-11-20 11:35:50,366 INFO L226 Difference]: Without dead ends: 264 [2019-11-20 11:35:50,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:35:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-20 11:35:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2019-11-20 11:35:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 404 transitions. [2019-11-20 11:35:50,373 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 404 transitions. Word has length 97 [2019-11-20 11:35:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:50,374 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 404 transitions. [2019-11-20 11:35:50,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:35:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 404 transitions. [2019-11-20 11:35:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 11:35:50,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:50,375 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:50,376 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash -270581180, now seen corresponding path program 1 times [2019-11-20 11:35:50,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:50,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712406718] [2019-11-20 11:35:50,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:50,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712406718] [2019-11-20 11:35:50,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:50,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:50,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132624170] [2019-11-20 11:35:50,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:50,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:50,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:50,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:50,437 INFO L87 Difference]: Start difference. First operand 263 states and 404 transitions. Second operand 4 states. [2019-11-20 11:35:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:50,938 INFO L93 Difference]: Finished difference Result 530 states and 816 transitions. [2019-11-20 11:35:50,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:50,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 11:35:50,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:50,940 INFO L225 Difference]: With dead ends: 530 [2019-11-20 11:35:50,940 INFO L226 Difference]: Without dead ends: 286 [2019-11-20 11:35:50,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-20 11:35:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 263. [2019-11-20 11:35:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 403 transitions. [2019-11-20 11:35:50,947 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 403 transitions. Word has length 97 [2019-11-20 11:35:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:50,948 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 403 transitions. [2019-11-20 11:35:50,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 403 transitions. [2019-11-20 11:35:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 11:35:50,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:50,949 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:50,949 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:50,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1699705604, now seen corresponding path program 1 times [2019-11-20 11:35:50,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:50,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996686823] [2019-11-20 11:35:50,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:51,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996686823] [2019-11-20 11:35:51,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:51,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:51,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946001532] [2019-11-20 11:35:51,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:51,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:51,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:51,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:51,021 INFO L87 Difference]: Start difference. First operand 263 states and 403 transitions. Second operand 4 states. [2019-11-20 11:35:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:51,382 INFO L93 Difference]: Finished difference Result 529 states and 813 transitions. [2019-11-20 11:35:51,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:51,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 11:35:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:51,385 INFO L225 Difference]: With dead ends: 529 [2019-11-20 11:35:51,385 INFO L226 Difference]: Without dead ends: 285 [2019-11-20 11:35:51,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-20 11:35:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-11-20 11:35:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 402 transitions. [2019-11-20 11:35:51,393 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 402 transitions. Word has length 97 [2019-11-20 11:35:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:51,394 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 402 transitions. [2019-11-20 11:35:51,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 402 transitions. [2019-11-20 11:35:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 11:35:51,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:51,395 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:51,395 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash 337163803, now seen corresponding path program 1 times [2019-11-20 11:35:51,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:51,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409952582] [2019-11-20 11:35:51,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:51,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409952582] [2019-11-20 11:35:51,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:51,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:51,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569201665] [2019-11-20 11:35:51,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:51,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:51,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:51,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:51,454 INFO L87 Difference]: Start difference. First operand 263 states and 402 transitions. Second operand 4 states. [2019-11-20 11:35:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:51,931 INFO L93 Difference]: Finished difference Result 566 states and 866 transitions. [2019-11-20 11:35:51,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:51,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 11:35:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:51,933 INFO L225 Difference]: With dead ends: 566 [2019-11-20 11:35:51,933 INFO L226 Difference]: Without dead ends: 322 [2019-11-20 11:35:51,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-20 11:35:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 263. [2019-11-20 11:35:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 401 transitions. [2019-11-20 11:35:51,941 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 401 transitions. Word has length 98 [2019-11-20 11:35:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:51,941 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 401 transitions. [2019-11-20 11:35:51,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 401 transitions. [2019-11-20 11:35:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 11:35:51,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:51,942 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:51,942 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:51,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:51,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1598081053, now seen corresponding path program 1 times [2019-11-20 11:35:51,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:51,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027040531] [2019-11-20 11:35:51,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:52,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027040531] [2019-11-20 11:35:52,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:52,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:52,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7191447] [2019-11-20 11:35:52,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:52,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:52,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:52,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:52,011 INFO L87 Difference]: Start difference. First operand 263 states and 401 transitions. Second operand 4 states. [2019-11-20 11:35:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:52,365 INFO L93 Difference]: Finished difference Result 529 states and 809 transitions. [2019-11-20 11:35:52,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:52,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 11:35:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:52,368 INFO L225 Difference]: With dead ends: 529 [2019-11-20 11:35:52,368 INFO L226 Difference]: Without dead ends: 285 [2019-11-20 11:35:52,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-20 11:35:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-11-20 11:35:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 400 transitions. [2019-11-20 11:35:52,376 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 400 transitions. Word has length 98 [2019-11-20 11:35:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:52,376 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 400 transitions. [2019-11-20 11:35:52,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 400 transitions. [2019-11-20 11:35:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 11:35:52,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:52,378 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:52,378 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1403773942, now seen corresponding path program 1 times [2019-11-20 11:35:52,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:52,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958041609] [2019-11-20 11:35:52,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:52,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958041609] [2019-11-20 11:35:52,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:52,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:52,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897930124] [2019-11-20 11:35:52,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:52,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:52,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:52,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:52,437 INFO L87 Difference]: Start difference. First operand 263 states and 400 transitions. Second operand 4 states. [2019-11-20 11:35:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:52,896 INFO L93 Difference]: Finished difference Result 566 states and 862 transitions. [2019-11-20 11:35:52,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:52,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 11:35:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:52,898 INFO L225 Difference]: With dead ends: 566 [2019-11-20 11:35:52,899 INFO L226 Difference]: Without dead ends: 322 [2019-11-20 11:35:52,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-20 11:35:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 263. [2019-11-20 11:35:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 399 transitions. [2019-11-20 11:35:52,906 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 399 transitions. Word has length 99 [2019-11-20 11:35:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:52,907 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 399 transitions. [2019-11-20 11:35:52,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 399 transitions. [2019-11-20 11:35:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 11:35:52,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:52,908 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:52,908 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash -970044856, now seen corresponding path program 1 times [2019-11-20 11:35:52,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:52,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656951050] [2019-11-20 11:35:52,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:52,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656951050] [2019-11-20 11:35:52,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:52,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:52,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43679473] [2019-11-20 11:35:52,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:52,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:52,969 INFO L87 Difference]: Start difference. First operand 263 states and 399 transitions. Second operand 4 states. [2019-11-20 11:35:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:53,308 INFO L93 Difference]: Finished difference Result 529 states and 805 transitions. [2019-11-20 11:35:53,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:53,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 11:35:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:53,310 INFO L225 Difference]: With dead ends: 529 [2019-11-20 11:35:53,310 INFO L226 Difference]: Without dead ends: 285 [2019-11-20 11:35:53,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:53,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-20 11:35:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-11-20 11:35:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 398 transitions. [2019-11-20 11:35:53,317 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 398 transitions. Word has length 99 [2019-11-20 11:35:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:53,317 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 398 transitions. [2019-11-20 11:35:53,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 398 transitions. [2019-11-20 11:35:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 11:35:53,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:53,319 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:53,319 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:53,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:53,319 INFO L82 PathProgramCache]: Analyzing trace with hash 422934016, now seen corresponding path program 1 times [2019-11-20 11:35:53,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:53,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127900529] [2019-11-20 11:35:53,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:53,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127900529] [2019-11-20 11:35:53,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:53,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:53,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315190284] [2019-11-20 11:35:53,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:53,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:53,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:53,381 INFO L87 Difference]: Start difference. First operand 263 states and 398 transitions. Second operand 4 states. [2019-11-20 11:35:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:53,776 INFO L93 Difference]: Finished difference Result 566 states and 858 transitions. [2019-11-20 11:35:53,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:53,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 11:35:53,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:53,780 INFO L225 Difference]: With dead ends: 566 [2019-11-20 11:35:53,780 INFO L226 Difference]: Without dead ends: 322 [2019-11-20 11:35:53,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-20 11:35:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 263. [2019-11-20 11:35:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 397 transitions. [2019-11-20 11:35:53,787 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 397 transitions. Word has length 100 [2019-11-20 11:35:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:53,787 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 397 transitions. [2019-11-20 11:35:53,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 397 transitions. [2019-11-20 11:35:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 11:35:53,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:53,789 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:53,789 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:53,790 INFO L82 PathProgramCache]: Analyzing trace with hash 983633794, now seen corresponding path program 1 times [2019-11-20 11:35:53,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:53,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283621616] [2019-11-20 11:35:53,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:53,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283621616] [2019-11-20 11:35:53,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:53,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:53,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907825404] [2019-11-20 11:35:53,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:53,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:53,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:53,850 INFO L87 Difference]: Start difference. First operand 263 states and 397 transitions. Second operand 4 states. [2019-11-20 11:35:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:54,164 INFO L93 Difference]: Finished difference Result 529 states and 801 transitions. [2019-11-20 11:35:54,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:54,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 11:35:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:54,165 INFO L225 Difference]: With dead ends: 529 [2019-11-20 11:35:54,166 INFO L226 Difference]: Without dead ends: 285 [2019-11-20 11:35:54,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-20 11:35:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-11-20 11:35:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2019-11-20 11:35:54,173 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 100 [2019-11-20 11:35:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:54,173 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2019-11-20 11:35:54,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2019-11-20 11:35:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 11:35:54,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:54,175 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:54,175 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1177509071, now seen corresponding path program 1 times [2019-11-20 11:35:54,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:54,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588706237] [2019-11-20 11:35:54,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:54,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588706237] [2019-11-20 11:35:54,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:54,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:54,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367487187] [2019-11-20 11:35:54,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:54,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:54,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:54,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:54,249 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand 4 states. [2019-11-20 11:35:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:54,653 INFO L93 Difference]: Finished difference Result 556 states and 842 transitions. [2019-11-20 11:35:54,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:54,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 11:35:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:54,655 INFO L225 Difference]: With dead ends: 556 [2019-11-20 11:35:54,655 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 11:35:54,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 11:35:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 263. [2019-11-20 11:35:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 395 transitions. [2019-11-20 11:35:54,663 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 395 transitions. Word has length 101 [2019-11-20 11:35:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:54,663 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 395 transitions. [2019-11-20 11:35:54,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 395 transitions. [2019-11-20 11:35:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 11:35:54,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:54,664 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:54,664 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:54,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:54,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1379333005, now seen corresponding path program 1 times [2019-11-20 11:35:54,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:54,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924358669] [2019-11-20 11:35:54,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:54,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924358669] [2019-11-20 11:35:54,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:54,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:54,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750224964] [2019-11-20 11:35:54,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:54,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:54,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:54,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:54,728 INFO L87 Difference]: Start difference. First operand 263 states and 395 transitions. Second operand 4 states. [2019-11-20 11:35:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:55,068 INFO L93 Difference]: Finished difference Result 519 states and 785 transitions. [2019-11-20 11:35:55,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:55,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 11:35:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:55,070 INFO L225 Difference]: With dead ends: 519 [2019-11-20 11:35:55,070 INFO L226 Difference]: Without dead ends: 275 [2019-11-20 11:35:55,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-20 11:35:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 263. [2019-11-20 11:35:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2019-11-20 11:35:55,078 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 101 [2019-11-20 11:35:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:55,079 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2019-11-20 11:35:55,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2019-11-20 11:35:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 11:35:55,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:55,081 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:55,081 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash -933489527, now seen corresponding path program 1 times [2019-11-20 11:35:55,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:55,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143635961] [2019-11-20 11:35:55,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 11:35:55,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143635961] [2019-11-20 11:35:55,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:55,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:55,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608231781] [2019-11-20 11:35:55,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:55,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:55,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:55,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:55,139 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand 4 states. [2019-11-20 11:35:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:55,583 INFO L93 Difference]: Finished difference Result 556 states and 838 transitions. [2019-11-20 11:35:55,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:55,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-20 11:35:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:55,584 INFO L225 Difference]: With dead ends: 556 [2019-11-20 11:35:55,584 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 11:35:55,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:35:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 11:35:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 263. [2019-11-20 11:35:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-20 11:35:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 393 transitions. [2019-11-20 11:35:55,592 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 393 transitions. Word has length 105 [2019-11-20 11:35:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:55,592 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 393 transitions. [2019-11-20 11:35:55,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 393 transitions. [2019-11-20 11:35:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 11:35:55,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:55,594 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:55,594 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:55,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash -987882425, now seen corresponding path program 1 times [2019-11-20 11:35:55,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:55,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195662352] [2019-11-20 11:35:55,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 11:35:55,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195662352] [2019-11-20 11:35:55,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:55,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:35:55,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143900332] [2019-11-20 11:35:55,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:35:55,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:55,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:35:55,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:35:55,652 INFO L87 Difference]: Start difference. First operand 263 states and 393 transitions. Second operand 3 states. [2019-11-20 11:35:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:55,772 INFO L93 Difference]: Finished difference Result 749 states and 1134 transitions. [2019-11-20 11:35:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:35:55,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 11:35:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:55,777 INFO L225 Difference]: With dead ends: 749 [2019-11-20 11:35:55,777 INFO L226 Difference]: Without dead ends: 505 [2019-11-20 11:35:55,778 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 11:35:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-20 11:35:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-11-20 11:35:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-20 11:35:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 747 transitions. [2019-11-20 11:35:55,792 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 747 transitions. Word has length 105 [2019-11-20 11:35:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:55,792 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 747 transitions. [2019-11-20 11:35:55,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:35:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 747 transitions. [2019-11-20 11:35:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 11:35:55,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:55,794 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:55,794 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:55,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1325689411, now seen corresponding path program 1 times [2019-11-20 11:35:55,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:55,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425400079] [2019-11-20 11:35:55,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 11:35:55,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425400079] [2019-11-20 11:35:55,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:55,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:35:55,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593370200] [2019-11-20 11:35:55,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:35:55,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:55,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:35:55,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:35:55,850 INFO L87 Difference]: Start difference. First operand 505 states and 747 transitions. Second operand 3 states. [2019-11-20 11:35:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:55,962 INFO L93 Difference]: Finished difference Result 1233 states and 1842 transitions. [2019-11-20 11:35:55,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:35:55,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-20 11:35:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:55,966 INFO L225 Difference]: With dead ends: 1233 [2019-11-20 11:35:55,967 INFO L226 Difference]: Without dead ends: 747 [2019-11-20 11:35:55,967 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 11:35:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-20 11:35:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-11-20 11:35:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-20 11:35:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1102 transitions. [2019-11-20 11:35:55,987 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1102 transitions. Word has length 107 [2019-11-20 11:35:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:55,987 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1102 transitions. [2019-11-20 11:35:55,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:35:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1102 transitions. [2019-11-20 11:35:55,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 11:35:55,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:55,990 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:55,990 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:55,990 INFO L82 PathProgramCache]: Analyzing trace with hash -982069472, now seen corresponding path program 1 times [2019-11-20 11:35:55,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:55,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714192938] [2019-11-20 11:35:55,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 11:35:56,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714192938] [2019-11-20 11:35:56,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:56,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:56,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595774131] [2019-11-20 11:35:56,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:56,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:56,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:56,062 INFO L87 Difference]: Start difference. First operand 747 states and 1102 transitions. Second operand 4 states. [2019-11-20 11:35:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:56,503 INFO L93 Difference]: Finished difference Result 1664 states and 2476 transitions. [2019-11-20 11:35:56,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:56,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-20 11:35:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:56,508 INFO L225 Difference]: With dead ends: 1664 [2019-11-20 11:35:56,508 INFO L226 Difference]: Without dead ends: 936 [2019-11-20 11:35:56,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-11-20 11:35:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 831. [2019-11-20 11:35:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 11:35:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1249 transitions. [2019-11-20 11:35:56,533 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1249 transitions. Word has length 136 [2019-11-20 11:35:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:56,534 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1249 transitions. [2019-11-20 11:35:56,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1249 transitions. [2019-11-20 11:35:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 11:35:56,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:56,536 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:56,537 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:56,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:56,537 INFO L82 PathProgramCache]: Analyzing trace with hash 664473558, now seen corresponding path program 1 times [2019-11-20 11:35:56,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:56,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880966940] [2019-11-20 11:35:56,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 11:35:56,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880966940] [2019-11-20 11:35:56,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:56,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:56,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714237389] [2019-11-20 11:35:56,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:56,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:56,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:56,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:56,608 INFO L87 Difference]: Start difference. First operand 831 states and 1249 transitions. Second operand 4 states. [2019-11-20 11:35:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:56,998 INFO L93 Difference]: Finished difference Result 1748 states and 2620 transitions. [2019-11-20 11:35:56,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:56,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-20 11:35:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:57,004 INFO L225 Difference]: With dead ends: 1748 [2019-11-20 11:35:57,004 INFO L226 Difference]: Without dead ends: 936 [2019-11-20 11:35:57,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-11-20 11:35:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 831. [2019-11-20 11:35:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 11:35:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1246 transitions. [2019-11-20 11:35:57,058 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1246 transitions. Word has length 149 [2019-11-20 11:35:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:57,058 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1246 transitions. [2019-11-20 11:35:57,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1246 transitions. [2019-11-20 11:35:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 11:35:57,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:57,061 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:57,061 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:57,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2041287207, now seen corresponding path program 1 times [2019-11-20 11:35:57,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:57,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109343250] [2019-11-20 11:35:57,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 11:35:57,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109343250] [2019-11-20 11:35:57,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:57,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:57,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850984378] [2019-11-20 11:35:57,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:57,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:57,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:57,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:57,146 INFO L87 Difference]: Start difference. First operand 831 states and 1246 transitions. Second operand 4 states. [2019-11-20 11:35:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:57,467 INFO L93 Difference]: Finished difference Result 1742 states and 2608 transitions. [2019-11-20 11:35:57,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:57,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-20 11:35:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:57,473 INFO L225 Difference]: With dead ends: 1742 [2019-11-20 11:35:57,473 INFO L226 Difference]: Without dead ends: 930 [2019-11-20 11:35:57,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-11-20 11:35:57,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 831. [2019-11-20 11:35:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 11:35:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1243 transitions. [2019-11-20 11:35:57,495 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1243 transitions. Word has length 150 [2019-11-20 11:35:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:57,495 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1243 transitions. [2019-11-20 11:35:57,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1243 transitions. [2019-11-20 11:35:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 11:35:57,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:57,498 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:57,498 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash -283393305, now seen corresponding path program 1 times [2019-11-20 11:35:57,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:57,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158366283] [2019-11-20 11:35:57,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 11:35:57,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158366283] [2019-11-20 11:35:57,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:57,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:57,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036606613] [2019-11-20 11:35:57,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:57,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:57,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:57,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:57,577 INFO L87 Difference]: Start difference. First operand 831 states and 1243 transitions. Second operand 4 states. [2019-11-20 11:35:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:57,903 INFO L93 Difference]: Finished difference Result 1739 states and 2599 transitions. [2019-11-20 11:35:57,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:57,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-20 11:35:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:57,907 INFO L225 Difference]: With dead ends: 1739 [2019-11-20 11:35:57,907 INFO L226 Difference]: Without dead ends: 927 [2019-11-20 11:35:57,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-11-20 11:35:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2019-11-20 11:35:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 11:35:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1240 transitions. [2019-11-20 11:35:57,928 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1240 transitions. Word has length 150 [2019-11-20 11:35:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:57,928 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1240 transitions. [2019-11-20 11:35:57,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1240 transitions. [2019-11-20 11:35:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 11:35:57,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:57,931 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:57,931 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:57,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash 251557018, now seen corresponding path program 1 times [2019-11-20 11:35:57,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:57,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108749161] [2019-11-20 11:35:57,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 11:35:58,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108749161] [2019-11-20 11:35:58,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:58,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:58,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142717753] [2019-11-20 11:35:58,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:58,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:58,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:58,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:58,006 INFO L87 Difference]: Start difference. First operand 831 states and 1240 transitions. Second operand 4 states. [2019-11-20 11:35:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:58,465 INFO L93 Difference]: Finished difference Result 1739 states and 2593 transitions. [2019-11-20 11:35:58,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:58,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-20 11:35:58,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:58,470 INFO L225 Difference]: With dead ends: 1739 [2019-11-20 11:35:58,470 INFO L226 Difference]: Without dead ends: 927 [2019-11-20 11:35:58,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-11-20 11:35:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2019-11-20 11:35:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 11:35:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1237 transitions. [2019-11-20 11:35:58,493 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1237 transitions. Word has length 151 [2019-11-20 11:35:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:58,493 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1237 transitions. [2019-11-20 11:35:58,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1237 transitions. [2019-11-20 11:35:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 11:35:58,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:58,496 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:58,496 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash 237383019, now seen corresponding path program 1 times [2019-11-20 11:35:58,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:58,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967037790] [2019-11-20 11:35:58,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 11:35:58,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967037790] [2019-11-20 11:35:58,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:58,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:58,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065515997] [2019-11-20 11:35:58,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:58,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:58,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:58,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:58,607 INFO L87 Difference]: Start difference. First operand 831 states and 1237 transitions. Second operand 4 states. [2019-11-20 11:35:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:59,050 INFO L93 Difference]: Finished difference Result 1739 states and 2587 transitions. [2019-11-20 11:35:59,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:59,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-20 11:35:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:59,055 INFO L225 Difference]: With dead ends: 1739 [2019-11-20 11:35:59,055 INFO L226 Difference]: Without dead ends: 927 [2019-11-20 11:35:59,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-11-20 11:35:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2019-11-20 11:35:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 11:35:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1234 transitions. [2019-11-20 11:35:59,077 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1234 transitions. Word has length 152 [2019-11-20 11:35:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:59,078 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1234 transitions. [2019-11-20 11:35:59,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:59,078 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1234 transitions. [2019-11-20 11:35:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-20 11:35:59,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:59,080 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:59,080 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:59,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:59,081 INFO L82 PathProgramCache]: Analyzing trace with hash -240807745, now seen corresponding path program 1 times [2019-11-20 11:35:59,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:59,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562425153] [2019-11-20 11:35:59,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 11:35:59,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562425153] [2019-11-20 11:35:59,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:59,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:59,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775588530] [2019-11-20 11:35:59,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:59,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:59,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:59,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:59,163 INFO L87 Difference]: Start difference. First operand 831 states and 1234 transitions. Second operand 4 states. [2019-11-20 11:35:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:35:59,561 INFO L93 Difference]: Finished difference Result 1739 states and 2581 transitions. [2019-11-20 11:35:59,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:35:59,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-20 11:35:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:35:59,566 INFO L225 Difference]: With dead ends: 1739 [2019-11-20 11:35:59,566 INFO L226 Difference]: Without dead ends: 927 [2019-11-20 11:35:59,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:35:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-11-20 11:35:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2019-11-20 11:35:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 11:35:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1231 transitions. [2019-11-20 11:35:59,593 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1231 transitions. Word has length 153 [2019-11-20 11:35:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:35:59,593 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1231 transitions. [2019-11-20 11:35:59,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:35:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1231 transitions. [2019-11-20 11:35:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 11:35:59,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:35:59,596 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:35:59,597 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:35:59,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:35:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2076350960, now seen corresponding path program 1 times [2019-11-20 11:35:59,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:35:59,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162567531] [2019-11-20 11:35:59,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:35:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:35:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 11:35:59,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162567531] [2019-11-20 11:35:59,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:35:59,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:35:59,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147444034] [2019-11-20 11:35:59,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:35:59,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:35:59,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:35:59,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:35:59,700 INFO L87 Difference]: Start difference. First operand 831 states and 1231 transitions. Second operand 4 states. [2019-11-20 11:36:00,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:00,105 INFO L93 Difference]: Finished difference Result 1709 states and 2539 transitions. [2019-11-20 11:36:00,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:00,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-20 11:36:00,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:00,110 INFO L225 Difference]: With dead ends: 1709 [2019-11-20 11:36:00,111 INFO L226 Difference]: Without dead ends: 897 [2019-11-20 11:36:00,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-11-20 11:36:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 831. [2019-11-20 11:36:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 11:36:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1228 transitions. [2019-11-20 11:36:00,133 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1228 transitions. Word has length 154 [2019-11-20 11:36:00,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:00,134 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1228 transitions. [2019-11-20 11:36:00,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1228 transitions. [2019-11-20 11:36:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 11:36:00,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:00,136 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-20 11:36:00,136 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:00,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:00,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1507449130, now seen corresponding path program 1 times [2019-11-20 11:36:00,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:00,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719648272] [2019-11-20 11:36:00,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 11:36:00,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719648272] [2019-11-20 11:36:00,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:00,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:00,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698297632] [2019-11-20 11:36:00,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:00,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:00,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:00,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:00,226 INFO L87 Difference]: Start difference. First operand 831 states and 1228 transitions. Second operand 4 states. [2019-11-20 11:36:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:00,512 INFO L93 Difference]: Finished difference Result 1709 states and 2533 transitions. [2019-11-20 11:36:00,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:00,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-20 11:36:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:00,516 INFO L225 Difference]: With dead ends: 1709 [2019-11-20 11:36:00,517 INFO L226 Difference]: Without dead ends: 897 [2019-11-20 11:36:00,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-11-20 11:36:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 831. [2019-11-20 11:36:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 11:36:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1225 transitions. [2019-11-20 11:36:00,538 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1225 transitions. Word has length 158 [2019-11-20 11:36:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:00,538 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1225 transitions. [2019-11-20 11:36:00,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1225 transitions. [2019-11-20 11:36:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 11:36:00,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:00,540 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:36:00,541 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:00,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:00,541 INFO L82 PathProgramCache]: Analyzing trace with hash -677396615, now seen corresponding path program 1 times [2019-11-20 11:36:00,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:00,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902811186] [2019-11-20 11:36:00,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 11:36:00,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902811186] [2019-11-20 11:36:00,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:00,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:00,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400508615] [2019-11-20 11:36:00,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:00,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:00,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:00,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:00,619 INFO L87 Difference]: Start difference. First operand 831 states and 1225 transitions. Second operand 4 states. [2019-11-20 11:36:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:01,133 INFO L93 Difference]: Finished difference Result 1694 states and 2506 transitions. [2019-11-20 11:36:01,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:01,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-20 11:36:01,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:01,138 INFO L225 Difference]: With dead ends: 1694 [2019-11-20 11:36:01,138 INFO L226 Difference]: Without dead ends: 882 [2019-11-20 11:36:01,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-11-20 11:36:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 831. [2019-11-20 11:36:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-20 11:36:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1222 transitions. [2019-11-20 11:36:01,160 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1222 transitions. Word has length 159 [2019-11-20 11:36:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:01,160 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1222 transitions. [2019-11-20 11:36:01,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1222 transitions. [2019-11-20 11:36:01,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 11:36:01,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:01,162 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:36:01,163 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:01,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:01,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1354743335, now seen corresponding path program 1 times [2019-11-20 11:36:01,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:01,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566041942] [2019-11-20 11:36:01,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 11:36:01,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566041942] [2019-11-20 11:36:01,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:01,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:01,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558772712] [2019-11-20 11:36:01,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:01,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:01,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:01,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:01,247 INFO L87 Difference]: Start difference. First operand 831 states and 1222 transitions. Second operand 4 states. [2019-11-20 11:36:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:01,624 INFO L93 Difference]: Finished difference Result 1844 states and 2734 transitions. [2019-11-20 11:36:01,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:01,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-20 11:36:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:01,628 INFO L225 Difference]: With dead ends: 1844 [2019-11-20 11:36:01,628 INFO L226 Difference]: Without dead ends: 1032 [2019-11-20 11:36:01,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:01,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2019-11-20 11:36:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 921. [2019-11-20 11:36:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-20 11:36:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1381 transitions. [2019-11-20 11:36:01,648 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1381 transitions. Word has length 161 [2019-11-20 11:36:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:01,649 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1381 transitions. [2019-11-20 11:36:01,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1381 transitions. [2019-11-20 11:36:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 11:36:01,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:01,651 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:36:01,652 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1739058850, now seen corresponding path program 1 times [2019-11-20 11:36:01,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:01,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324582810] [2019-11-20 11:36:01,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 11:36:01,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324582810] [2019-11-20 11:36:01,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:01,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:01,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506594156] [2019-11-20 11:36:01,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:01,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:01,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:01,742 INFO L87 Difference]: Start difference. First operand 921 states and 1381 transitions. Second operand 3 states. [2019-11-20 11:36:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:01,888 INFO L93 Difference]: Finished difference Result 2123 states and 3203 transitions. [2019-11-20 11:36:01,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:01,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-20 11:36:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:01,894 INFO L225 Difference]: With dead ends: 2123 [2019-11-20 11:36:01,894 INFO L226 Difference]: Without dead ends: 1221 [2019-11-20 11:36:01,895 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 11:36:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-11-20 11:36:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1221. [2019-11-20 11:36:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-11-20 11:36:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1831 transitions. [2019-11-20 11:36:01,923 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1831 transitions. Word has length 167 [2019-11-20 11:36:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:01,924 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 1831 transitions. [2019-11-20 11:36:01,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1831 transitions. [2019-11-20 11:36:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 11:36:01,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:01,927 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 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 11:36:01,927 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:01,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1096356646, now seen corresponding path program 1 times [2019-11-20 11:36:01,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:01,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519083391] [2019-11-20 11:36:01,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 11:36:02,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519083391] [2019-11-20 11:36:02,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:02,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:02,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506926008] [2019-11-20 11:36:02,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:02,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:02,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:02,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:02,012 INFO L87 Difference]: Start difference. First operand 1221 states and 1831 transitions. Second operand 4 states. [2019-11-20 11:36:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:02,480 INFO L93 Difference]: Finished difference Result 2491 states and 3744 transitions. [2019-11-20 11:36:02,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:02,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-20 11:36:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:02,486 INFO L225 Difference]: With dead ends: 2491 [2019-11-20 11:36:02,486 INFO L226 Difference]: Without dead ends: 1289 [2019-11-20 11:36:02,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2019-11-20 11:36:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1221. [2019-11-20 11:36:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-11-20 11:36:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1827 transitions. [2019-11-20 11:36:02,506 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1827 transitions. Word has length 190 [2019-11-20 11:36:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:02,506 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 1827 transitions. [2019-11-20 11:36:02,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1827 transitions. [2019-11-20 11:36:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 11:36:02,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:02,508 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:36:02,508 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:02,509 INFO L82 PathProgramCache]: Analyzing trace with hash -987913707, now seen corresponding path program 1 times [2019-11-20 11:36:02,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:02,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244629440] [2019-11-20 11:36:02,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 11:36:02,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244629440] [2019-11-20 11:36:02,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:02,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:02,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577483008] [2019-11-20 11:36:02,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:02,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:02,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:02,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:02,589 INFO L87 Difference]: Start difference. First operand 1221 states and 1827 transitions. Second operand 4 states. [2019-11-20 11:36:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:02,884 INFO L93 Difference]: Finished difference Result 2475 states and 3712 transitions. [2019-11-20 11:36:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:02,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-20 11:36:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:02,891 INFO L225 Difference]: With dead ends: 2475 [2019-11-20 11:36:02,891 INFO L226 Difference]: Without dead ends: 1273 [2019-11-20 11:36:02,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-11-20 11:36:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1221. [2019-11-20 11:36:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-11-20 11:36:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1823 transitions. [2019-11-20 11:36:02,919 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1823 transitions. Word has length 191 [2019-11-20 11:36:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:02,919 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 1823 transitions. [2019-11-20 11:36:02,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1823 transitions. [2019-11-20 11:36:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 11:36:02,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:02,921 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:36:02,921 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:02,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:02,921 INFO L82 PathProgramCache]: Analyzing trace with hash -260688466, now seen corresponding path program 1 times [2019-11-20 11:36:02,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:02,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071812011] [2019-11-20 11:36:02,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-20 11:36:03,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071812011] [2019-11-20 11:36:03,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:03,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:03,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943195185] [2019-11-20 11:36:03,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:03,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:03,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:03,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:03,012 INFO L87 Difference]: Start difference. First operand 1221 states and 1823 transitions. Second operand 3 states. [2019-11-20 11:36:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:03,126 INFO L93 Difference]: Finished difference Result 2723 states and 4085 transitions. [2019-11-20 11:36:03,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:03,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-20 11:36:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:03,135 INFO L225 Difference]: With dead ends: 2723 [2019-11-20 11:36:03,136 INFO L226 Difference]: Without dead ends: 1521 [2019-11-20 11:36:03,137 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 11:36:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-11-20 11:36:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1521. [2019-11-20 11:36:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2019-11-20 11:36:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2272 transitions. [2019-11-20 11:36:03,165 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2272 transitions. Word has length 199 [2019-11-20 11:36:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:03,165 INFO L462 AbstractCegarLoop]: Abstraction has 1521 states and 2272 transitions. [2019-11-20 11:36:03,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2272 transitions. [2019-11-20 11:36:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 11:36:03,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:03,167 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:36:03,167 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:03,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:03,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1496144776, now seen corresponding path program 1 times [2019-11-20 11:36:03,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:03,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841872313] [2019-11-20 11:36:03,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-20 11:36:03,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841872313] [2019-11-20 11:36:03,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:03,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:03,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134843848] [2019-11-20 11:36:03,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:03,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:03,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:03,253 INFO L87 Difference]: Start difference. First operand 1521 states and 2272 transitions. Second operand 3 states. [2019-11-20 11:36:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:03,378 INFO L93 Difference]: Finished difference Result 3323 states and 4983 transitions. [2019-11-20 11:36:03,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:03,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-20 11:36:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:03,385 INFO L225 Difference]: With dead ends: 3323 [2019-11-20 11:36:03,385 INFO L226 Difference]: Without dead ends: 1821 [2019-11-20 11:36:03,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2019-11-20 11:36:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2019-11-20 11:36:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-11-20 11:36:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2722 transitions. [2019-11-20 11:36:03,418 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2722 transitions. Word has length 201 [2019-11-20 11:36:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:03,418 INFO L462 AbstractCegarLoop]: Abstraction has 1821 states and 2722 transitions. [2019-11-20 11:36:03,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2722 transitions. [2019-11-20 11:36:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-20 11:36:03,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:03,421 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:03,421 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:03,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1414654094, now seen corresponding path program 1 times [2019-11-20 11:36:03,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:03,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794252755] [2019-11-20 11:36:03,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-20 11:36:03,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794252755] [2019-11-20 11:36:03,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:03,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:03,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851599771] [2019-11-20 11:36:03,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:03,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:03,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:03,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:03,577 INFO L87 Difference]: Start difference. First operand 1821 states and 2722 transitions. Second operand 3 states. [2019-11-20 11:36:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:03,702 INFO L93 Difference]: Finished difference Result 3923 states and 5883 transitions. [2019-11-20 11:36:03,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:03,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-11-20 11:36:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:03,707 INFO L225 Difference]: With dead ends: 3923 [2019-11-20 11:36:03,707 INFO L226 Difference]: Without dead ends: 2121 [2019-11-20 11:36:03,709 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 11:36:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-11-20 11:36:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2121. [2019-11-20 11:36:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2019-11-20 11:36:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3173 transitions. [2019-11-20 11:36:03,754 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3173 transitions. Word has length 234 [2019-11-20 11:36:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:03,754 INFO L462 AbstractCegarLoop]: Abstraction has 2121 states and 3173 transitions. [2019-11-20 11:36:03,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3173 transitions. [2019-11-20 11:36:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-20 11:36:03,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:03,758 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:03,758 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:03,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash -931085824, now seen corresponding path program 1 times [2019-11-20 11:36:03,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:03,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908179090] [2019-11-20 11:36:03,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-11-20 11:36:03,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908179090] [2019-11-20 11:36:03,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:03,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:03,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064866637] [2019-11-20 11:36:03,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:03,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:03,881 INFO L87 Difference]: Start difference. First operand 2121 states and 3173 transitions. Second operand 3 states. [2019-11-20 11:36:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:04,027 INFO L93 Difference]: Finished difference Result 4516 states and 6774 transitions. [2019-11-20 11:36:04,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:04,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-20 11:36:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:04,033 INFO L225 Difference]: With dead ends: 4516 [2019-11-20 11:36:04,033 INFO L226 Difference]: Without dead ends: 2414 [2019-11-20 11:36:04,035 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 11:36:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-20 11:36:04,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2414. [2019-11-20 11:36:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2414 states. [2019-11-20 11:36:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3607 transitions. [2019-11-20 11:36:04,080 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3607 transitions. Word has length 269 [2019-11-20 11:36:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:04,080 INFO L462 AbstractCegarLoop]: Abstraction has 2414 states and 3607 transitions. [2019-11-20 11:36:04,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:04,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3607 transitions. [2019-11-20 11:36:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-20 11:36:04,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:04,085 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:36:04,085 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash -378887603, now seen corresponding path program 1 times [2019-11-20 11:36:04,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:04,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043559092] [2019-11-20 11:36:04,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-11-20 11:36:04,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043559092] [2019-11-20 11:36:04,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:04,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:04,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944308140] [2019-11-20 11:36:04,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:04,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:04,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:04,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:04,229 INFO L87 Difference]: Start difference. First operand 2414 states and 3607 transitions. Second operand 3 states. [2019-11-20 11:36:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:04,365 INFO L93 Difference]: Finished difference Result 5109 states and 7653 transitions. [2019-11-20 11:36:04,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:04,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-11-20 11:36:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:04,370 INFO L225 Difference]: With dead ends: 5109 [2019-11-20 11:36:04,370 INFO L226 Difference]: Without dead ends: 2714 [2019-11-20 11:36:04,373 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 11:36:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2019-11-20 11:36:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2714. [2019-11-20 11:36:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-20 11:36:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 4060 transitions. [2019-11-20 11:36:04,428 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 4060 transitions. Word has length 308 [2019-11-20 11:36:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:04,429 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 4060 transitions. [2019-11-20 11:36:04,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 4060 transitions. [2019-11-20 11:36:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-11-20 11:36:04,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:04,434 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:04,434 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:04,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:04,434 INFO L82 PathProgramCache]: Analyzing trace with hash -905095573, now seen corresponding path program 1 times [2019-11-20 11:36:04,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:04,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595060798] [2019-11-20 11:36:04,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-11-20 11:36:04,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595060798] [2019-11-20 11:36:04,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:04,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:04,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156980166] [2019-11-20 11:36:04,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:04,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:04,649 INFO L87 Difference]: Start difference. First operand 2714 states and 4060 transitions. Second operand 3 states. [2019-11-20 11:36:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:04,791 INFO L93 Difference]: Finished difference Result 5709 states and 8559 transitions. [2019-11-20 11:36:04,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:04,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2019-11-20 11:36:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:04,798 INFO L225 Difference]: With dead ends: 5709 [2019-11-20 11:36:04,798 INFO L226 Difference]: Without dead ends: 3014 [2019-11-20 11:36:04,801 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 11:36:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-11-20 11:36:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3014. [2019-11-20 11:36:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3014 states. [2019-11-20 11:36:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 4514 transitions. [2019-11-20 11:36:04,864 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 4514 transitions. Word has length 349 [2019-11-20 11:36:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:04,865 INFO L462 AbstractCegarLoop]: Abstraction has 3014 states and 4514 transitions. [2019-11-20 11:36:04,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 4514 transitions. [2019-11-20 11:36:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-20 11:36:04,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:04,871 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 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 11:36:04,871 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash -829902569, now seen corresponding path program 1 times [2019-11-20 11:36:04,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:04,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411954314] [2019-11-20 11:36:04,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-11-20 11:36:05,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411954314] [2019-11-20 11:36:05,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:05,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:05,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757168047] [2019-11-20 11:36:05,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:05,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:05,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:05,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:05,066 INFO L87 Difference]: Start difference. First operand 3014 states and 4514 transitions. Second operand 3 states. [2019-11-20 11:36:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:05,205 INFO L93 Difference]: Finished difference Result 6303 states and 9458 transitions. [2019-11-20 11:36:05,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:05,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-11-20 11:36:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:05,211 INFO L225 Difference]: With dead ends: 6303 [2019-11-20 11:36:05,212 INFO L226 Difference]: Without dead ends: 3308 [2019-11-20 11:36:05,215 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 11:36:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2019-11-20 11:36:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3308. [2019-11-20 11:36:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-11-20 11:36:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4949 transitions. [2019-11-20 11:36:05,286 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4949 transitions. Word has length 392 [2019-11-20 11:36:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:05,287 INFO L462 AbstractCegarLoop]: Abstraction has 3308 states and 4949 transitions. [2019-11-20 11:36:05,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4949 transitions. [2019-11-20 11:36:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-11-20 11:36:05,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:05,294 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:05,294 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:05,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:05,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1860937899, now seen corresponding path program 1 times [2019-11-20 11:36:05,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:05,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98681255] [2019-11-20 11:36:05,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-11-20 11:36:05,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98681255] [2019-11-20 11:36:05,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:05,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:05,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465666507] [2019-11-20 11:36:05,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:05,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:05,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:05,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:05,614 INFO L87 Difference]: Start difference. First operand 3308 states and 4949 transitions. Second operand 3 states. [2019-11-20 11:36:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:05,771 INFO L93 Difference]: Finished difference Result 6897 states and 10337 transitions. [2019-11-20 11:36:05,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:05,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 432 [2019-11-20 11:36:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:05,778 INFO L225 Difference]: With dead ends: 6897 [2019-11-20 11:36:05,779 INFO L226 Difference]: Without dead ends: 3608 [2019-11-20 11:36:05,782 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 11:36:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2019-11-20 11:36:05,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3608. [2019-11-20 11:36:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3608 states. [2019-11-20 11:36:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 5405 transitions. [2019-11-20 11:36:05,858 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 5405 transitions. Word has length 432 [2019-11-20 11:36:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:05,859 INFO L462 AbstractCegarLoop]: Abstraction has 3608 states and 5405 transitions. [2019-11-20 11:36:05,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 5405 transitions. [2019-11-20 11:36:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2019-11-20 11:36:05,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:05,866 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:05,866 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash 970429942, now seen corresponding path program 1 times [2019-11-20 11:36:05,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:05,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733809475] [2019-11-20 11:36:05,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-11-20 11:36:06,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733809475] [2019-11-20 11:36:06,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:06,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:06,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617349488] [2019-11-20 11:36:06,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:06,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:06,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:06,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:06,132 INFO L87 Difference]: Start difference. First operand 3608 states and 5405 transitions. Second operand 3 states. [2019-11-20 11:36:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:06,296 INFO L93 Difference]: Finished difference Result 7497 states and 11249 transitions. [2019-11-20 11:36:06,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:06,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 474 [2019-11-20 11:36:06,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:06,302 INFO L225 Difference]: With dead ends: 7497 [2019-11-20 11:36:06,302 INFO L226 Difference]: Without dead ends: 3908 [2019-11-20 11:36:06,306 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 11:36:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2019-11-20 11:36:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3908. [2019-11-20 11:36:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3908 states. [2019-11-20 11:36:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5862 transitions. [2019-11-20 11:36:06,390 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5862 transitions. Word has length 474 [2019-11-20 11:36:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:06,390 INFO L462 AbstractCegarLoop]: Abstraction has 3908 states and 5862 transitions. [2019-11-20 11:36:06,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5862 transitions. [2019-11-20 11:36:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2019-11-20 11:36:06,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:06,398 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 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, 1, 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 11:36:06,398 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:06,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:06,399 INFO L82 PathProgramCache]: Analyzing trace with hash 670606895, now seen corresponding path program 1 times [2019-11-20 11:36:06,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:06,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000379148] [2019-11-20 11:36:06,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1473 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2019-11-20 11:36:06,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000379148] [2019-11-20 11:36:06,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:06,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:06,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676485410] [2019-11-20 11:36:06,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:06,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:06,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:06,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:06,837 INFO L87 Difference]: Start difference. First operand 3908 states and 5862 transitions. Second operand 4 states. [2019-11-20 11:36:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:07,262 INFO L93 Difference]: Finished difference Result 9207 states and 13839 transitions. [2019-11-20 11:36:07,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:07,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 518 [2019-11-20 11:36:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:07,271 INFO L225 Difference]: With dead ends: 9207 [2019-11-20 11:36:07,271 INFO L226 Difference]: Without dead ends: 5318 [2019-11-20 11:36:07,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:36:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2019-11-20 11:36:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 4441. [2019-11-20 11:36:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4441 states. [2019-11-20 11:36:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4441 states to 4441 states and 6837 transitions. [2019-11-20 11:36:07,376 INFO L78 Accepts]: Start accepts. Automaton has 4441 states and 6837 transitions. Word has length 518 [2019-11-20 11:36:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:07,376 INFO L462 AbstractCegarLoop]: Abstraction has 4441 states and 6837 transitions. [2019-11-20 11:36:07,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4441 states and 6837 transitions. [2019-11-20 11:36:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2019-11-20 11:36:07,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:07,385 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 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, 1, 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 11:36:07,385 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:07,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash -186219349, now seen corresponding path program 1 times [2019-11-20 11:36:07,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:07,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918783916] [2019-11-20 11:36:07,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2019-11-20 11:36:07,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918783916] [2019-11-20 11:36:07,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:07,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:07,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814017405] [2019-11-20 11:36:07,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:07,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:07,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:07,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:07,771 INFO L87 Difference]: Start difference. First operand 4441 states and 6837 transitions. Second operand 3 states. [2019-11-20 11:36:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:07,904 INFO L93 Difference]: Finished difference Result 9199 states and 14181 transitions. [2019-11-20 11:36:07,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:07,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 518 [2019-11-20 11:36:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:07,909 INFO L225 Difference]: With dead ends: 9199 [2019-11-20 11:36:07,909 INFO L226 Difference]: Without dead ends: 4777 [2019-11-20 11:36:07,913 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 11:36:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2019-11-20 11:36:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4777. [2019-11-20 11:36:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4777 states. [2019-11-20 11:36:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 7348 transitions. [2019-11-20 11:36:08,016 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 7348 transitions. Word has length 518 [2019-11-20 11:36:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:08,017 INFO L462 AbstractCegarLoop]: Abstraction has 4777 states and 7348 transitions. [2019-11-20 11:36:08,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 7348 transitions. [2019-11-20 11:36:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-11-20 11:36:08,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:08,026 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:08,026 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1574505539, now seen corresponding path program 1 times [2019-11-20 11:36:08,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:08,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573513088] [2019-11-20 11:36:08,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2962 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 2528 trivial. 0 not checked. [2019-11-20 11:36:08,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573513088] [2019-11-20 11:36:08,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:08,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:08,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831332085] [2019-11-20 11:36:08,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:08,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:08,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:08,362 INFO L87 Difference]: Start difference. First operand 4777 states and 7348 transitions. Second operand 3 states. [2019-11-20 11:36:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:08,551 INFO L93 Difference]: Finished difference Result 9876 states and 15210 transitions. [2019-11-20 11:36:08,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:08,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 559 [2019-11-20 11:36:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:08,558 INFO L225 Difference]: With dead ends: 9876 [2019-11-20 11:36:08,558 INFO L226 Difference]: Without dead ends: 5118 [2019-11-20 11:36:08,563 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 11:36:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2019-11-20 11:36:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 5118. [2019-11-20 11:36:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5118 states. [2019-11-20 11:36:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 7882 transitions. [2019-11-20 11:36:08,644 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 7882 transitions. Word has length 559 [2019-11-20 11:36:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:08,645 INFO L462 AbstractCegarLoop]: Abstraction has 5118 states and 7882 transitions. [2019-11-20 11:36:08,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 7882 transitions. [2019-11-20 11:36:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2019-11-20 11:36:08,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:08,652 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:08,652 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:08,652 INFO L82 PathProgramCache]: Analyzing trace with hash 267934050, now seen corresponding path program 1 times [2019-11-20 11:36:08,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:08,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105697979] [2019-11-20 11:36:08,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2019-11-20 11:36:09,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105697979] [2019-11-20 11:36:09,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:09,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:36:09,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724792029] [2019-11-20 11:36:09,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:36:09,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:09,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:36:09,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:36:09,119 INFO L87 Difference]: Start difference. First operand 5118 states and 7882 transitions. Second operand 3 states. [2019-11-20 11:36:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:09,295 INFO L93 Difference]: Finished difference Result 5461 states and 8419 transitions. [2019-11-20 11:36:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:36:09,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 602 [2019-11-20 11:36:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:09,301 INFO L225 Difference]: With dead ends: 5461 [2019-11-20 11:36:09,301 INFO L226 Difference]: Without dead ends: 5459 [2019-11-20 11:36:09,303 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 11:36:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5459 states. [2019-11-20 11:36:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5459 to 5459. [2019-11-20 11:36:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5459 states. [2019-11-20 11:36:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5459 states to 5459 states and 8417 transitions. [2019-11-20 11:36:09,415 INFO L78 Accepts]: Start accepts. Automaton has 5459 states and 8417 transitions. Word has length 602 [2019-11-20 11:36:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:09,415 INFO L462 AbstractCegarLoop]: Abstraction has 5459 states and 8417 transitions. [2019-11-20 11:36:09,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:36:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5459 states and 8417 transitions. [2019-11-20 11:36:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-11-20 11:36:09,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:09,423 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:09,423 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:09,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:09,423 INFO L82 PathProgramCache]: Analyzing trace with hash -899423237, now seen corresponding path program 1 times [2019-11-20 11:36:09,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:09,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285760138] [2019-11-20 11:36:09,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 2676 proven. 480 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2019-11-20 11:36:11,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285760138] [2019-11-20 11:36:11,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142830815] [2019-11-20 11:36:11,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/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 11:36:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:11,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 11:36:11,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:36:12,072 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 11:36:12,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,106 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_164|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-20 11:36:12,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 11:36:12,162 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:12,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 11:36:12,229 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,301 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 11:36:12,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 11:36:12,302 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,322 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-20 11:36:12,373 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 11:36:12,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 11:36:12,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 11:36:12,434 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 11:36:12,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 11:36:12,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 11:36:12,462 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_167|]} [2019-11-20 11:36:12,466 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:36:12,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,531 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 11:36:12,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 11:36:12,533 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 11:36:12,601 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 11:36:12,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 11:36:12,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 11:36:12,657 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 11:36:12,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 11:36:12,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 11:36:12,690 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_170|]} [2019-11-20 11:36:12,693 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:36:12,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,793 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 11:36:12,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 11:36:12,794 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:12,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:12,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 11:36:12,824 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-11-20 11:36:12,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 11:36:12,829 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:36:12,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:13,002 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-20 11:36:13,003 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-20 11:36:13,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-20 11:36:13,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:36:13,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:36:13,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:36:13,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:36:13,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-20 11:36:13,173 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-11-20 11:36:13,174 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 4.6 percent of original size [2019-11-20 11:36:13,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:13,174 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-20 11:36:13,182 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-20 11:36:13,185 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:36:13,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:13,271 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 11:36:13,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 11:36:13,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:13,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:13,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:13,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 11:36:13,294 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-11-20 11:36:13,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 11:36:13,299 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:36:13,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:13,454 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-20 11:36:13,454 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-20 11:36:13,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-20 11:36:13,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:36:13,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:13,505 INFO L567 ElimStorePlain]: treesize reduction 156, result has 25.7 percent of original size [2019-11-20 11:36:13,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:13,505 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-20 11:36:13,509 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_163|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-11-20 11:36:13,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2019-11-20 11:36:13,514 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:36:13,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:13,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:13,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:13,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 34 [2019-11-20 11:36:13,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:13,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:13,592 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:36:13,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:13,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2019-11-20 11:36:13,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:13,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:13,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:13,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:13,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:13,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:13,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:13,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:36:13,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2019-11-20 11:36:13,640 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:36:13,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:13,649 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:36:13,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:13,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:36:13,665 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:32 [2019-11-20 11:36:13,768 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 11:36:13,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-20 11:36:13,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:36:13,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:36:13,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:36:13,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-20 11:36:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 1428 proven. 91 refuted. 0 times theorem prover too weak. 2427 trivial. 0 not checked. [2019-11-20 11:36:14,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:36:14,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-11-20 11:36:14,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699673979] [2019-11-20 11:36:14,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 11:36:14,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:14,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 11:36:14,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-11-20 11:36:14,636 INFO L87 Difference]: Start difference. First operand 5459 states and 8417 transitions. Second operand 15 states. [2019-11-20 11:36:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:22,962 INFO L93 Difference]: Finished difference Result 55461 states and 85314 transitions. [2019-11-20 11:36:22,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-20 11:36:22,962 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 647 [2019-11-20 11:36:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:23,036 INFO L225 Difference]: With dead ends: 55461 [2019-11-20 11:36:23,036 INFO L226 Difference]: Without dead ends: 50021 [2019-11-20 11:36:23,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 653 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 11:36:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50021 states. [2019-11-20 11:36:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50021 to 43061. [2019-11-20 11:36:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43061 states. [2019-11-20 11:36:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67205 transitions. [2019-11-20 11:36:24,237 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67205 transitions. Word has length 647 [2019-11-20 11:36:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:24,238 INFO L462 AbstractCegarLoop]: Abstraction has 43061 states and 67205 transitions. [2019-11-20 11:36:24,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 11:36:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67205 transitions. [2019-11-20 11:36:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2019-11-20 11:36:24,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:24,292 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:24,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:36:24,499 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1304808224, now seen corresponding path program 1 times [2019-11-20 11:36:24,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:24,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921778827] [2019-11-20 11:36:24,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4069 backedges. 1306 proven. 0 refuted. 0 times theorem prover too weak. 2763 trivial. 0 not checked. [2019-11-20 11:36:25,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921778827] [2019-11-20 11:36:25,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:25,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:25,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020205118] [2019-11-20 11:36:25,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:25,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:25,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:25,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:25,450 INFO L87 Difference]: Start difference. First operand 43061 states and 67205 transitions. Second operand 4 states. [2019-11-20 11:36:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:26,704 INFO L93 Difference]: Finished difference Result 81737 states and 127199 transitions. [2019-11-20 11:36:26,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:26,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 656 [2019-11-20 11:36:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:26,748 INFO L225 Difference]: With dead ends: 81737 [2019-11-20 11:36:26,748 INFO L226 Difference]: Without dead ends: 44325 [2019-11-20 11:36:26,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44325 states. [2019-11-20 11:36:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44325 to 43061. [2019-11-20 11:36:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43061 states. [2019-11-20 11:36:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67157 transitions. [2019-11-20 11:36:27,827 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67157 transitions. Word has length 656 [2019-11-20 11:36:27,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:27,828 INFO L462 AbstractCegarLoop]: Abstraction has 43061 states and 67157 transitions. [2019-11-20 11:36:27,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67157 transitions. [2019-11-20 11:36:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2019-11-20 11:36:27,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:27,867 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:27,867 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:27,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:27,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1785509443, now seen corresponding path program 1 times [2019-11-20 11:36:27,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:27,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184348848] [2019-11-20 11:36:27,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4087 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 2763 trivial. 0 not checked. [2019-11-20 11:36:28,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184348848] [2019-11-20 11:36:28,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:28,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:28,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607556282] [2019-11-20 11:36:28,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:28,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:28,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:28,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:28,573 INFO L87 Difference]: Start difference. First operand 43061 states and 67157 transitions. Second operand 4 states. [2019-11-20 11:36:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:29,752 INFO L93 Difference]: Finished difference Result 81737 states and 127119 transitions. [2019-11-20 11:36:29,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:29,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 657 [2019-11-20 11:36:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:29,789 INFO L225 Difference]: With dead ends: 81737 [2019-11-20 11:36:29,789 INFO L226 Difference]: Without dead ends: 44325 [2019-11-20 11:36:29,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44325 states. [2019-11-20 11:36:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44325 to 43061. [2019-11-20 11:36:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43061 states. [2019-11-20 11:36:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67109 transitions. [2019-11-20 11:36:30,940 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67109 transitions. Word has length 657 [2019-11-20 11:36:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:30,941 INFO L462 AbstractCegarLoop]: Abstraction has 43061 states and 67109 transitions. [2019-11-20 11:36:30,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67109 transitions. [2019-11-20 11:36:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2019-11-20 11:36:30,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:30,972 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:30,972 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:30,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1195800389, now seen corresponding path program 1 times [2019-11-20 11:36:30,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:30,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400184859] [2019-11-20 11:36:30,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4105 backedges. 1342 proven. 0 refuted. 0 times theorem prover too weak. 2763 trivial. 0 not checked. [2019-11-20 11:36:31,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400184859] [2019-11-20 11:36:31,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:31,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:31,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829611921] [2019-11-20 11:36:31,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:31,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:31,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:31,329 INFO L87 Difference]: Start difference. First operand 43061 states and 67109 transitions. Second operand 4 states. [2019-11-20 11:36:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:32,595 INFO L93 Difference]: Finished difference Result 81737 states and 127039 transitions. [2019-11-20 11:36:32,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:32,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 658 [2019-11-20 11:36:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:32,632 INFO L225 Difference]: With dead ends: 81737 [2019-11-20 11:36:32,632 INFO L226 Difference]: Without dead ends: 44325 [2019-11-20 11:36:32,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44325 states. [2019-11-20 11:36:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44325 to 43061. [2019-11-20 11:36:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43061 states. [2019-11-20 11:36:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67061 transitions. [2019-11-20 11:36:33,824 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67061 transitions. Word has length 658 [2019-11-20 11:36:33,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:33,824 INFO L462 AbstractCegarLoop]: Abstraction has 43061 states and 67061 transitions. [2019-11-20 11:36:33,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67061 transitions. [2019-11-20 11:36:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2019-11-20 11:36:33,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:33,855 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:33,855 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:33,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1805587320, now seen corresponding path program 1 times [2019-11-20 11:36:33,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:33,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631850732] [2019-11-20 11:36:33,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 1360 proven. 0 refuted. 0 times theorem prover too weak. 2763 trivial. 0 not checked. [2019-11-20 11:36:34,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631850732] [2019-11-20 11:36:34,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:34,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:34,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136906062] [2019-11-20 11:36:34,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:34,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:34,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:34,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:34,178 INFO L87 Difference]: Start difference. First operand 43061 states and 67061 transitions. Second operand 4 states. [2019-11-20 11:36:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:35,095 INFO L93 Difference]: Finished difference Result 81577 states and 126767 transitions. [2019-11-20 11:36:35,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:35,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 659 [2019-11-20 11:36:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:35,132 INFO L225 Difference]: With dead ends: 81577 [2019-11-20 11:36:35,132 INFO L226 Difference]: Without dead ends: 44165 [2019-11-20 11:36:35,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:35,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44165 states. [2019-11-20 11:36:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44165 to 43061. [2019-11-20 11:36:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43061 states. [2019-11-20 11:36:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67013 transitions. [2019-11-20 11:36:36,456 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67013 transitions. Word has length 659 [2019-11-20 11:36:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:36,456 INFO L462 AbstractCegarLoop]: Abstraction has 43061 states and 67013 transitions. [2019-11-20 11:36:36,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67013 transitions. [2019-11-20 11:36:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-11-20 11:36:36,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:36,487 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:36,487 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:36,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1505347909, now seen corresponding path program 1 times [2019-11-20 11:36:36,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:36,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605712378] [2019-11-20 11:36:36,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4069 backedges. 1610 proven. 0 refuted. 0 times theorem prover too weak. 2459 trivial. 0 not checked. [2019-11-20 11:36:36,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605712378] [2019-11-20 11:36:36,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:36,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:36:36,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870867644] [2019-11-20 11:36:36,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:36:36,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:36,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:36:36,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:36:36,994 INFO L87 Difference]: Start difference. First operand 43061 states and 67013 transitions. Second operand 5 states. [2019-11-20 11:36:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:38,560 INFO L93 Difference]: Finished difference Result 101277 states and 158140 transitions. [2019-11-20 11:36:38,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:38,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 662 [2019-11-20 11:36:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:38,612 INFO L225 Difference]: With dead ends: 101277 [2019-11-20 11:36:38,612 INFO L226 Difference]: Without dead ends: 58235 [2019-11-20 11:36:38,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:36:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58235 states. [2019-11-20 11:36:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58235 to 47253. [2019-11-20 11:36:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47253 states. [2019-11-20 11:36:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47253 states to 47253 states and 74773 transitions. [2019-11-20 11:36:40,117 INFO L78 Accepts]: Start accepts. Automaton has 47253 states and 74773 transitions. Word has length 662 [2019-11-20 11:36:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:40,118 INFO L462 AbstractCegarLoop]: Abstraction has 47253 states and 74773 transitions. [2019-11-20 11:36:40,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:36:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 47253 states and 74773 transitions. [2019-11-20 11:36:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-11-20 11:36:40,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:40,150 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:40,150 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:40,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:40,151 INFO L82 PathProgramCache]: Analyzing trace with hash -755305953, now seen corresponding path program 2 times [2019-11-20 11:36:40,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:40,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206210158] [2019-11-20 11:36:40,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4069 backedges. 1024 proven. 0 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2019-11-20 11:36:40,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206210158] [2019-11-20 11:36:40,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:40,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 11:36:40,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873538651] [2019-11-20 11:36:40,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:36:40,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:40,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:36:40,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:36:40,543 INFO L87 Difference]: Start difference. First operand 47253 states and 74773 transitions. Second operand 6 states. [2019-11-20 11:36:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:43,456 INFO L93 Difference]: Finished difference Result 118579 states and 185491 transitions. [2019-11-20 11:36:43,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:36:43,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 662 [2019-11-20 11:36:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:43,518 INFO L225 Difference]: With dead ends: 118579 [2019-11-20 11:36:43,518 INFO L226 Difference]: Without dead ends: 71345 [2019-11-20 11:36:43,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:36:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71345 states. [2019-11-20 11:36:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71345 to 50997. [2019-11-20 11:36:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50997 states. [2019-11-20 11:36:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50997 states to 50997 states and 80565 transitions. [2019-11-20 11:36:44,588 INFO L78 Accepts]: Start accepts. Automaton has 50997 states and 80565 transitions. Word has length 662 [2019-11-20 11:36:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:44,588 INFO L462 AbstractCegarLoop]: Abstraction has 50997 states and 80565 transitions. [2019-11-20 11:36:44,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:36:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 50997 states and 80565 transitions. [2019-11-20 11:36:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-11-20 11:36:44,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:44,625 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:44,625 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:44,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:44,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1983545129, now seen corresponding path program 1 times [2019-11-20 11:36:44,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:44,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370883526] [2019-11-20 11:36:44,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4081 backedges. 1622 proven. 0 refuted. 0 times theorem prover too weak. 2459 trivial. 0 not checked. [2019-11-20 11:36:45,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370883526] [2019-11-20 11:36:45,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:45,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:36:45,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064198825] [2019-11-20 11:36:45,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:36:45,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:36:45,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:36:45,170 INFO L87 Difference]: Start difference. First operand 50997 states and 80565 transitions. Second operand 5 states. [2019-11-20 11:36:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:47,444 INFO L93 Difference]: Finished difference Result 111805 states and 175273 transitions. [2019-11-20 11:36:47,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:47,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 663 [2019-11-20 11:36:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:47,503 INFO L225 Difference]: With dead ends: 111805 [2019-11-20 11:36:47,503 INFO L226 Difference]: Without dead ends: 60827 [2019-11-20 11:36:47,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:36:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60827 states. [2019-11-20 11:36:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60827 to 51173. [2019-11-20 11:36:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:36:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 80485 transitions. [2019-11-20 11:36:48,559 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 80485 transitions. Word has length 663 [2019-11-20 11:36:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:48,559 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 80485 transitions. [2019-11-20 11:36:48,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:36:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 80485 transitions. [2019-11-20 11:36:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2019-11-20 11:36:48,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:48,595 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:48,595 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:48,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:48,595 INFO L82 PathProgramCache]: Analyzing trace with hash 333227753, now seen corresponding path program 1 times [2019-11-20 11:36:48,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:48,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581895272] [2019-11-20 11:36:48,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4101 backedges. 846 proven. 0 refuted. 0 times theorem prover too weak. 3255 trivial. 0 not checked. [2019-11-20 11:36:48,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581895272] [2019-11-20 11:36:48,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:48,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:48,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79673192] [2019-11-20 11:36:48,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:48,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:48,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:48,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:48,933 INFO L87 Difference]: Start difference. First operand 51173 states and 80485 transitions. Second operand 4 states. [2019-11-20 11:36:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:52,378 INFO L93 Difference]: Finished difference Result 104895 states and 163748 transitions. [2019-11-20 11:36:52,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:52,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 664 [2019-11-20 11:36:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:52,426 INFO L225 Difference]: With dead ends: 104895 [2019-11-20 11:36:52,427 INFO L226 Difference]: Without dead ends: 60155 [2019-11-20 11:36:52,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:52,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60155 states. [2019-11-20 11:36:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60155 to 51173. [2019-11-20 11:36:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:36:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 80341 transitions. [2019-11-20 11:36:53,460 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 80341 transitions. Word has length 664 [2019-11-20 11:36:53,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:53,460 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 80341 transitions. [2019-11-20 11:36:53,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 80341 transitions. [2019-11-20 11:36:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2019-11-20 11:36:53,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:53,495 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:53,495 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:53,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1807211375, now seen corresponding path program 1 times [2019-11-20 11:36:53,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:53,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25729667] [2019-11-20 11:36:53,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4119 backedges. 864 proven. 0 refuted. 0 times theorem prover too weak. 3255 trivial. 0 not checked. [2019-11-20 11:36:53,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25729667] [2019-11-20 11:36:53,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:53,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:53,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448010177] [2019-11-20 11:36:53,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:53,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:53,811 INFO L87 Difference]: Start difference. First operand 51173 states and 80341 transitions. Second operand 4 states. [2019-11-20 11:36:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:55,319 INFO L93 Difference]: Finished difference Result 104895 states and 163476 transitions. [2019-11-20 11:36:55,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:55,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 665 [2019-11-20 11:36:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:55,376 INFO L225 Difference]: With dead ends: 104895 [2019-11-20 11:36:55,376 INFO L226 Difference]: Without dead ends: 60155 [2019-11-20 11:36:55,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:55,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60155 states. [2019-11-20 11:36:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60155 to 51173. [2019-11-20 11:36:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:36:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 80197 transitions. [2019-11-20 11:36:56,787 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 80197 transitions. Word has length 665 [2019-11-20 11:36:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:56,787 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 80197 transitions. [2019-11-20 11:36:56,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 80197 transitions. [2019-11-20 11:36:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-11-20 11:36:56,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:36:56,824 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:56,825 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:36:56,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:36:56,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2094469060, now seen corresponding path program 1 times [2019-11-20 11:36:56,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:36:56,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682760422] [2019-11-20 11:36:56,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:36:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:36:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4137 backedges. 882 proven. 0 refuted. 0 times theorem prover too weak. 3255 trivial. 0 not checked. [2019-11-20 11:36:57,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682760422] [2019-11-20 11:36:57,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:36:57,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:36:57,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543234770] [2019-11-20 11:36:57,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:36:57,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:36:57,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:36:57,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:36:57,204 INFO L87 Difference]: Start difference. First operand 51173 states and 80197 transitions. Second operand 4 states. [2019-11-20 11:36:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:36:58,738 INFO L93 Difference]: Finished difference Result 104575 states and 162820 transitions. [2019-11-20 11:36:58,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:36:58,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 666 [2019-11-20 11:36:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:36:58,793 INFO L225 Difference]: With dead ends: 104575 [2019-11-20 11:36:58,793 INFO L226 Difference]: Without dead ends: 59835 [2019-11-20 11:36:58,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:36:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59835 states. [2019-11-20 11:36:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59835 to 51173. [2019-11-20 11:36:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:36:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 80053 transitions. [2019-11-20 11:36:59,971 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 80053 transitions. Word has length 666 [2019-11-20 11:36:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:36:59,972 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 80053 transitions. [2019-11-20 11:36:59,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:36:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 80053 transitions. [2019-11-20 11:37:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-11-20 11:37:00,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:00,026 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:00,026 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:00,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:00,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1181196976, now seen corresponding path program 1 times [2019-11-20 11:37:00,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:00,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636673625] [2019-11-20 11:37:00,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4285 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 3360 trivial. 0 not checked. [2019-11-20 11:37:00,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636673625] [2019-11-20 11:37:00,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:00,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:00,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046427406] [2019-11-20 11:37:00,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:00,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:00,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:00,792 INFO L87 Difference]: Start difference. First operand 51173 states and 80053 transitions. Second operand 4 states. [2019-11-20 11:37:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:02,465 INFO L93 Difference]: Finished difference Result 110989 states and 172606 transitions. [2019-11-20 11:37:02,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:02,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 676 [2019-11-20 11:37:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:02,521 INFO L225 Difference]: With dead ends: 110989 [2019-11-20 11:37:02,521 INFO L226 Difference]: Without dead ends: 59835 [2019-11-20 11:37:02,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:37:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59835 states. [2019-11-20 11:37:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59835 to 51173. [2019-11-20 11:37:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:37:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79909 transitions. [2019-11-20 11:37:03,631 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79909 transitions. Word has length 676 [2019-11-20 11:37:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:03,632 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79909 transitions. [2019-11-20 11:37:03,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79909 transitions. [2019-11-20 11:37:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-11-20 11:37:03,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:03,667 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:03,667 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:03,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:03,668 INFO L82 PathProgramCache]: Analyzing trace with hash 309287547, now seen corresponding path program 1 times [2019-11-20 11:37:03,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:03,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342851807] [2019-11-20 11:37:03,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4303 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 3360 trivial. 0 not checked. [2019-11-20 11:37:03,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342851807] [2019-11-20 11:37:03,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:03,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:03,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189964818] [2019-11-20 11:37:03,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:03,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:03,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:03,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:03,968 INFO L87 Difference]: Start difference. First operand 51173 states and 79909 transitions. Second operand 4 states. [2019-11-20 11:37:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:05,791 INFO L93 Difference]: Finished difference Result 110765 states and 172094 transitions. [2019-11-20 11:37:05,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:05,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 677 [2019-11-20 11:37:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:05,840 INFO L225 Difference]: With dead ends: 110765 [2019-11-20 11:37:05,840 INFO L226 Difference]: Without dead ends: 59611 [2019-11-20 11:37:05,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:37:05,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59611 states. [2019-11-20 11:37:06,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59611 to 51173. [2019-11-20 11:37:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:37:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79765 transitions. [2019-11-20 11:37:06,943 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79765 transitions. Word has length 677 [2019-11-20 11:37:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:06,943 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79765 transitions. [2019-11-20 11:37:06,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79765 transitions. [2019-11-20 11:37:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-11-20 11:37:06,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:06,979 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:06,980 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:06,980 INFO L82 PathProgramCache]: Analyzing trace with hash 901344059, now seen corresponding path program 1 times [2019-11-20 11:37:06,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:06,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69001523] [2019-11-20 11:37:06,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4321 backedges. 1030 proven. 0 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2019-11-20 11:37:07,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69001523] [2019-11-20 11:37:07,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:07,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:07,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213295614] [2019-11-20 11:37:07,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:07,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:07,296 INFO L87 Difference]: Start difference. First operand 51173 states and 79765 transitions. Second operand 4 states. [2019-11-20 11:37:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:09,013 INFO L93 Difference]: Finished difference Result 102735 states and 158356 transitions. [2019-11-20 11:37:09,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:09,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 677 [2019-11-20 11:37:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:09,067 INFO L225 Difference]: With dead ends: 102735 [2019-11-20 11:37:09,067 INFO L226 Difference]: Without dead ends: 57995 [2019-11-20 11:37:09,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:37:09,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57995 states. [2019-11-20 11:37:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57995 to 51173. [2019-11-20 11:37:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:37:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79621 transitions. [2019-11-20 11:37:10,522 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79621 transitions. Word has length 677 [2019-11-20 11:37:10,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:10,522 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79621 transitions. [2019-11-20 11:37:10,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79621 transitions. [2019-11-20 11:37:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2019-11-20 11:37:10,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:10,558 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:10,558 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:10,559 INFO L82 PathProgramCache]: Analyzing trace with hash 400542018, now seen corresponding path program 1 times [2019-11-20 11:37:10,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:10,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787013903] [2019-11-20 11:37:10,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 1049 proven. 0 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2019-11-20 11:37:10,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787013903] [2019-11-20 11:37:10,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:10,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:10,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914891901] [2019-11-20 11:37:10,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:10,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:10,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:10,850 INFO L87 Difference]: Start difference. First operand 51173 states and 79621 transitions. Second operand 4 states. [2019-11-20 11:37:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:12,493 INFO L93 Difference]: Finished difference Result 102735 states and 158084 transitions. [2019-11-20 11:37:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:12,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 678 [2019-11-20 11:37:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:12,545 INFO L225 Difference]: With dead ends: 102735 [2019-11-20 11:37:12,545 INFO L226 Difference]: Without dead ends: 57995 [2019-11-20 11:37:12,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:37:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57995 states. [2019-11-20 11:37:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57995 to 51173. [2019-11-20 11:37:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:37:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79477 transitions. [2019-11-20 11:37:13,699 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79477 transitions. Word has length 678 [2019-11-20 11:37:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:13,699 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79477 transitions. [2019-11-20 11:37:13,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79477 transitions. [2019-11-20 11:37:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2019-11-20 11:37:13,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:13,735 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:13,735 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash -401013706, now seen corresponding path program 1 times [2019-11-20 11:37:13,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:13,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068186769] [2019-11-20 11:37:13,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4359 backedges. 1068 proven. 0 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2019-11-20 11:37:14,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068186769] [2019-11-20 11:37:14,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:14,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:14,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694371565] [2019-11-20 11:37:14,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:14,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:14,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:14,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:14,232 INFO L87 Difference]: Start difference. First operand 51173 states and 79477 transitions. Second operand 4 states. [2019-11-20 11:37:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:15,876 INFO L93 Difference]: Finished difference Result 102735 states and 157812 transitions. [2019-11-20 11:37:15,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:15,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 679 [2019-11-20 11:37:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:15,928 INFO L225 Difference]: With dead ends: 102735 [2019-11-20 11:37:15,928 INFO L226 Difference]: Without dead ends: 57995 [2019-11-20 11:37:15,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:37:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57995 states. [2019-11-20 11:37:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57995 to 51173. [2019-11-20 11:37:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:37:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79333 transitions. [2019-11-20 11:37:17,110 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79333 transitions. Word has length 679 [2019-11-20 11:37:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:17,110 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79333 transitions. [2019-11-20 11:37:17,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79333 transitions. [2019-11-20 11:37:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2019-11-20 11:37:17,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:17,146 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:17,146 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:17,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1935999011, now seen corresponding path program 1 times [2019-11-20 11:37:17,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:17,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176913122] [2019-11-20 11:37:17,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4378 backedges. 1087 proven. 0 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2019-11-20 11:37:17,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176913122] [2019-11-20 11:37:17,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:17,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:17,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155650932] [2019-11-20 11:37:17,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:17,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:17,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:17,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:17,500 INFO L87 Difference]: Start difference. First operand 51173 states and 79333 transitions. Second operand 4 states. [2019-11-20 11:37:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:19,483 INFO L93 Difference]: Finished difference Result 102415 states and 157156 transitions. [2019-11-20 11:37:19,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:19,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 680 [2019-11-20 11:37:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:19,529 INFO L225 Difference]: With dead ends: 102415 [2019-11-20 11:37:19,530 INFO L226 Difference]: Without dead ends: 57675 [2019-11-20 11:37:19,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:37:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57675 states. [2019-11-20 11:37:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57675 to 51173. [2019-11-20 11:37:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:37:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79189 transitions. [2019-11-20 11:37:20,685 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79189 transitions. Word has length 680 [2019-11-20 11:37:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:20,686 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79189 transitions. [2019-11-20 11:37:20,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79189 transitions. [2019-11-20 11:37:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-11-20 11:37:20,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:20,722 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:20,722 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:20,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash -141517246, now seen corresponding path program 1 times [2019-11-20 11:37:20,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:20,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173251329] [2019-11-20 11:37:20,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4492 backedges. 882 proven. 0 refuted. 0 times theorem prover too weak. 3610 trivial. 0 not checked. [2019-11-20 11:37:21,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173251329] [2019-11-20 11:37:21,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:21,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:21,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637526526] [2019-11-20 11:37:21,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:21,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:21,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:21,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:21,133 INFO L87 Difference]: Start difference. First operand 51173 states and 79189 transitions. Second operand 4 states. [2019-11-20 11:37:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:22,738 INFO L93 Difference]: Finished difference Result 107703 states and 165656 transitions. [2019-11-20 11:37:22,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:22,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 689 [2019-11-20 11:37:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:22,789 INFO L225 Difference]: With dead ends: 107703 [2019-11-20 11:37:22,789 INFO L226 Difference]: Without dead ends: 56549 [2019-11-20 11:37:22,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:37:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56549 states. [2019-11-20 11:37:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56549 to 51173. [2019-11-20 11:37:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:37:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79045 transitions. [2019-11-20 11:37:24,311 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79045 transitions. Word has length 689 [2019-11-20 11:37:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:24,312 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79045 transitions. [2019-11-20 11:37:24,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79045 transitions. [2019-11-20 11:37:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-11-20 11:37:24,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:24,348 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:24,348 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash 122925779, now seen corresponding path program 1 times [2019-11-20 11:37:24,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:24,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351173960] [2019-11-20 11:37:24,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4505 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 3610 trivial. 0 not checked. [2019-11-20 11:37:24,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351173960] [2019-11-20 11:37:24,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:24,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:24,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882388220] [2019-11-20 11:37:24,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:24,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:24,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:24,751 INFO L87 Difference]: Start difference. First operand 51173 states and 79045 transitions. Second operand 4 states. [2019-11-20 11:37:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:26,385 INFO L93 Difference]: Finished difference Result 107479 states and 165144 transitions. [2019-11-20 11:37:26,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:26,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2019-11-20 11:37:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:26,435 INFO L225 Difference]: With dead ends: 107479 [2019-11-20 11:37:26,435 INFO L226 Difference]: Without dead ends: 56325 [2019-11-20 11:37:26,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:37:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56325 states. [2019-11-20 11:37:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56325 to 51173. [2019-11-20 11:37:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:37:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 78901 transitions. [2019-11-20 11:37:27,648 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 78901 transitions. Word has length 690 [2019-11-20 11:37:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:27,648 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 78901 transitions. [2019-11-20 11:37:27,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 78901 transitions. [2019-11-20 11:37:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-11-20 11:37:27,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:27,686 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:27,687 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1251979088, now seen corresponding path program 1 times [2019-11-20 11:37:27,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:27,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083504455] [2019-11-20 11:37:27,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 905 proven. 0 refuted. 0 times theorem prover too weak. 3594 trivial. 0 not checked. [2019-11-20 11:37:28,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083504455] [2019-11-20 11:37:28,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:28,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:28,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965520385] [2019-11-20 11:37:28,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:28,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:28,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:28,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:28,370 INFO L87 Difference]: Start difference. First operand 51173 states and 78901 transitions. Second operand 4 states. [2019-11-20 11:37:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:29,992 INFO L93 Difference]: Finished difference Result 107047 states and 164280 transitions. [2019-11-20 11:37:29,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:29,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2019-11-20 11:37:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:30,042 INFO L225 Difference]: With dead ends: 107047 [2019-11-20 11:37:30,042 INFO L226 Difference]: Without dead ends: 55893 [2019-11-20 11:37:30,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 11:37:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55893 states. [2019-11-20 11:37:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55893 to 51173. [2019-11-20 11:37:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:37:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 78757 transitions. [2019-11-20 11:37:31,258 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 78757 transitions. Word has length 690 [2019-11-20 11:37:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:31,258 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 78757 transitions. [2019-11-20 11:37:31,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 78757 transitions. [2019-11-20 11:37:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-11-20 11:37:31,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:31,293 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:31,293 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash 595968553, now seen corresponding path program 1 times [2019-11-20 11:37:31,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:31,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918742237] [2019-11-20 11:37:31,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4534 backedges. 1138 proven. 0 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2019-11-20 11:37:31,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918742237] [2019-11-20 11:37:31,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:31,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:31,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149143726] [2019-11-20 11:37:31,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:31,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:31,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:31,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:31,569 INFO L87 Difference]: Start difference. First operand 51173 states and 78757 transitions. Second operand 4 states. [2019-11-20 11:37:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:33,586 INFO L93 Difference]: Finished difference Result 108829 states and 165982 transitions. [2019-11-20 11:37:33,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:33,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2019-11-20 11:37:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:33,627 INFO L225 Difference]: With dead ends: 108829 [2019-11-20 11:37:33,627 INFO L226 Difference]: Without dead ends: 57675 [2019-11-20 11:37:33,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:37:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57675 states. [2019-11-20 11:37:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57675 to 51173. [2019-11-20 11:37:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-11-20 11:37:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 78613 transitions. [2019-11-20 11:37:34,777 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 78613 transitions. Word has length 690 [2019-11-20 11:37:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:34,778 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 78613 transitions. [2019-11-20 11:37:34,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 78613 transitions. [2019-11-20 11:37:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-11-20 11:37:34,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:34,809 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 16, 16, 16, 15, 14, 14, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:34,809 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:34,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:34,809 INFO L82 PathProgramCache]: Analyzing trace with hash -48582669, now seen corresponding path program 1 times [2019-11-20 11:37:34,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:34,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418460017] [2019-11-20 11:37:34,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4507 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2019-11-20 11:37:35,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418460017] [2019-11-20 11:37:35,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:35,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:35,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485816608] [2019-11-20 11:37:35,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:35,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:35,164 INFO L87 Difference]: Start difference. First operand 51173 states and 78613 transitions. Second operand 4 states. [2019-11-20 11:37:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:36,577 INFO L93 Difference]: Finished difference Result 104455 states and 160099 transitions. [2019-11-20 11:37:36,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:36,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2019-11-20 11:37:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:36,621 INFO L225 Difference]: With dead ends: 104455 [2019-11-20 11:37:36,621 INFO L226 Difference]: Without dead ends: 53301 [2019-11-20 11:37:36,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:37:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53301 states. [2019-11-20 11:37:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53301 to 51157. [2019-11-20 11:37:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51157 states. [2019-11-20 11:37:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51157 states to 51157 states and 78453 transitions. [2019-11-20 11:37:38,097 INFO L78 Accepts]: Start accepts. Automaton has 51157 states and 78453 transitions. Word has length 690 [2019-11-20 11:37:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:38,098 INFO L462 AbstractCegarLoop]: Abstraction has 51157 states and 78453 transitions. [2019-11-20 11:37:38,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 51157 states and 78453 transitions. [2019-11-20 11:37:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-11-20 11:37:38,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:38,130 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:38,131 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash -433155902, now seen corresponding path program 1 times [2019-11-20 11:37:38,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:38,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191798308] [2019-11-20 11:37:38,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4553 backedges. 1157 proven. 0 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2019-11-20 11:37:38,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191798308] [2019-11-20 11:37:38,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:38,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:37:38,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012295103] [2019-11-20 11:37:38,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:38,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:37:38,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:38,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:38,424 INFO L87 Difference]: Start difference. First operand 51157 states and 78453 transitions. Second operand 4 states. [2019-11-20 11:37:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:40,213 INFO L93 Difference]: Finished difference Result 108573 states and 165150 transitions. [2019-11-20 11:37:40,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:40,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 691 [2019-11-20 11:37:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:40,263 INFO L225 Difference]: With dead ends: 108573 [2019-11-20 11:37:40,263 INFO L226 Difference]: Without dead ends: 57435 [2019-11-20 11:37:40,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:37:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57435 states. [2019-11-20 11:37:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57435 to 51157. [2019-11-20 11:37:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51157 states. [2019-11-20 11:37:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51157 states to 51157 states and 78309 transitions. [2019-11-20 11:37:41,484 INFO L78 Accepts]: Start accepts. Automaton has 51157 states and 78309 transitions. Word has length 691 [2019-11-20 11:37:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:41,485 INFO L462 AbstractCegarLoop]: Abstraction has 51157 states and 78309 transitions. [2019-11-20 11:37:41,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 51157 states and 78309 transitions. [2019-11-20 11:37:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-11-20 11:37:41,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:41,519 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:41,519 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:41,520 INFO L82 PathProgramCache]: Analyzing trace with hash 984903532, now seen corresponding path program 1 times [2019-11-20 11:37:41,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:37:41,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359164277] [2019-11-20 11:37:41,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:37:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4518 backedges. 2550 proven. 164 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2019-11-20 11:37:42,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359164277] [2019-11-20 11:37:42,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147353014] [2019-11-20 11:37:42,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/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 11:37:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:42,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 2219 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 11:37:42,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:37:42,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-20 11:37:42,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:37:42,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:37:42,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:37:42,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-20 11:37:42,829 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.offset_161|], 5=[|v_#memory_int_179|]} [2019-11-20 11:37:42,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-11-20 11:37:42,832 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:37:42,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:37:42,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2019-11-20 11:37:42,838 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:37:42,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:37:42,880 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:37:42,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-20 11:37:42,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:37:42,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:37:42,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:37:42,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:37:42,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:37:42,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:37:43,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:37:43,092 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 11:37:43,095 INFO L168 Benchmark]: Toolchain (without parser) took 128975.66 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 946.1 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 910.8 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:43,095 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:37:43,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:43,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:43,096 INFO L168 Benchmark]: Boogie Preprocessor took 127.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:43,096 INFO L168 Benchmark]: RCFGBuilder took 1461.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:43,096 INFO L168 Benchmark]: TraceAbstraction took 126558.79 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 828.0 MB. Max. memory is 11.5 GB. [2019-11-20 11:37:43,098 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 737.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1461.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 126558.79 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 828.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 11:37:45,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:37:45,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:37:45,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:37:45,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:37:45,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:37:45,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:37:45,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:37:45,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:37:45,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:37:45,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:37:45,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:37:45,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:37:45,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:37:45,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:37:45,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:37:45,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:37:45,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:37:45,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:37:45,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:37:45,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:37:45,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:37:45,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:37:45,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:37:45,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:37:45,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:37:45,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:37:45,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:37:45,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:37:45,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:37:45,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:37:45,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:37:45,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:37:45,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:37:45,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:37:45,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:37:45,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:37:45,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:37:45,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:37:45,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:37:45,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:37:45,176 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 11:37:45,190 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:37:45,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:37:45,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:37:45,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:37:45,191 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:37:45,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:37:45,191 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:37:45,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:37:45,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:37:45,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:37:45,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:37:45,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:37:45,192 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 11:37:45,193 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 11:37:45,193 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:37:45,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:37:45,193 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:37:45,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:37:45,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:37:45,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:37:45,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:37:45,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:37:45,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:37:45,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:37:45,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:37:45,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:37:45,195 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 11:37:45,195 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 11:37:45,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:37:45,195 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:37:45,195 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_dde2fd0e-9065-4651-8770-18d4b1ce276b/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 -> 3120445556e880fbad518fab0e301c4c6b39e1cb [2019-11-20 11:37:45,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:37:45,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:37:45,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:37:45,511 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:37:45,511 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:37:45,512 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c [2019-11-20 11:37:45,569 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/data/4f446edd2/ccf81e7bfc40498f8dc4ea2511f659f8/FLAG87d5a9540 [2019-11-20 11:37:46,068 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:37:46,068 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c [2019-11-20 11:37:46,087 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/data/4f446edd2/ccf81e7bfc40498f8dc4ea2511f659f8/FLAG87d5a9540 [2019-11-20 11:37:46,333 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/data/4f446edd2/ccf81e7bfc40498f8dc4ea2511f659f8 [2019-11-20 11:37:46,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:37:46,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:37:46,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:37:46,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:37:46,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:37:46,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:37:46" (1/1) ... [2019-11-20 11:37:46,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739e5390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:46, skipping insertion in model container [2019-11-20 11:37:46,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:37:46" (1/1) ... [2019-11-20 11:37:46,346 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:37:46,422 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:37:46,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:37:46,948 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:37:47,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:37:47,112 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:37:47,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47 WrapperNode [2019-11-20 11:37:47,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:37:47,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:37:47,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:37:47,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:37:47,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (1/1) ... [2019-11-20 11:37:47,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (1/1) ... [2019-11-20 11:37:47,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:37:47,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:37:47,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:37:47,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:37:47,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (1/1) ... [2019-11-20 11:37:47,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (1/1) ... [2019-11-20 11:37:47,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (1/1) ... [2019-11-20 11:37:47,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (1/1) ... [2019-11-20 11:37:47,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (1/1) ... [2019-11-20 11:37:47,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (1/1) ... [2019-11-20 11:37:47,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (1/1) ... [2019-11-20 11:37:47,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:37:47,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:37:47,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:37:47,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:37:47,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/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 11:37:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:37:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:37:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 11:37:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:37:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 11:37:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:37:47,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:37:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 11:37:47,618 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 11:37:49,984 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 11:37:49,984 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 11:37:49,986 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:37:49,987 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 11:37:49,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:37:49 BoogieIcfgContainer [2019-11-20 11:37:49,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:37:49,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:37:49,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:37:49,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:37:49,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:37:46" (1/3) ... [2019-11-20 11:37:49,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b024502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:37:49, skipping insertion in model container [2019-11-20 11:37:49,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:37:47" (2/3) ... [2019-11-20 11:37:49,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b024502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:37:49, skipping insertion in model container [2019-11-20 11:37:49,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:37:49" (3/3) ... [2019-11-20 11:37:49,998 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-2.c [2019-11-20 11:37:50,007 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:37:50,014 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 11:37:50,025 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 11:37:50,055 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:37:50,056 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:37:50,056 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:37:50,056 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:37:50,056 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:37:50,057 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:37:50,057 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:37:50,057 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:37:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-11-20 11:37:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 11:37:50,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:50,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:50,095 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:50,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1128889191, now seen corresponding path program 1 times [2019-11-20 11:37:50,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:37:50,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1493455309] [2019-11-20 11:37:50,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:50,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:37:50,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:37:50,390 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 11:37:50,398 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:37:50,434 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 11:37:50,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1493455309] [2019-11-20 11:37:50,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:50,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:37:50,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341682227] [2019-11-20 11:37:50,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:50,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:37:50,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:50,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:50,459 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-11-20 11:37:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:50,819 INFO L93 Difference]: Finished difference Result 596 states and 1029 transitions. [2019-11-20 11:37:50,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:50,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-20 11:37:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:50,848 INFO L225 Difference]: With dead ends: 596 [2019-11-20 11:37:50,851 INFO L226 Difference]: Without dead ends: 408 [2019-11-20 11:37:50,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-20 11:37:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-11-20 11:37:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 11:37:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 626 transitions. [2019-11-20 11:37:50,945 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 626 transitions. Word has length 44 [2019-11-20 11:37:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:50,946 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 626 transitions. [2019-11-20 11:37:50,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 626 transitions. [2019-11-20 11:37:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 11:37:50,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:50,953 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:37:51,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:51,155 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:51,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash -777117834, now seen corresponding path program 1 times [2019-11-20 11:37:51,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:37:51,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [904171047] [2019-11-20 11:37:51,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:51,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:37:51,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:37:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:37:51,430 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:37:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:37:51,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [904171047] [2019-11-20 11:37:51,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:51,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:37:51,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871597560] [2019-11-20 11:37:51,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:51,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:37:51,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:51,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:51,465 INFO L87 Difference]: Start difference. First operand 408 states and 626 transitions. Second operand 4 states. [2019-11-20 11:37:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:52,014 INFO L93 Difference]: Finished difference Result 937 states and 1464 transitions. [2019-11-20 11:37:52,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:52,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-20 11:37:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:52,020 INFO L225 Difference]: With dead ends: 937 [2019-11-20 11:37:52,020 INFO L226 Difference]: Without dead ends: 670 [2019-11-20 11:37:52,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-20 11:37:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-11-20 11:37:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-20 11:37:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1022 transitions. [2019-11-20 11:37:52,077 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1022 transitions. Word has length 106 [2019-11-20 11:37:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:52,080 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1022 transitions. [2019-11-20 11:37:52,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1022 transitions. [2019-11-20 11:37:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 11:37:52,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:52,093 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:52,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:52,295 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:52,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:52,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1045575103, now seen corresponding path program 1 times [2019-11-20 11:37:52,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:37:52,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1035825636] [2019-11-20 11:37:52,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:52,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:37:52,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:37:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 11:37:52,613 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:37:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 11:37:52,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1035825636] [2019-11-20 11:37:52,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:52,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:37:52,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287176153] [2019-11-20 11:37:52,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:52,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:37:52,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:52,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:52,656 INFO L87 Difference]: Start difference. First operand 670 states and 1022 transitions. Second operand 4 states. [2019-11-20 11:37:54,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:54,044 INFO L93 Difference]: Finished difference Result 1464 states and 2259 transitions. [2019-11-20 11:37:54,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:54,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-20 11:37:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:54,050 INFO L225 Difference]: With dead ends: 1464 [2019-11-20 11:37:54,050 INFO L226 Difference]: Without dead ends: 935 [2019-11-20 11:37:54,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-11-20 11:37:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2019-11-20 11:37:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-11-20 11:37:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1421 transitions. [2019-11-20 11:37:54,091 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1421 transitions. Word has length 171 [2019-11-20 11:37:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:54,093 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1421 transitions. [2019-11-20 11:37:54,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1421 transitions. [2019-11-20 11:37:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-20 11:37:54,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:54,098 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 11:37:54,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:54,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:54,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:54,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1159127703, now seen corresponding path program 1 times [2019-11-20 11:37:54,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:37:54,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [914537649] [2019-11-20 11:37:54,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:54,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:37:54,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:37:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-20 11:37:54,684 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:37:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-20 11:37:54,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [914537649] [2019-11-20 11:37:54,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:54,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:37:54,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477937441] [2019-11-20 11:37:54,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:54,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:37:54,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:54,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:54,802 INFO L87 Difference]: Start difference. First operand 935 states and 1421 transitions. Second operand 4 states. [2019-11-20 11:37:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:55,275 INFO L93 Difference]: Finished difference Result 1992 states and 3052 transitions. [2019-11-20 11:37:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:55,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-11-20 11:37:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:55,283 INFO L225 Difference]: With dead ends: 1992 [2019-11-20 11:37:55,284 INFO L226 Difference]: Without dead ends: 1198 [2019-11-20 11:37:55,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2019-11-20 11:37:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2019-11-20 11:37:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-11-20 11:37:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1815 transitions. [2019-11-20 11:37:55,330 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1815 transitions. Word has length 236 [2019-11-20 11:37:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:55,331 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1815 transitions. [2019-11-20 11:37:55,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1815 transitions. [2019-11-20 11:37:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-11-20 11:37:55,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:55,338 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2019-11-20 11:37:55,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:55,540 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:55,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:55,541 INFO L82 PathProgramCache]: Analyzing trace with hash -822359279, now seen corresponding path program 1 times [2019-11-20 11:37:55,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:37:55,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1285161607] [2019-11-20 11:37:55,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:55,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:37:55,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:37:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-20 11:37:56,002 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:37:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-20 11:37:56,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1285161607] [2019-11-20 11:37:56,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:56,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:37:56,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387481925] [2019-11-20 11:37:56,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:56,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:37:56,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:56,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:56,085 INFO L87 Difference]: Start difference. First operand 1198 states and 1815 transitions. Second operand 4 states. [2019-11-20 11:37:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:56,848 INFO L93 Difference]: Finished difference Result 2518 states and 3838 transitions. [2019-11-20 11:37:56,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:56,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-11-20 11:37:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:56,859 INFO L225 Difference]: With dead ends: 2518 [2019-11-20 11:37:56,859 INFO L226 Difference]: Without dead ends: 1461 [2019-11-20 11:37:56,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:56,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2019-11-20 11:37:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1461. [2019-11-20 11:37:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2019-11-20 11:37:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2207 transitions. [2019-11-20 11:37:56,936 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2207 transitions. Word has length 309 [2019-11-20 11:37:56,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:56,936 INFO L462 AbstractCegarLoop]: Abstraction has 1461 states and 2207 transitions. [2019-11-20 11:37:56,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2207 transitions. [2019-11-20 11:37:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-20 11:37:56,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:56,978 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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 11:37:57,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:57,179 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:57,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1870971484, now seen corresponding path program 1 times [2019-11-20 11:37:57,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:37:57,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2083411080] [2019-11-20 11:37:57,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:37:57,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:37:57,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:37:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 726 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-11-20 11:37:57,743 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:37:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 726 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-11-20 11:37:57,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2083411080] [2019-11-20 11:37:57,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:37:57,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:37:57,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562119692] [2019-11-20 11:37:57,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:37:57,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:37:57,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:37:57,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:57,864 INFO L87 Difference]: Start difference. First operand 1461 states and 2207 transitions. Second operand 4 states. [2019-11-20 11:37:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:37:59,327 INFO L93 Difference]: Finished difference Result 3042 states and 4617 transitions. [2019-11-20 11:37:59,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:37:59,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 382 [2019-11-20 11:37:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:37:59,337 INFO L225 Difference]: With dead ends: 3042 [2019-11-20 11:37:59,338 INFO L226 Difference]: Without dead ends: 1722 [2019-11-20 11:37:59,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:37:59,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2019-11-20 11:37:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2019-11-20 11:37:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-11-20 11:37:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2595 transitions. [2019-11-20 11:37:59,406 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2595 transitions. Word has length 382 [2019-11-20 11:37:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:37:59,406 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 2595 transitions. [2019-11-20 11:37:59,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:37:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2595 transitions. [2019-11-20 11:37:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-11-20 11:37:59,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:37:59,417 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:37:59,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:37:59,621 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:37:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:37:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1233938880, now seen corresponding path program 1 times [2019-11-20 11:37:59,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:37:59,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [834972078] [2019-11-20 11:37:59,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:38:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:38:00,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:38:00,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:38:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 1043 proven. 0 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2019-11-20 11:38:00,255 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:38:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 1043 proven. 0 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2019-11-20 11:38:00,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [834972078] [2019-11-20 11:38:00,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:38:00,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:38:00,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80130359] [2019-11-20 11:38:00,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:38:00,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:38:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:38:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:38:00,435 INFO L87 Difference]: Start difference. First operand 1722 states and 2595 transitions. Second operand 4 states. [2019-11-20 11:38:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:38:01,022 INFO L93 Difference]: Finished difference Result 3565 states and 5393 transitions. [2019-11-20 11:38:01,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:38:01,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 454 [2019-11-20 11:38:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:38:01,034 INFO L225 Difference]: With dead ends: 3565 [2019-11-20 11:38:01,034 INFO L226 Difference]: Without dead ends: 1984 [2019-11-20 11:38:01,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 904 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:38:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2019-11-20 11:38:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1984. [2019-11-20 11:38:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1984 states. [2019-11-20 11:38:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2982 transitions. [2019-11-20 11:38:01,114 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2982 transitions. Word has length 454 [2019-11-20 11:38:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:38:01,115 INFO L462 AbstractCegarLoop]: Abstraction has 1984 states and 2982 transitions. [2019-11-20 11:38:01,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:38:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2982 transitions. [2019-11-20 11:38:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-11-20 11:38:01,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:38:01,128 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-11-20 11:38:01,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:38:01,331 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:38:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:38:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash 233999944, now seen corresponding path program 1 times [2019-11-20 11:38:01,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:38:01,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [221805490] [2019-11-20 11:38:01,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:38:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:38:01,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:38:01,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:38:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 1206 proven. 0 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2019-11-20 11:38:02,014 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:38:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 1206 proven. 0 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2019-11-20 11:38:02,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [221805490] [2019-11-20 11:38:02,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:38:02,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:38:02,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132558742] [2019-11-20 11:38:02,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:38:02,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:38:02,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:38:02,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:38:02,173 INFO L87 Difference]: Start difference. First operand 1984 states and 2982 transitions. Second operand 4 states. [2019-11-20 11:38:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:38:02,766 INFO L93 Difference]: Finished difference Result 4089 states and 6165 transitions. [2019-11-20 11:38:02,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:38:02,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 499 [2019-11-20 11:38:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:38:02,780 INFO L225 Difference]: With dead ends: 4089 [2019-11-20 11:38:02,780 INFO L226 Difference]: Without dead ends: 2246 [2019-11-20 11:38:02,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 994 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:38:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2019-11-20 11:38:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2019-11-20 11:38:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-11-20 11:38:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3367 transitions. [2019-11-20 11:38:02,869 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3367 transitions. Word has length 499 [2019-11-20 11:38:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:38:02,870 INFO L462 AbstractCegarLoop]: Abstraction has 2246 states and 3367 transitions. [2019-11-20 11:38:02,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:38:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3367 transitions. [2019-11-20 11:38:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-11-20 11:38:02,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:38:02,877 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:38:03,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:38:03,086 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:38:03,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:38:03,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1335257930, now seen corresponding path program 1 times [2019-11-20 11:38:03,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:38:03,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1905057547] [2019-11-20 11:38:03,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:38:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:38:03,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:38:03,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:38:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 1629 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2019-11-20 11:38:03,818 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:38:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 1629 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2019-11-20 11:38:03,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1905057547] [2019-11-20 11:38:03,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:38:03,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:38:03,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170825186] [2019-11-20 11:38:03,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:38:03,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:38:03,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:38:03,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:38:03,998 INFO L87 Difference]: Start difference. First operand 2246 states and 3367 transitions. Second operand 4 states. [2019-11-20 11:38:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:38:05,393 INFO L93 Difference]: Finished difference Result 4614 states and 6935 transitions. [2019-11-20 11:38:05,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:38:05,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 573 [2019-11-20 11:38:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:38:05,407 INFO L225 Difference]: With dead ends: 4614 [2019-11-20 11:38:05,407 INFO L226 Difference]: Without dead ends: 2509 [2019-11-20 11:38:05,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1144 GetRequests, 1142 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:38:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2019-11-20 11:38:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2509. [2019-11-20 11:38:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2509 states. [2019-11-20 11:38:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3752 transitions. [2019-11-20 11:38:05,504 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3752 transitions. Word has length 573 [2019-11-20 11:38:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:38:05,505 INFO L462 AbstractCegarLoop]: Abstraction has 2509 states and 3752 transitions. [2019-11-20 11:38:05,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:38:05,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3752 transitions. [2019-11-20 11:38:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-11-20 11:38:05,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:38:05,514 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:38:05,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:38:05,717 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:38:05,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:38:05,718 INFO L82 PathProgramCache]: Analyzing trace with hash -743232645, now seen corresponding path program 1 times [2019-11-20 11:38:05,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:38:05,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1691096540] [2019-11-20 11:38:05,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:38:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:38:13,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 11:38:13,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:38:13,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 11:38:13,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:13,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:13,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:13,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 11:38:13,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:13,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-20 11:38:13,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:13,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:13,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:13,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 11:38:13,824 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:13,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 11:38:13,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:13,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:13,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:13,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:5 [2019-11-20 11:38:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 2229 proven. 0 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2019-11-20 11:38:14,255 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:38:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 2229 proven. 0 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2019-11-20 11:38:14,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1691096540] [2019-11-20 11:38:14,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:38:14,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-20 11:38:14,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783685733] [2019-11-20 11:38:14,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:38:14,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:38:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:38:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:38:14,535 INFO L87 Difference]: Start difference. First operand 2509 states and 3752 transitions. Second operand 8 states. [2019-11-20 11:38:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:38:34,165 INFO L93 Difference]: Finished difference Result 11170 states and 16815 transitions. [2019-11-20 11:38:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:38:34,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 647 [2019-11-20 11:38:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:38:34,211 INFO L225 Difference]: With dead ends: 11170 [2019-11-20 11:38:34,211 INFO L226 Difference]: Without dead ends: 8669 [2019-11-20 11:38:34,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1297 GetRequests, 1286 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:38:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8669 states. [2019-11-20 11:38:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8669 to 3322. [2019-11-20 11:38:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3322 states. [2019-11-20 11:38:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3322 states to 3322 states and 5230 transitions. [2019-11-20 11:38:34,391 INFO L78 Accepts]: Start accepts. Automaton has 3322 states and 5230 transitions. Word has length 647 [2019-11-20 11:38:34,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:38:34,392 INFO L462 AbstractCegarLoop]: Abstraction has 3322 states and 5230 transitions. [2019-11-20 11:38:34,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:38:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3322 states and 5230 transitions. [2019-11-20 11:38:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-11-20 11:38:34,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:38:34,403 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:38:34,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:38:34,618 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:38:34,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:38:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1269497021, now seen corresponding path program 1 times [2019-11-20 11:38:34,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:38:34,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [40636685] [2019-11-20 11:38:34,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dde2fd0e-9065-4651-8770-18d4b1ce276b/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:38:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:38:51,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 11:38:51,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:38:52,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 11:38:52,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,338 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 11:38:52,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,340 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_283|], 2=[|v_#memory_$Pointer$.base_278|, |v_#memory_$Pointer$.base_277|]} [2019-11-20 11:38:52,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 11:38:52,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,522 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 11:38:52,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 11:38:52,552 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 11:38:52,603 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,623 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-11-20 11:38:52,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 11:38:52,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-20 11:38:52,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 11:38:52,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-20 11:38:52,679 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:38:52,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 11:38:52,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-11-20 11:38:52,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 11:38:52,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-20 11:38:52,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 11:38:52,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-20 11:38:52,755 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:38:52,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 11:38:52,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,799 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-11-20 11:38:52,804 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_278|], 2=[|v_#memory_$Pointer$.base_290|]} [2019-11-20 11:38:52,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 11:38:52,808 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:38:52,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,890 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-11-20 11:38:52,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:38:52,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:38:52,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:38:52,895 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-20 11:38:52,919 INFO L567 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-11-20 11:38:52,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,920 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-11-20 11:38:52,931 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:38:52,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:52,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 11:38:52,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:52,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:52,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-11-20 11:38:52,999 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_279|], 2=[|v_#memory_$Pointer$.base_292|]} [2019-11-20 11:38:53,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 11:38:53,004 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:38:53,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:53,106 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:53,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-11-20 11:38:53,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:38:53,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:38:53,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:38:53,109 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-20 11:38:53,143 INFO L567 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-11-20 11:38:53,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:53,144 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-11-20 11:38:53,149 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_299|, |v_#memory_$Pointer$.offset_277|], 2=[|v_#memory_$Pointer$.base_282|, |v_#memory_$Pointer$.base_293|]} [2019-11-20 11:38:53,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:53,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:53,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-20 11:38:53,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:53,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:53,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-11-20 11:38:53,218 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:38:53,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:53,244 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:38:53,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:53,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2019-11-20 11:38:53,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:53,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:38:53,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-11-20 11:38:53,269 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:38:53,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:53,276 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:38:53,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:53,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:38:53,291 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:142, output treesize:35 [2019-11-20 11:38:53,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-20 11:38:53,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:38:53,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:38:53,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:38:53,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-20 11:38:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 1428 proven. 91 refuted. 0 times theorem prover too weak. 2427 trivial. 0 not checked. [2019-11-20 11:38:53,956 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:38:54,004 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_int|, |v_#memory_$Pointer$.offset_277|], 2=[|v_#memory_$Pointer$.base_282|]} [2019-11-20 11:39:02,173 WARN L191 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 11:39:02,174 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:39:02,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 107 [2019-11-20 11:39:02,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:39:02,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:39:02,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:39:02,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:39:02,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 107 [2019-11-20 11:39:02,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:39:02,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:39:02,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:39:02,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:39:02,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:39:02,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:39:02,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:39:02,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:39:02,218 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_29], 1=[v_arrayElimCell_28]} [2019-11-20 11:39:02,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:39:02,423 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 11:39:02,427 INFO L168 Benchmark]: Toolchain (without parser) took 76091.39 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 849.3 MB). Free memory was 956.4 MB in the beginning and 1.6 GB in the end (delta: -669.8 MB). Peak memory consumption was 179.5 MB. Max. memory is 11.5 GB. [2019-11-20 11:39:02,427 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:39:02,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-11-20 11:39:02,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 11:39:02,429 INFO L168 Benchmark]: Boogie Preprocessor took 122.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 11:39:02,429 INFO L168 Benchmark]: RCFGBuilder took 2677.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.9 MB). Peak memory consumption was 96.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:39:02,429 INFO L168 Benchmark]: TraceAbstraction took 72435.58 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 682.6 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -595.9 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. [2019-11-20 11:39:02,432 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 777.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 122.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2677.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.9 MB). Peak memory consumption was 96.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 72435.58 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 682.6 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -595.9 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...