./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i --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_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/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 70388197a28bd3be848acf07d15b703eb0dba0f2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 01:14:33,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:14:33,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:14:33,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:14:33,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:14:33,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:14:33,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:14:33,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:14:33,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:14:33,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:14:33,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:14:33,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:14:33,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:14:33,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:14:33,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:14:33,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:14:33,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:14:33,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:14:33,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:14:33,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:14:33,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:14:33,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:14:33,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:14:33,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:14:33,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:14:33,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:14:33,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:14:33,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:14:33,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:14:33,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:14:33,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:14:33,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:14:33,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:14:33,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:14:33,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:14:33,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:14:33,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:14:33,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:14:33,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:14:33,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:14:33,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:14:33,908 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:14:33,924 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:14:33,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:14:33,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:14:33,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:14:33,926 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:14:33,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:14:33,927 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:14:33,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:14:33,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:14:33,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:14:33,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:14:33,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:14:33,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:14:33,928 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:14:33,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:14:33,928 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:14:33,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:14:33,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:14:33,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:14:33,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:14:33,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:14:33,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:14:33,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:14:33,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:14:33,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:14:33,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:14:33,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:14:33,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:14:33,931 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_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/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 -> 70388197a28bd3be848acf07d15b703eb0dba0f2 [2019-11-20 01:14:34,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:14:34,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:14:34,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:14:34,117 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:14:34,117 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:14:34,119 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i [2019-11-20 01:14:34,190 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/data/80f8c72fb/0683deabc4004b58a2c27d1ca076e6a0/FLAG057828af6 [2019-11-20 01:14:34,595 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:14:34,598 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i [2019-11-20 01:14:34,613 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/data/80f8c72fb/0683deabc4004b58a2c27d1ca076e6a0/FLAG057828af6 [2019-11-20 01:14:34,914 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/data/80f8c72fb/0683deabc4004b58a2c27d1ca076e6a0 [2019-11-20 01:14:34,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:14:34,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:14:34,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:14:34,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:14:34,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:14:34,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:14:34" (1/1) ... [2019-11-20 01:14:34,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a67e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:34, skipping insertion in model container [2019-11-20 01:14:34,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:14:34" (1/1) ... [2019-11-20 01:14:34,934 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:14:34,980 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:14:35,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:14:35,387 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:14:35,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:14:35,517 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:14:35,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35 WrapperNode [2019-11-20 01:14:35,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:14:35,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:14:35,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:14:35,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:14:35,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (1/1) ... [2019-11-20 01:14:35,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (1/1) ... [2019-11-20 01:14:35,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:14:35,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:14:35,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:14:35,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:14:35,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (1/1) ... [2019-11-20 01:14:35,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (1/1) ... [2019-11-20 01:14:35,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (1/1) ... [2019-11-20 01:14:35,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (1/1) ... [2019-11-20 01:14:35,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (1/1) ... [2019-11-20 01:14:35,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (1/1) ... [2019-11-20 01:14:35,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (1/1) ... [2019-11-20 01:14:35,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:14:35,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:14:35,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:14:35,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:14:35,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/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 01:14:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-20 01:14:35,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-20 01:14:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-20 01:14:35,662 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-20 01:14:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 01:14:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:14:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:14:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:14:35,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:14:35,665 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-20 01:14:35,942 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:14:35,942 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:14:35,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:14:35 BoogieIcfgContainer [2019-11-20 01:14:35,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:14:35,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:14:35,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:14:35,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:14:35,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:14:34" (1/3) ... [2019-11-20 01:14:35,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c865c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:14:35, skipping insertion in model container [2019-11-20 01:14:35,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:35" (2/3) ... [2019-11-20 01:14:35,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c865c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:14:35, skipping insertion in model container [2019-11-20 01:14:35,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:14:35" (3/3) ... [2019-11-20 01:14:35,953 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2019-11-20 01:14:36,001 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,001 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,002 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,002 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,002 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,003 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,004 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,004 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,004 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,004 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork4_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,005 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork4_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,005 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork4_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,006 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,006 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,006 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,006 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,007 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork2_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,007 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork2_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,007 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork2_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,008 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,008 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork5___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,010 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork5___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork3___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork3___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,016 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,016 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,017 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,017 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,018 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,019 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 01:14:36,051 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-20 01:14:36,051 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:14:36,058 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-20 01:14:36,066 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-20 01:14:36,084 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:14:36,084 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:14:36,085 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:14:36,085 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:14:36,085 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:14:36,085 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:14:36,086 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:14:36,086 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:14:36,099 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 83 transitions [2019-11-20 01:15:10,164 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 138880 states. [2019-11-20 01:15:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 138880 states. [2019-11-20 01:15:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 01:15:10,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:10,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:10,178 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:10,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:10,183 INFO L82 PathProgramCache]: Analyzing trace with hash -636601520, now seen corresponding path program 1 times [2019-11-20 01:15:10,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:10,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321838838] [2019-11-20 01:15:10,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:10,426 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 01:15:10,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321838838] [2019-11-20 01:15:10,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:10,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:15:10,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626900836] [2019-11-20 01:15:10,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:15:10,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:10,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:15:10,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:15:10,447 INFO L87 Difference]: Start difference. First operand 138880 states. Second operand 6 states. [2019-11-20 01:15:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:11,752 INFO L93 Difference]: Finished difference Result 151484 states and 599630 transitions. [2019-11-20 01:15:11,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:15:11,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-20 01:15:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:12,259 INFO L225 Difference]: With dead ends: 151484 [2019-11-20 01:15:12,260 INFO L226 Difference]: Without dead ends: 98641 [2019-11-20 01:15:12,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:15:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98641 states. [2019-11-20 01:15:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98641 to 98641. [2019-11-20 01:15:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98641 states. [2019-11-20 01:15:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98641 states to 98641 states and 387003 transitions. [2019-11-20 01:15:20,826 INFO L78 Accepts]: Start accepts. Automaton has 98641 states and 387003 transitions. Word has length 25 [2019-11-20 01:15:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:20,827 INFO L462 AbstractCegarLoop]: Abstraction has 98641 states and 387003 transitions. [2019-11-20 01:15:20,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:15:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 98641 states and 387003 transitions. [2019-11-20 01:15:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 01:15:20,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:20,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:20,838 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:20,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:20,839 INFO L82 PathProgramCache]: Analyzing trace with hash -15348943, now seen corresponding path program 1 times [2019-11-20 01:15:20,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:20,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064233378] [2019-11-20 01:15:20,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:20,967 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 01:15:20,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064233378] [2019-11-20 01:15:20,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:20,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:15:20,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004752897] [2019-11-20 01:15:20,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:15:20,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:20,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:15:20,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:15:20,970 INFO L87 Difference]: Start difference. First operand 98641 states and 387003 transitions. Second operand 6 states. [2019-11-20 01:15:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:21,685 INFO L93 Difference]: Finished difference Result 104705 states and 406098 transitions. [2019-11-20 01:15:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:15:21,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-20 01:15:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:21,995 INFO L225 Difference]: With dead ends: 104705 [2019-11-20 01:15:21,996 INFO L226 Difference]: Without dead ends: 89260 [2019-11-20 01:15:21,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:15:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89260 states. [2019-11-20 01:15:24,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89260 to 89260. [2019-11-20 01:15:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89260 states. [2019-11-20 01:15:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89260 states to 89260 states and 345999 transitions. [2019-11-20 01:15:24,996 INFO L78 Accepts]: Start accepts. Automaton has 89260 states and 345999 transitions. Word has length 25 [2019-11-20 01:15:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:24,997 INFO L462 AbstractCegarLoop]: Abstraction has 89260 states and 345999 transitions. [2019-11-20 01:15:24,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:15:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 89260 states and 345999 transitions. [2019-11-20 01:15:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 01:15:24,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:24,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:24,999 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash 605903634, now seen corresponding path program 1 times [2019-11-20 01:15:24,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:25,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341348618] [2019-11-20 01:15:25,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:25,087 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 01:15:25,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341348618] [2019-11-20 01:15:25,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:25,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:15:25,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447297216] [2019-11-20 01:15:25,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:15:25,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:15:25,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:15:25,089 INFO L87 Difference]: Start difference. First operand 89260 states and 345999 transitions. Second operand 6 states. [2019-11-20 01:15:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:25,604 INFO L93 Difference]: Finished difference Result 95324 states and 365094 transitions. [2019-11-20 01:15:25,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:15:25,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-20 01:15:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:25,783 INFO L225 Difference]: With dead ends: 95324 [2019-11-20 01:15:25,783 INFO L226 Difference]: Without dead ends: 79879 [2019-11-20 01:15:25,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:15:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2019-11-20 01:15:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 79879. [2019-11-20 01:15:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79879 states. [2019-11-20 01:15:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79879 states to 79879 states and 304995 transitions. [2019-11-20 01:15:27,508 INFO L78 Accepts]: Start accepts. Automaton has 79879 states and 304995 transitions. Word has length 25 [2019-11-20 01:15:27,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:27,509 INFO L462 AbstractCegarLoop]: Abstraction has 79879 states and 304995 transitions. [2019-11-20 01:15:27,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:15:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 79879 states and 304995 transitions. [2019-11-20 01:15:27,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:15:27,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:27,515 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] [2019-11-20 01:15:27,516 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:27,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1946134376, now seen corresponding path program 1 times [2019-11-20 01:15:27,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:27,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453542101] [2019-11-20 01:15:27,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:27,639 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 01:15:27,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453542101] [2019-11-20 01:15:27,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:27,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:15:27,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927066894] [2019-11-20 01:15:27,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:15:27,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:27,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:15:27,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:27,641 INFO L87 Difference]: Start difference. First operand 79879 states and 304995 transitions. Second operand 8 states. [2019-11-20 01:15:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:29,677 INFO L93 Difference]: Finished difference Result 120499 states and 451455 transitions. [2019-11-20 01:15:29,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:15:29,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 01:15:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:29,934 INFO L225 Difference]: With dead ends: 120499 [2019-11-20 01:15:29,934 INFO L226 Difference]: Without dead ends: 113465 [2019-11-20 01:15:29,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:15:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113465 states. [2019-11-20 01:15:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113465 to 77825. [2019-11-20 01:15:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77825 states. [2019-11-20 01:15:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77825 states to 77825 states and 295958 transitions. [2019-11-20 01:15:32,093 INFO L78 Accepts]: Start accepts. Automaton has 77825 states and 295958 transitions. Word has length 34 [2019-11-20 01:15:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:32,094 INFO L462 AbstractCegarLoop]: Abstraction has 77825 states and 295958 transitions. [2019-11-20 01:15:32,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:15:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 77825 states and 295958 transitions. [2019-11-20 01:15:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:15:32,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:32,097 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] [2019-11-20 01:15:32,098 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:32,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:32,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2105124105, now seen corresponding path program 1 times [2019-11-20 01:15:32,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:32,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562822555] [2019-11-20 01:15:32,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:32,253 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 01:15:32,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562822555] [2019-11-20 01:15:32,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:32,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:15:32,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056120325] [2019-11-20 01:15:32,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:15:32,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:15:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:32,255 INFO L87 Difference]: Start difference. First operand 77825 states and 295958 transitions. Second operand 8 states. [2019-11-20 01:15:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:33,007 INFO L93 Difference]: Finished difference Result 116615 states and 435295 transitions. [2019-11-20 01:15:33,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:15:33,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 01:15:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:33,264 INFO L225 Difference]: With dead ends: 116615 [2019-11-20 01:15:33,264 INFO L226 Difference]: Without dead ends: 109261 [2019-11-20 01:15:33,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:15:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109261 states. [2019-11-20 01:15:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109261 to 75215. [2019-11-20 01:15:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75215 states. [2019-11-20 01:15:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75215 states to 75215 states and 284763 transitions. [2019-11-20 01:15:40,194 INFO L78 Accepts]: Start accepts. Automaton has 75215 states and 284763 transitions. Word has length 34 [2019-11-20 01:15:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:40,195 INFO L462 AbstractCegarLoop]: Abstraction has 75215 states and 284763 transitions. [2019-11-20 01:15:40,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:15:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 75215 states and 284763 transitions. [2019-11-20 01:15:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:15:40,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:40,199 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] [2019-11-20 01:15:40,199 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:40,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:40,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2030853462, now seen corresponding path program 1 times [2019-11-20 01:15:40,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:40,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821711228] [2019-11-20 01:15:40,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:40,297 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 01:15:40,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821711228] [2019-11-20 01:15:40,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:40,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:15:40,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459980315] [2019-11-20 01:15:40,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:15:40,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:40,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:15:40,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:40,299 INFO L87 Difference]: Start difference. First operand 75215 states and 284763 transitions. Second operand 8 states. [2019-11-20 01:15:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:41,053 INFO L93 Difference]: Finished difference Result 112055 states and 416505 transitions. [2019-11-20 01:15:41,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:15:41,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 01:15:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:41,305 INFO L225 Difference]: With dead ends: 112055 [2019-11-20 01:15:41,305 INFO L226 Difference]: Without dead ends: 104291 [2019-11-20 01:15:41,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:15:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104291 states. [2019-11-20 01:15:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104291 to 71839. [2019-11-20 01:15:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71839 states. [2019-11-20 01:15:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71839 states to 71839 states and 270749 transitions. [2019-11-20 01:15:43,031 INFO L78 Accepts]: Start accepts. Automaton has 71839 states and 270749 transitions. Word has length 34 [2019-11-20 01:15:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:43,032 INFO L462 AbstractCegarLoop]: Abstraction has 71839 states and 270749 transitions. [2019-11-20 01:15:43,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:15:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 71839 states and 270749 transitions. [2019-11-20 01:15:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:15:43,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:43,036 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] [2019-11-20 01:15:43,036 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:43,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash -886664795, now seen corresponding path program 1 times [2019-11-20 01:15:43,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:43,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091717092] [2019-11-20 01:15:43,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:43,127 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 01:15:43,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091717092] [2019-11-20 01:15:43,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:43,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:15:43,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389630685] [2019-11-20 01:15:43,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:15:43,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:15:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:43,128 INFO L87 Difference]: Start difference. First operand 71839 states and 270749 transitions. Second operand 8 states. [2019-11-20 01:15:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:43,827 INFO L93 Difference]: Finished difference Result 107111 states and 396439 transitions. [2019-11-20 01:15:43,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:15:43,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 01:15:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:44,058 INFO L225 Difference]: With dead ends: 107111 [2019-11-20 01:15:44,058 INFO L226 Difference]: Without dead ends: 100077 [2019-11-20 01:15:44,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:15:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100077 states. [2019-11-20 01:15:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100077 to 69785. [2019-11-20 01:15:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69785 states. [2019-11-20 01:15:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69785 states to 69785 states and 261712 transitions. [2019-11-20 01:15:46,789 INFO L78 Accepts]: Start accepts. Automaton has 69785 states and 261712 transitions. Word has length 34 [2019-11-20 01:15:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:46,790 INFO L462 AbstractCegarLoop]: Abstraction has 69785 states and 261712 transitions. [2019-11-20 01:15:46,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:15:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 69785 states and 261712 transitions. [2019-11-20 01:15:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:15:46,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:46,793 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] [2019-11-20 01:15:46,794 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash -663288506, now seen corresponding path program 1 times [2019-11-20 01:15:46,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:46,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267764803] [2019-11-20 01:15:46,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:46,899 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 01:15:46,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267764803] [2019-11-20 01:15:46,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:46,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:15:46,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273347758] [2019-11-20 01:15:46,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:15:46,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:46,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:15:46,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:46,901 INFO L87 Difference]: Start difference. First operand 69785 states and 261712 transitions. Second operand 8 states. [2019-11-20 01:15:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:47,603 INFO L93 Difference]: Finished difference Result 103227 states and 380279 transitions. [2019-11-20 01:15:47,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:15:47,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 01:15:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:47,815 INFO L225 Difference]: With dead ends: 103227 [2019-11-20 01:15:47,815 INFO L226 Difference]: Without dead ends: 95873 [2019-11-20 01:15:47,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:15:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95873 states. [2019-11-20 01:15:49,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95873 to 67175. [2019-11-20 01:15:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67175 states. [2019-11-20 01:15:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67175 states to 67175 states and 250517 transitions. [2019-11-20 01:15:49,331 INFO L78 Accepts]: Start accepts. Automaton has 67175 states and 250517 transitions. Word has length 34 [2019-11-20 01:15:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:49,331 INFO L462 AbstractCegarLoop]: Abstraction has 67175 states and 250517 transitions. [2019-11-20 01:15:49,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:15:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 67175 states and 250517 transitions. [2019-11-20 01:15:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:15:49,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:49,335 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] [2019-11-20 01:15:49,335 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:49,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:49,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2140873895, now seen corresponding path program 1 times [2019-11-20 01:15:49,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:49,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999265163] [2019-11-20 01:15:49,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:49,424 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 01:15:49,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999265163] [2019-11-20 01:15:49,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:49,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:15:49,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902675765] [2019-11-20 01:15:49,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:15:49,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:49,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:15:49,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:49,426 INFO L87 Difference]: Start difference. First operand 67175 states and 250517 transitions. Second operand 8 states. [2019-11-20 01:15:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:50,036 INFO L93 Difference]: Finished difference Result 98667 states and 361489 transitions. [2019-11-20 01:15:50,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:15:50,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 01:15:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:50,235 INFO L225 Difference]: With dead ends: 98667 [2019-11-20 01:15:50,235 INFO L226 Difference]: Without dead ends: 90903 [2019-11-20 01:15:50,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:15:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90903 states. [2019-11-20 01:15:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90903 to 63799. [2019-11-20 01:15:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63799 states. [2019-11-20 01:15:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63799 states to 63799 states and 236503 transitions. [2019-11-20 01:15:52,566 INFO L78 Accepts]: Start accepts. Automaton has 63799 states and 236503 transitions. Word has length 34 [2019-11-20 01:15:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:52,566 INFO L462 AbstractCegarLoop]: Abstraction has 63799 states and 236503 transitions. [2019-11-20 01:15:52,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:15:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 63799 states and 236503 transitions. [2019-11-20 01:15:52,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:15:52,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:52,569 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] [2019-11-20 01:15:52,569 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:52,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:52,570 INFO L82 PathProgramCache]: Analyzing trace with hash -55541710, now seen corresponding path program 1 times [2019-11-20 01:15:52,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:52,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854201730] [2019-11-20 01:15:52,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:52,637 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 01:15:52,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854201730] [2019-11-20 01:15:52,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:52,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:15:52,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275477606] [2019-11-20 01:15:52,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:15:52,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:15:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:52,639 INFO L87 Difference]: Start difference. First operand 63799 states and 236503 transitions. Second operand 8 states. [2019-11-20 01:15:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:53,217 INFO L93 Difference]: Finished difference Result 93723 states and 341423 transitions. [2019-11-20 01:15:53,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:15:53,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 01:15:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:53,404 INFO L225 Difference]: With dead ends: 93723 [2019-11-20 01:15:53,404 INFO L226 Difference]: Without dead ends: 86689 [2019-11-20 01:15:53,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:15:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86689 states. [2019-11-20 01:15:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86689 to 61745. [2019-11-20 01:15:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61745 states. [2019-11-20 01:15:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61745 states to 61745 states and 227466 transitions. [2019-11-20 01:15:54,823 INFO L78 Accepts]: Start accepts. Automaton has 61745 states and 227466 transitions. Word has length 34 [2019-11-20 01:15:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:54,824 INFO L462 AbstractCegarLoop]: Abstraction has 61745 states and 227466 transitions. [2019-11-20 01:15:54,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:15:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 61745 states and 227466 transitions. [2019-11-20 01:15:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:15:54,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:54,827 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] [2019-11-20 01:15:54,827 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash -214531439, now seen corresponding path program 1 times [2019-11-20 01:15:54,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:54,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069602184] [2019-11-20 01:15:54,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:54,913 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 01:15:54,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069602184] [2019-11-20 01:15:54,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:54,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:15:54,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697196976] [2019-11-20 01:15:54,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:15:54,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:54,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:15:54,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:54,914 INFO L87 Difference]: Start difference. First operand 61745 states and 227466 transitions. Second operand 8 states. [2019-11-20 01:15:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:55,432 INFO L93 Difference]: Finished difference Result 89839 states and 325263 transitions. [2019-11-20 01:15:55,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:15:55,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 01:15:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:55,606 INFO L225 Difference]: With dead ends: 89839 [2019-11-20 01:15:55,606 INFO L226 Difference]: Without dead ends: 82485 [2019-11-20 01:15:55,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:15:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82485 states. [2019-11-20 01:15:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82485 to 59135. [2019-11-20 01:15:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59135 states. [2019-11-20 01:15:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59135 states to 59135 states and 216271 transitions. [2019-11-20 01:15:57,345 INFO L78 Accepts]: Start accepts. Automaton has 59135 states and 216271 transitions. Word has length 34 [2019-11-20 01:15:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:57,346 INFO L462 AbstractCegarLoop]: Abstraction has 59135 states and 216271 transitions. [2019-11-20 01:15:57,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:15:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 59135 states and 216271 transitions. [2019-11-20 01:15:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:15:57,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:57,348 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] [2019-11-20 01:15:57,348 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:57,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:57,348 INFO L82 PathProgramCache]: Analyzing trace with hash -373521168, now seen corresponding path program 1 times [2019-11-20 01:15:57,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:57,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969221140] [2019-11-20 01:15:57,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:57,429 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 01:15:57,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969221140] [2019-11-20 01:15:57,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:57,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:15:57,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383545617] [2019-11-20 01:15:57,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:15:57,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:15:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:57,430 INFO L87 Difference]: Start difference. First operand 59135 states and 216271 transitions. Second operand 8 states. [2019-11-20 01:15:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:57,912 INFO L93 Difference]: Finished difference Result 85279 states and 306473 transitions. [2019-11-20 01:15:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:15:57,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 01:15:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:58,081 INFO L225 Difference]: With dead ends: 85279 [2019-11-20 01:15:58,081 INFO L226 Difference]: Without dead ends: 77515 [2019-11-20 01:15:58,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:15:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77515 states. [2019-11-20 01:15:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77515 to 55759. [2019-11-20 01:15:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55759 states. [2019-11-20 01:15:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55759 states to 55759 states and 202257 transitions. [2019-11-20 01:15:59,343 INFO L78 Accepts]: Start accepts. Automaton has 55759 states and 202257 transitions. Word has length 34 [2019-11-20 01:15:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:59,343 INFO L462 AbstractCegarLoop]: Abstraction has 55759 states and 202257 transitions. [2019-11-20 01:15:59,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:15:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 55759 states and 202257 transitions. [2019-11-20 01:15:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:15:59,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:59,360 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] [2019-11-20 01:15:59,360 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:59,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:59,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1760471850, now seen corresponding path program 1 times [2019-11-20 01:15:59,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:59,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035046322] [2019-11-20 01:15:59,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:59,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035046322] [2019-11-20 01:15:59,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631460923] [2019-11-20 01:15:59,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/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 01:15:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:59,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:15:59,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:59,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:59,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:15:59,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 01:15:59,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311400562] [2019-11-20 01:15:59,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:15:59,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:59,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:15:59,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:15:59,756 INFO L87 Difference]: Start difference. First operand 55759 states and 202257 transitions. Second operand 18 states. [2019-11-20 01:16:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:00,689 INFO L93 Difference]: Finished difference Result 100843 states and 357569 transitions. [2019-11-20 01:16:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:00,690 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-20 01:16:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:01,437 INFO L225 Difference]: With dead ends: 100843 [2019-11-20 01:16:01,437 INFO L226 Difference]: Without dead ends: 97907 [2019-11-20 01:16:01,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-20 01:16:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97907 states. [2019-11-20 01:16:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97907 to 55255. [2019-11-20 01:16:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55255 states. [2019-11-20 01:16:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55255 states to 55255 states and 200141 transitions. [2019-11-20 01:16:03,249 INFO L78 Accepts]: Start accepts. Automaton has 55255 states and 200141 transitions. Word has length 45 [2019-11-20 01:16:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:03,249 INFO L462 AbstractCegarLoop]: Abstraction has 55255 states and 200141 transitions. [2019-11-20 01:16:03,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:16:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 55255 states and 200141 transitions. [2019-11-20 01:16:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:03,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:03,295 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] [2019-11-20 01:16:03,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:03,498 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:03,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:03,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1601482121, now seen corresponding path program 1 times [2019-11-20 01:16:03,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:03,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615728531] [2019-11-20 01:16:03,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:03,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615728531] [2019-11-20 01:16:03,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890409840] [2019-11-20 01:16:03,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/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 01:16:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:03,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:16:03,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:03,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:03,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:03,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 01:16:03,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802906812] [2019-11-20 01:16:03,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:16:03,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:03,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:16:03,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:16:03,872 INFO L87 Difference]: Start difference. First operand 55255 states and 200141 transitions. Second operand 18 states. [2019-11-20 01:16:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:04,882 INFO L93 Difference]: Finished difference Result 96683 states and 342625 transitions. [2019-11-20 01:16:04,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:04,882 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-20 01:16:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:05,076 INFO L225 Difference]: With dead ends: 96683 [2019-11-20 01:16:05,077 INFO L226 Difference]: Without dead ends: 93747 [2019-11-20 01:16:05,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-20 01:16:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93747 states. [2019-11-20 01:16:06,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93747 to 54811. [2019-11-20 01:16:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54811 states. [2019-11-20 01:16:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54811 states to 54811 states and 198261 transitions. [2019-11-20 01:16:06,421 INFO L78 Accepts]: Start accepts. Automaton has 54811 states and 198261 transitions. Word has length 45 [2019-11-20 01:16:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:06,421 INFO L462 AbstractCegarLoop]: Abstraction has 54811 states and 198261 transitions. [2019-11-20 01:16:06,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:16:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 54811 states and 198261 transitions. [2019-11-20 01:16:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:06,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:06,439 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] [2019-11-20 01:16:06,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:06,646 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:06,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:06,646 INFO L82 PathProgramCache]: Analyzing trace with hash -643017752, now seen corresponding path program 2 times [2019-11-20 01:16:06,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:06,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320848318] [2019-11-20 01:16:06,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:06,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320848318] [2019-11-20 01:16:06,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:06,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:06,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859489871] [2019-11-20 01:16:06,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:06,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:06,753 INFO L87 Difference]: Start difference. First operand 54811 states and 198261 transitions. Second operand 10 states. [2019-11-20 01:16:07,525 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 01:16:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:07,849 INFO L93 Difference]: Finished difference Result 94467 states and 334441 transitions. [2019-11-20 01:16:07,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:07,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:07,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:08,076 INFO L225 Difference]: With dead ends: 94467 [2019-11-20 01:16:08,076 INFO L226 Difference]: Without dead ends: 91387 [2019-11-20 01:16:08,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91387 states. [2019-11-20 01:16:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91387 to 52151. [2019-11-20 01:16:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52151 states. [2019-11-20 01:16:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52151 states to 52151 states and 188609 transitions. [2019-11-20 01:16:09,353 INFO L78 Accepts]: Start accepts. Automaton has 52151 states and 188609 transitions. Word has length 45 [2019-11-20 01:16:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:09,353 INFO L462 AbstractCegarLoop]: Abstraction has 52151 states and 188609 transitions. [2019-11-20 01:16:09,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 52151 states and 188609 transitions. [2019-11-20 01:16:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:09,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:09,370 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] [2019-11-20 01:16:09,370 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:09,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1186675335, now seen corresponding path program 2 times [2019-11-20 01:16:09,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:09,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767708755] [2019-11-20 01:16:09,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:09,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767708755] [2019-11-20 01:16:09,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:09,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:09,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407498463] [2019-11-20 01:16:09,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:09,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:09,469 INFO L87 Difference]: Start difference. First operand 52151 states and 188609 transitions. Second operand 10 states. [2019-11-20 01:16:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:10,150 INFO L93 Difference]: Finished difference Result 90967 states and 321905 transitions. [2019-11-20 01:16:10,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:10,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:10,329 INFO L225 Difference]: With dead ends: 90967 [2019-11-20 01:16:10,329 INFO L226 Difference]: Without dead ends: 87367 [2019-11-20 01:16:10,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87367 states. [2019-11-20 01:16:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87367 to 48435. [2019-11-20 01:16:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48435 states. [2019-11-20 01:16:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48435 states to 48435 states and 175495 transitions. [2019-11-20 01:16:11,500 INFO L78 Accepts]: Start accepts. Automaton has 48435 states and 175495 transitions. Word has length 45 [2019-11-20 01:16:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:11,500 INFO L462 AbstractCegarLoop]: Abstraction has 48435 states and 175495 transitions. [2019-11-20 01:16:11,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 48435 states and 175495 transitions. [2019-11-20 01:16:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:11,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:11,514 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] [2019-11-20 01:16:11,514 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1814838694, now seen corresponding path program 1 times [2019-11-20 01:16:11,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:11,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211485463] [2019-11-20 01:16:11,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:11,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211485463] [2019-11-20 01:16:11,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:11,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:11,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855448826] [2019-11-20 01:16:11,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:11,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:11,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:11,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:11,619 INFO L87 Difference]: Start difference. First operand 48435 states and 175495 transitions. Second operand 10 states. [2019-11-20 01:16:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:12,628 INFO L93 Difference]: Finished difference Result 86191 states and 305095 transitions. [2019-11-20 01:16:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:12,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:12,775 INFO L225 Difference]: With dead ends: 86191 [2019-11-20 01:16:12,775 INFO L226 Difference]: Without dead ends: 82735 [2019-11-20 01:16:12,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82735 states. [2019-11-20 01:16:13,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82735 to 48423. [2019-11-20 01:16:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48423 states. [2019-11-20 01:16:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48423 states to 48423 states and 175133 transitions. [2019-11-20 01:16:13,905 INFO L78 Accepts]: Start accepts. Automaton has 48423 states and 175133 transitions. Word has length 45 [2019-11-20 01:16:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:13,905 INFO L462 AbstractCegarLoop]: Abstraction has 48423 states and 175133 transitions. [2019-11-20 01:16:13,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 48423 states and 175133 transitions. [2019-11-20 01:16:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:13,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:13,920 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] [2019-11-20 01:16:13,920 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash -285573722, now seen corresponding path program 2 times [2019-11-20 01:16:13,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:13,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101837451] [2019-11-20 01:16:13,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:14,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101837451] [2019-11-20 01:16:14,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:14,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:14,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30765094] [2019-11-20 01:16:14,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:14,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:14,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:14,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:14,032 INFO L87 Difference]: Start difference. First operand 48423 states and 175133 transitions. Second operand 10 states. [2019-11-20 01:16:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:14,805 INFO L93 Difference]: Finished difference Result 83215 states and 294293 transitions. [2019-11-20 01:16:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:14,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:14,968 INFO L225 Difference]: With dead ends: 83215 [2019-11-20 01:16:14,968 INFO L226 Difference]: Without dead ends: 79615 [2019-11-20 01:16:14,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79615 states. [2019-11-20 01:16:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79615 to 45511. [2019-11-20 01:16:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45511 states. [2019-11-20 01:16:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45511 states to 45511 states and 164655 transitions. [2019-11-20 01:16:16,064 INFO L78 Accepts]: Start accepts. Automaton has 45511 states and 164655 transitions. Word has length 45 [2019-11-20 01:16:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:16,065 INFO L462 AbstractCegarLoop]: Abstraction has 45511 states and 164655 transitions. [2019-11-20 01:16:16,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 45511 states and 164655 transitions. [2019-11-20 01:16:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:16,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:16,076 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] [2019-11-20 01:16:16,076 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:16,076 INFO L82 PathProgramCache]: Analyzing trace with hash 806751159, now seen corresponding path program 1 times [2019-11-20 01:16:16,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:16,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842354003] [2019-11-20 01:16:16,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:16,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842354003] [2019-11-20 01:16:16,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568285187] [2019-11-20 01:16:16,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:16,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:16:16,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:16,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:16,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:16,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 01:16:16,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69080668] [2019-11-20 01:16:16,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:16:16,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:16,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:16:16,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:16:16,369 INFO L87 Difference]: Start difference. First operand 45511 states and 164655 transitions. Second operand 18 states. [2019-11-20 01:16:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:17,133 INFO L93 Difference]: Finished difference Result 79735 states and 281847 transitions. [2019-11-20 01:16:17,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:17,133 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-20 01:16:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:17,287 INFO L225 Difference]: With dead ends: 79735 [2019-11-20 01:16:17,287 INFO L226 Difference]: Without dead ends: 76799 [2019-11-20 01:16:17,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-20 01:16:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76799 states. [2019-11-20 01:16:18,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76799 to 45007. [2019-11-20 01:16:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45007 states. [2019-11-20 01:16:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45007 states to 45007 states and 162539 transitions. [2019-11-20 01:16:18,764 INFO L78 Accepts]: Start accepts. Automaton has 45007 states and 162539 transitions. Word has length 45 [2019-11-20 01:16:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:18,764 INFO L462 AbstractCegarLoop]: Abstraction has 45007 states and 162539 transitions. [2019-11-20 01:16:18,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:16:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 45007 states and 162539 transitions. [2019-11-20 01:16:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:18,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:18,775 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] [2019-11-20 01:16:18,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:18,976 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash -684053736, now seen corresponding path program 1 times [2019-11-20 01:16:18,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:18,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9755093] [2019-11-20 01:16:18,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:19,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9755093] [2019-11-20 01:16:19,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157304152] [2019-11-20 01:16:19,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:19,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:16:19,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:19,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:19,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:19,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 01:16:19,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963604120] [2019-11-20 01:16:19,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:16:19,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:19,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:16:19,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:16:19,304 INFO L87 Difference]: Start difference. First operand 45007 states and 162539 transitions. Second operand 18 states. [2019-11-20 01:16:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:20,037 INFO L93 Difference]: Finished difference Result 75575 states and 266903 transitions. [2019-11-20 01:16:20,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:20,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-20 01:16:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:20,189 INFO L225 Difference]: With dead ends: 75575 [2019-11-20 01:16:20,189 INFO L226 Difference]: Without dead ends: 72639 [2019-11-20 01:16:20,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-20 01:16:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72639 states. [2019-11-20 01:16:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72639 to 44563. [2019-11-20 01:16:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44563 states. [2019-11-20 01:16:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44563 states to 44563 states and 160659 transitions. [2019-11-20 01:16:21,219 INFO L78 Accepts]: Start accepts. Automaton has 44563 states and 160659 transitions. Word has length 45 [2019-11-20 01:16:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:21,219 INFO L462 AbstractCegarLoop]: Abstraction has 44563 states and 160659 transitions. [2019-11-20 01:16:21,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:16:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 44563 states and 160659 transitions. [2019-11-20 01:16:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:21,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:21,230 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] [2019-11-20 01:16:21,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:21,430 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:21,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:21,431 INFO L82 PathProgramCache]: Analyzing trace with hash 17695511, now seen corresponding path program 2 times [2019-11-20 01:16:21,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:21,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490465668] [2019-11-20 01:16:21,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:21,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490465668] [2019-11-20 01:16:21,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:21,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:21,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164433318] [2019-11-20 01:16:21,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:21,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:21,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:21,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:21,526 INFO L87 Difference]: Start difference. First operand 44563 states and 160659 transitions. Second operand 10 states. [2019-11-20 01:16:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:22,101 INFO L93 Difference]: Finished difference Result 73359 states and 258719 transitions. [2019-11-20 01:16:22,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:22,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:22,247 INFO L225 Difference]: With dead ends: 73359 [2019-11-20 01:16:22,247 INFO L226 Difference]: Without dead ends: 70279 [2019-11-20 01:16:22,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70279 states. [2019-11-20 01:16:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70279 to 41903. [2019-11-20 01:16:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41903 states. [2019-11-20 01:16:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41903 states to 41903 states and 151007 transitions. [2019-11-20 01:16:23,216 INFO L78 Accepts]: Start accepts. Automaton has 41903 states and 151007 transitions. Word has length 45 [2019-11-20 01:16:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:23,217 INFO L462 AbstractCegarLoop]: Abstraction has 41903 states and 151007 transitions. [2019-11-20 01:16:23,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 41903 states and 151007 transitions. [2019-11-20 01:16:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:23,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:23,227 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] [2019-11-20 01:16:23,227 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:23,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:23,228 INFO L82 PathProgramCache]: Analyzing trace with hash -658162214, now seen corresponding path program 2 times [2019-11-20 01:16:23,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:23,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453002668] [2019-11-20 01:16:23,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:23,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453002668] [2019-11-20 01:16:23,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:23,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:23,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291486290] [2019-11-20 01:16:23,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:23,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:23,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:23,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:23,324 INFO L87 Difference]: Start difference. First operand 41903 states and 151007 transitions. Second operand 10 states. [2019-11-20 01:16:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:24,108 INFO L93 Difference]: Finished difference Result 69859 states and 246183 transitions. [2019-11-20 01:16:24,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:24,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:24,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:24,244 INFO L225 Difference]: With dead ends: 69859 [2019-11-20 01:16:24,244 INFO L226 Difference]: Without dead ends: 66259 [2019-11-20 01:16:24,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66259 states. [2019-11-20 01:16:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66259 to 38187. [2019-11-20 01:16:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38187 states. [2019-11-20 01:16:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38187 states to 38187 states and 137893 transitions. [2019-11-20 01:16:25,163 INFO L78 Accepts]: Start accepts. Automaton has 38187 states and 137893 transitions. Word has length 45 [2019-11-20 01:16:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:25,164 INFO L462 AbstractCegarLoop]: Abstraction has 38187 states and 137893 transitions. [2019-11-20 01:16:25,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 38187 states and 137893 transitions. [2019-11-20 01:16:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:25,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:25,178 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] [2019-11-20 01:16:25,178 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:25,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:25,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1802843973, now seen corresponding path program 1 times [2019-11-20 01:16:25,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:25,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414233131] [2019-11-20 01:16:25,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:25,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414233131] [2019-11-20 01:16:25,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:25,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:25,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156456035] [2019-11-20 01:16:25,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:25,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:25,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:25,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:25,297 INFO L87 Difference]: Start difference. First operand 38187 states and 137893 transitions. Second operand 10 states. [2019-11-20 01:16:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:25,886 INFO L93 Difference]: Finished difference Result 65083 states and 229373 transitions. [2019-11-20 01:16:25,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:25,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:26,014 INFO L225 Difference]: With dead ends: 65083 [2019-11-20 01:16:26,014 INFO L226 Difference]: Without dead ends: 61627 [2019-11-20 01:16:26,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61627 states. [2019-11-20 01:16:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61627 to 38175. [2019-11-20 01:16:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38175 states. [2019-11-20 01:16:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38175 states to 38175 states and 137531 transitions. [2019-11-20 01:16:26,871 INFO L78 Accepts]: Start accepts. Automaton has 38175 states and 137531 transitions. Word has length 45 [2019-11-20 01:16:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:26,871 INFO L462 AbstractCegarLoop]: Abstraction has 38175 states and 137531 transitions. [2019-11-20 01:16:26,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 38175 states and 137531 transitions. [2019-11-20 01:16:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:26,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:26,884 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] [2019-11-20 01:16:26,884 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:26,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:26,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1824498791, now seen corresponding path program 2 times [2019-11-20 01:16:26,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:26,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206674796] [2019-11-20 01:16:26,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:26,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206674796] [2019-11-20 01:16:26,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:26,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:26,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812183712] [2019-11-20 01:16:26,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:26,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:26,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:26,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:26,966 INFO L87 Difference]: Start difference. First operand 38175 states and 137531 transitions. Second operand 10 states. [2019-11-20 01:16:27,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:27,535 INFO L93 Difference]: Finished difference Result 62107 states and 218571 transitions. [2019-11-20 01:16:27,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:27,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:27,655 INFO L225 Difference]: With dead ends: 62107 [2019-11-20 01:16:27,655 INFO L226 Difference]: Without dead ends: 58507 [2019-11-20 01:16:27,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58507 states. [2019-11-20 01:16:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58507 to 35263. [2019-11-20 01:16:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35263 states. [2019-11-20 01:16:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35263 states to 35263 states and 127053 transitions. [2019-11-20 01:16:28,423 INFO L78 Accepts]: Start accepts. Automaton has 35263 states and 127053 transitions. Word has length 45 [2019-11-20 01:16:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:28,423 INFO L462 AbstractCegarLoop]: Abstraction has 35263 states and 127053 transitions. [2019-11-20 01:16:28,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 35263 states and 127053 transitions. [2019-11-20 01:16:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:28,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:28,432 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] [2019-11-20 01:16:28,433 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:28,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1186801428, now seen corresponding path program 1 times [2019-11-20 01:16:28,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:28,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960359086] [2019-11-20 01:16:28,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:28,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960359086] [2019-11-20 01:16:28,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081876877] [2019-11-20 01:16:28,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:28,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:16:28,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:28,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:28,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:28,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 01:16:28,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56992543] [2019-11-20 01:16:28,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:16:28,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:28,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:16:28,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:16:28,764 INFO L87 Difference]: Start difference. First operand 35263 states and 127053 transitions. Second operand 18 states. [2019-11-20 01:16:29,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:29,845 INFO L93 Difference]: Finished difference Result 58627 states and 206125 transitions. [2019-11-20 01:16:29,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:29,845 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-20 01:16:29,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:29,960 INFO L225 Difference]: With dead ends: 58627 [2019-11-20 01:16:29,961 INFO L226 Difference]: Without dead ends: 55691 [2019-11-20 01:16:29,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-20 01:16:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55691 states. [2019-11-20 01:16:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55691 to 34759. [2019-11-20 01:16:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34759 states. [2019-11-20 01:16:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34759 states to 34759 states and 124937 transitions. [2019-11-20 01:16:30,705 INFO L78 Accepts]: Start accepts. Automaton has 34759 states and 124937 transitions. Word has length 45 [2019-11-20 01:16:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:30,705 INFO L462 AbstractCegarLoop]: Abstraction has 34759 states and 124937 transitions. [2019-11-20 01:16:30,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:16:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 34759 states and 124937 transitions. [2019-11-20 01:16:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:30,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:30,716 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] [2019-11-20 01:16:30,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:30,916 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1345791157, now seen corresponding path program 1 times [2019-11-20 01:16:30,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:30,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642088415] [2019-11-20 01:16:30,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:31,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642088415] [2019-11-20 01:16:31,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538421288] [2019-11-20 01:16:31,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:31,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:16:31,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:31,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:31,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:31,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 01:16:31,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335322617] [2019-11-20 01:16:31,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:16:31,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:31,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:16:31,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:16:31,256 INFO L87 Difference]: Start difference. First operand 34759 states and 124937 transitions. Second operand 18 states. [2019-11-20 01:16:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:32,011 INFO L93 Difference]: Finished difference Result 54467 states and 191181 transitions. [2019-11-20 01:16:32,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:32,012 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-20 01:16:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:32,115 INFO L225 Difference]: With dead ends: 54467 [2019-11-20 01:16:32,115 INFO L226 Difference]: Without dead ends: 51531 [2019-11-20 01:16:32,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-20 01:16:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51531 states. [2019-11-20 01:16:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51531 to 34315. [2019-11-20 01:16:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34315 states. [2019-11-20 01:16:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34315 states to 34315 states and 123057 transitions. [2019-11-20 01:16:32,831 INFO L78 Accepts]: Start accepts. Automaton has 34315 states and 123057 transitions. Word has length 45 [2019-11-20 01:16:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:32,832 INFO L462 AbstractCegarLoop]: Abstraction has 34315 states and 123057 transitions. [2019-11-20 01:16:32,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:16:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 123057 transitions. [2019-11-20 01:16:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:32,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:32,841 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] [2019-11-20 01:16:33,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:33,045 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:33,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:33,045 INFO L82 PathProgramCache]: Analyzing trace with hash 704676266, now seen corresponding path program 2 times [2019-11-20 01:16:33,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:33,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146130231] [2019-11-20 01:16:33,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:33,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146130231] [2019-11-20 01:16:33,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:33,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:33,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190619397] [2019-11-20 01:16:33,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:33,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:33,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:33,158 INFO L87 Difference]: Start difference. First operand 34315 states and 123057 transitions. Second operand 10 states. [2019-11-20 01:16:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:33,811 INFO L93 Difference]: Finished difference Result 52251 states and 182997 transitions. [2019-11-20 01:16:33,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:33,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:33,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:33,916 INFO L225 Difference]: With dead ends: 52251 [2019-11-20 01:16:33,916 INFO L226 Difference]: Without dead ends: 49171 [2019-11-20 01:16:33,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49171 states. [2019-11-20 01:16:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49171 to 31655. [2019-11-20 01:16:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31655 states. [2019-11-20 01:16:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31655 states to 31655 states and 113405 transitions. [2019-11-20 01:16:34,655 INFO L78 Accepts]: Start accepts. Automaton has 31655 states and 113405 transitions. Word has length 45 [2019-11-20 01:16:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:34,655 INFO L462 AbstractCegarLoop]: Abstraction has 31655 states and 113405 transitions. [2019-11-20 01:16:34,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 31655 states and 113405 transitions. [2019-11-20 01:16:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:34,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:34,664 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] [2019-11-20 01:16:34,664 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:34,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:34,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1760597943, now seen corresponding path program 2 times [2019-11-20 01:16:34,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:34,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54724462] [2019-11-20 01:16:34,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:34,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54724462] [2019-11-20 01:16:34,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:34,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:34,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619728472] [2019-11-20 01:16:34,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:34,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:34,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:34,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:34,766 INFO L87 Difference]: Start difference. First operand 31655 states and 113405 transitions. Second operand 10 states. [2019-11-20 01:16:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:35,350 INFO L93 Difference]: Finished difference Result 48751 states and 170461 transitions. [2019-11-20 01:16:35,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:35,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:35,439 INFO L225 Difference]: With dead ends: 48751 [2019-11-20 01:16:35,439 INFO L226 Difference]: Without dead ends: 45151 [2019-11-20 01:16:35,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45151 states. [2019-11-20 01:16:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45151 to 27939. [2019-11-20 01:16:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27939 states. [2019-11-20 01:16:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27939 states to 27939 states and 100291 transitions. [2019-11-20 01:16:36,432 INFO L78 Accepts]: Start accepts. Automaton has 27939 states and 100291 transitions. Word has length 45 [2019-11-20 01:16:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:36,432 INFO L462 AbstractCegarLoop]: Abstraction has 27939 states and 100291 transitions. [2019-11-20 01:16:36,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27939 states and 100291 transitions. [2019-11-20 01:16:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:36,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:36,440 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] [2019-11-20 01:16:36,440 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:36,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1132434584, now seen corresponding path program 1 times [2019-11-20 01:16:36,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:36,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20917906] [2019-11-20 01:16:36,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:36,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20917906] [2019-11-20 01:16:36,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:36,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:36,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230089131] [2019-11-20 01:16:36,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:36,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:36,540 INFO L87 Difference]: Start difference. First operand 27939 states and 100291 transitions. Second operand 10 states. [2019-11-20 01:16:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:37,025 INFO L93 Difference]: Finished difference Result 43975 states and 153651 transitions. [2019-11-20 01:16:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 01:16:37,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:37,102 INFO L225 Difference]: With dead ends: 43975 [2019-11-20 01:16:37,102 INFO L226 Difference]: Without dead ends: 40519 [2019-11-20 01:16:37,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-20 01:16:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40519 states. [2019-11-20 01:16:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40519 to 27927. [2019-11-20 01:16:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27927 states. [2019-11-20 01:16:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27927 states to 27927 states and 99929 transitions. [2019-11-20 01:16:37,727 INFO L78 Accepts]: Start accepts. Automaton has 27927 states and 99929 transitions. Word has length 45 [2019-11-20 01:16:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:37,727 INFO L462 AbstractCegarLoop]: Abstraction has 27927 states and 99929 transitions. [2019-11-20 01:16:37,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 27927 states and 99929 transitions. [2019-11-20 01:16:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:16:37,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:37,736 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] [2019-11-20 01:16:37,736 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:37,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:37,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1062120296, now seen corresponding path program 2 times [2019-11-20 01:16:37,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:37,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302331715] [2019-11-20 01:16:37,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:16:37,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302331715] [2019-11-20 01:16:37,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:37,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 01:16:37,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963462665] [2019-11-20 01:16:37,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:16:37,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:37,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:16:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:16:37,819 INFO L87 Difference]: Start difference. First operand 27927 states and 99929 transitions. Second operand 10 states. [2019-11-20 01:16:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:38,286 INFO L93 Difference]: Finished difference Result 40999 states and 142849 transitions. [2019-11-20 01:16:38,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 01:16:38,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 01:16:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:38,359 INFO L225 Difference]: With dead ends: 40999 [2019-11-20 01:16:38,359 INFO L226 Difference]: Without dead ends: 37399 [2019-11-20 01:16:38,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-20 01:16:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37399 states. [2019-11-20 01:16:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37399 to 25015. [2019-11-20 01:16:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25015 states. [2019-11-20 01:16:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25015 states to 25015 states and 89451 transitions. [2019-11-20 01:16:38,934 INFO L78 Accepts]: Start accepts. Automaton has 25015 states and 89451 transitions. Word has length 45 [2019-11-20 01:16:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:38,935 INFO L462 AbstractCegarLoop]: Abstraction has 25015 states and 89451 transitions. [2019-11-20 01:16:38,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:16:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 25015 states and 89451 transitions. [2019-11-20 01:16:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:38,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:38,966 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:38,966 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:38,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:38,967 INFO L82 PathProgramCache]: Analyzing trace with hash 14016403, now seen corresponding path program 1 times [2019-11-20 01:16:38,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:38,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041250295] [2019-11-20 01:16:38,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:39,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041250295] [2019-11-20 01:16:39,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861121453] [2019-11-20 01:16:39,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:39,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:16:39,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:39,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:39,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:39,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 01:16:39,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117987179] [2019-11-20 01:16:39,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:16:39,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:39,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:16:39,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:39,371 INFO L87 Difference]: Start difference. First operand 25015 states and 89451 transitions. Second operand 22 states. [2019-11-20 01:16:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:40,305 INFO L93 Difference]: Finished difference Result 39679 states and 137887 transitions. [2019-11-20 01:16:40,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:40,305 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 01:16:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:40,378 INFO L225 Difference]: With dead ends: 39679 [2019-11-20 01:16:40,378 INFO L226 Difference]: Without dead ends: 38335 [2019-11-20 01:16:40,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 01:16:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38335 states. [2019-11-20 01:16:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38335 to 24807. [2019-11-20 01:16:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24807 states. [2019-11-20 01:16:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24807 states to 24807 states and 88511 transitions. [2019-11-20 01:16:40,921 INFO L78 Accepts]: Start accepts. Automaton has 24807 states and 88511 transitions. Word has length 56 [2019-11-20 01:16:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:40,921 INFO L462 AbstractCegarLoop]: Abstraction has 24807 states and 88511 transitions. [2019-11-20 01:16:40,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:16:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24807 states and 88511 transitions. [2019-11-20 01:16:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:40,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:40,947 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:41,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:41,149 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2086396013, now seen corresponding path program 2 times [2019-11-20 01:16:41,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:41,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560182399] [2019-11-20 01:16:41,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:41,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560182399] [2019-11-20 01:16:41,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481456247] [2019-11-20 01:16:41,276 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:41,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:16:41,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:16:41,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:16:41,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:41,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:41,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:41,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 01:16:41,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384257050] [2019-11-20 01:16:41,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:16:41,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:41,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:16:41,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:41,591 INFO L87 Difference]: Start difference. First operand 24807 states and 88511 transitions. Second operand 22 states. [2019-11-20 01:16:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:42,516 INFO L93 Difference]: Finished difference Result 38095 states and 132395 transitions. [2019-11-20 01:16:42,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:42,518 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 01:16:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:42,583 INFO L225 Difference]: With dead ends: 38095 [2019-11-20 01:16:42,583 INFO L226 Difference]: Without dead ends: 35647 [2019-11-20 01:16:42,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 01:16:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35647 states. [2019-11-20 01:16:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35647 to 23495. [2019-11-20 01:16:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23495 states. [2019-11-20 01:16:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23495 states to 23495 states and 83611 transitions. [2019-11-20 01:16:43,076 INFO L78 Accepts]: Start accepts. Automaton has 23495 states and 83611 transitions. Word has length 56 [2019-11-20 01:16:43,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:43,076 INFO L462 AbstractCegarLoop]: Abstraction has 23495 states and 83611 transitions. [2019-11-20 01:16:43,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:16:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 23495 states and 83611 transitions. [2019-11-20 01:16:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:43,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:43,105 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:43,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:43,306 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:43,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash -315074445, now seen corresponding path program 3 times [2019-11-20 01:16:43,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:43,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912763855] [2019-11-20 01:16:43,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:16:43,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912763855] [2019-11-20 01:16:43,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:43,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:16:43,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605827672] [2019-11-20 01:16:43,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:43,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:43,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:43,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:43,394 INFO L87 Difference]: Start difference. First operand 23495 states and 83611 transitions. Second operand 12 states. [2019-11-20 01:16:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:44,081 INFO L93 Difference]: Finished difference Result 35407 states and 122943 transitions. [2019-11-20 01:16:44,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:44,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:16:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:44,142 INFO L225 Difference]: With dead ends: 35407 [2019-11-20 01:16:44,142 INFO L226 Difference]: Without dead ends: 34063 [2019-11-20 01:16:44,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:16:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34063 states. [2019-11-20 01:16:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34063 to 22751. [2019-11-20 01:16:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22751 states. [2019-11-20 01:16:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22751 states to 22751 states and 80883 transitions. [2019-11-20 01:16:44,615 INFO L78 Accepts]: Start accepts. Automaton has 22751 states and 80883 transitions. Word has length 56 [2019-11-20 01:16:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:44,616 INFO L462 AbstractCegarLoop]: Abstraction has 22751 states and 80883 transitions. [2019-11-20 01:16:44,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:16:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 22751 states and 80883 transitions. [2019-11-20 01:16:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:44,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:44,641 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:44,641 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:44,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:44,641 INFO L82 PathProgramCache]: Analyzing trace with hash 910686323, now seen corresponding path program 4 times [2019-11-20 01:16:44,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:44,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402374818] [2019-11-20 01:16:44,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:16:44,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402374818] [2019-11-20 01:16:44,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:44,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:16:44,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843565453] [2019-11-20 01:16:44,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:44,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:44,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:44,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:44,756 INFO L87 Difference]: Start difference. First operand 22751 states and 80883 transitions. Second operand 12 states. [2019-11-20 01:16:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:45,327 INFO L93 Difference]: Finished difference Result 34663 states and 120215 transitions. [2019-11-20 01:16:45,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:45,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:16:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:45,388 INFO L225 Difference]: With dead ends: 34663 [2019-11-20 01:16:45,388 INFO L226 Difference]: Without dead ends: 32215 [2019-11-20 01:16:45,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:16:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32215 states. [2019-11-20 01:16:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32215 to 21439. [2019-11-20 01:16:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21439 states. [2019-11-20 01:16:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21439 states to 21439 states and 75983 transitions. [2019-11-20 01:16:45,850 INFO L78 Accepts]: Start accepts. Automaton has 21439 states and 75983 transitions. Word has length 56 [2019-11-20 01:16:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:45,850 INFO L462 AbstractCegarLoop]: Abstraction has 21439 states and 75983 transitions. [2019-11-20 01:16:45,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:16:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 21439 states and 75983 transitions. [2019-11-20 01:16:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:45,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:45,871 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:45,872 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:45,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:45,872 INFO L82 PathProgramCache]: Analyzing trace with hash -168851341, now seen corresponding path program 5 times [2019-11-20 01:16:45,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:45,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254958988] [2019-11-20 01:16:45,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:16:45,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254958988] [2019-11-20 01:16:45,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:45,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:16:45,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414244583] [2019-11-20 01:16:45,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:45,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:45,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:45,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:45,996 INFO L87 Difference]: Start difference. First operand 21439 states and 75983 transitions. Second operand 12 states. [2019-11-20 01:16:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:46,567 INFO L93 Difference]: Finished difference Result 31975 states and 110763 transitions. [2019-11-20 01:16:46,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:46,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:16:46,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:46,623 INFO L225 Difference]: With dead ends: 31975 [2019-11-20 01:16:46,623 INFO L226 Difference]: Without dead ends: 30631 [2019-11-20 01:16:46,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:16:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30631 states. [2019-11-20 01:16:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30631 to 20695. [2019-11-20 01:16:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20695 states. [2019-11-20 01:16:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20695 states to 20695 states and 73255 transitions. [2019-11-20 01:16:47,058 INFO L78 Accepts]: Start accepts. Automaton has 20695 states and 73255 transitions. Word has length 56 [2019-11-20 01:16:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:47,058 INFO L462 AbstractCegarLoop]: Abstraction has 20695 states and 73255 transitions. [2019-11-20 01:16:47,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:16:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 20695 states and 73255 transitions. [2019-11-20 01:16:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:47,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:47,079 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:47,079 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1048983667, now seen corresponding path program 6 times [2019-11-20 01:16:47,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:47,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534830378] [2019-11-20 01:16:47,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:16:47,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534830378] [2019-11-20 01:16:47,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:47,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:16:47,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064804472] [2019-11-20 01:16:47,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:47,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:47,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:47,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:47,192 INFO L87 Difference]: Start difference. First operand 20695 states and 73255 transitions. Second operand 12 states. [2019-11-20 01:16:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:47,775 INFO L93 Difference]: Finished difference Result 30391 states and 105271 transitions. [2019-11-20 01:16:47,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:47,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:16:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:47,823 INFO L225 Difference]: With dead ends: 30391 [2019-11-20 01:16:47,823 INFO L226 Difference]: Without dead ends: 26619 [2019-11-20 01:16:47,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:16:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26619 states. [2019-11-20 01:16:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26619 to 16683. [2019-11-20 01:16:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16683 states. [2019-11-20 01:16:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16683 states to 16683 states and 59640 transitions. [2019-11-20 01:16:48,172 INFO L78 Accepts]: Start accepts. Automaton has 16683 states and 59640 transitions. Word has length 56 [2019-11-20 01:16:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:48,172 INFO L462 AbstractCegarLoop]: Abstraction has 16683 states and 59640 transitions. [2019-11-20 01:16:48,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:16:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 16683 states and 59640 transitions. [2019-11-20 01:16:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:48,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:48,189 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:48,191 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash 584450474, now seen corresponding path program 1 times [2019-11-20 01:16:48,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:48,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846908915] [2019-11-20 01:16:48,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:48,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846908915] [2019-11-20 01:16:48,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068066207] [2019-11-20 01:16:48,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:48,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:16:48,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:48,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:48,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:48,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 01:16:48,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689670760] [2019-11-20 01:16:48,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:16:48,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:16:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:48,518 INFO L87 Difference]: Start difference. First operand 16683 states and 59640 transitions. Second operand 22 states. [2019-11-20 01:16:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:49,293 INFO L93 Difference]: Finished difference Result 26379 states and 91656 transitions. [2019-11-20 01:16:49,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:49,293 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 01:16:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:49,338 INFO L225 Difference]: With dead ends: 26379 [2019-11-20 01:16:49,338 INFO L226 Difference]: Without dead ends: 25035 [2019-11-20 01:16:49,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 01:16:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25035 states. [2019-11-20 01:16:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25035 to 16475. [2019-11-20 01:16:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16475 states. [2019-11-20 01:16:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16475 states to 16475 states and 58700 transitions. [2019-11-20 01:16:49,684 INFO L78 Accepts]: Start accepts. Automaton has 16475 states and 58700 transitions. Word has length 56 [2019-11-20 01:16:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:49,684 INFO L462 AbstractCegarLoop]: Abstraction has 16475 states and 58700 transitions. [2019-11-20 01:16:49,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:16:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 16475 states and 58700 transitions. [2019-11-20 01:16:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:49,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:49,702 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:49,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:49,903 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash 562795656, now seen corresponding path program 2 times [2019-11-20 01:16:49,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:49,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164142297] [2019-11-20 01:16:49,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:50,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164142297] [2019-11-20 01:16:50,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641675146] [2019-11-20 01:16:50,021 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:50,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:16:50,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:16:50,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:16:50,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:50,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:50,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:50,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 01:16:50,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422692183] [2019-11-20 01:16:50,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:16:50,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:50,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:16:50,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:50,344 INFO L87 Difference]: Start difference. First operand 16475 states and 58700 transitions. Second operand 22 states. [2019-11-20 01:16:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:51,253 INFO L93 Difference]: Finished difference Result 24795 states and 86164 transitions. [2019-11-20 01:16:51,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:51,254 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 01:16:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:51,293 INFO L225 Difference]: With dead ends: 24795 [2019-11-20 01:16:51,293 INFO L226 Difference]: Without dead ends: 22347 [2019-11-20 01:16:51,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 01:16:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2019-11-20 01:16:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 15163. [2019-11-20 01:16:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-11-20 01:16:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 53800 transitions. [2019-11-20 01:16:51,755 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 53800 transitions. Word has length 56 [2019-11-20 01:16:51,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:51,755 INFO L462 AbstractCegarLoop]: Abstraction has 15163 states and 53800 transitions. [2019-11-20 01:16:51,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:16:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 53800 transitions. [2019-11-20 01:16:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:51,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:51,772 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:51,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:51,973 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:51,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1027431222, now seen corresponding path program 3 times [2019-11-20 01:16:51,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:51,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342171732] [2019-11-20 01:16:51,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:16:52,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342171732] [2019-11-20 01:16:52,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:52,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:16:52,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041547355] [2019-11-20 01:16:52,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:52,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:52,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:52,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:52,072 INFO L87 Difference]: Start difference. First operand 15163 states and 53800 transitions. Second operand 12 states. [2019-11-20 01:16:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:52,527 INFO L93 Difference]: Finished difference Result 22107 states and 76712 transitions. [2019-11-20 01:16:52,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:52,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:16:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:52,562 INFO L225 Difference]: With dead ends: 22107 [2019-11-20 01:16:52,562 INFO L226 Difference]: Without dead ends: 20763 [2019-11-20 01:16:52,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:16:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20763 states. [2019-11-20 01:16:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20763 to 14419. [2019-11-20 01:16:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14419 states. [2019-11-20 01:16:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14419 states to 14419 states and 51072 transitions. [2019-11-20 01:16:52,859 INFO L78 Accepts]: Start accepts. Automaton has 14419 states and 51072 transitions. Word has length 56 [2019-11-20 01:16:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:52,859 INFO L462 AbstractCegarLoop]: Abstraction has 14419 states and 51072 transitions. [2019-11-20 01:16:52,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:16:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 14419 states and 51072 transitions. [2019-11-20 01:16:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:52,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:52,874 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:52,874 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:52,874 INFO L82 PathProgramCache]: Analyzing trace with hash -978875096, now seen corresponding path program 4 times [2019-11-20 01:16:52,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:52,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22491216] [2019-11-20 01:16:52,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:16:52,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22491216] [2019-11-20 01:16:52,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:52,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:16:52,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455825311] [2019-11-20 01:16:52,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:52,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:52,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:52,980 INFO L87 Difference]: Start difference. First operand 14419 states and 51072 transitions. Second operand 12 states. [2019-11-20 01:16:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:53,467 INFO L93 Difference]: Finished difference Result 21363 states and 73984 transitions. [2019-11-20 01:16:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:53,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:16:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:53,499 INFO L225 Difference]: With dead ends: 21363 [2019-11-20 01:16:53,499 INFO L226 Difference]: Without dead ends: 18915 [2019-11-20 01:16:53,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:16:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18915 states. [2019-11-20 01:16:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18915 to 13107. [2019-11-20 01:16:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13107 states. [2019-11-20 01:16:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13107 states to 13107 states and 46172 transitions. [2019-11-20 01:16:53,748 INFO L78 Accepts]: Start accepts. Automaton has 13107 states and 46172 transitions. Word has length 56 [2019-11-20 01:16:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:53,748 INFO L462 AbstractCegarLoop]: Abstraction has 13107 states and 46172 transitions. [2019-11-20 01:16:53,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:16:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 13107 states and 46172 transitions. [2019-11-20 01:16:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:53,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:53,760 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:53,760 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:53,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1532153722, now seen corresponding path program 5 times [2019-11-20 01:16:53,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:53,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737811265] [2019-11-20 01:16:53,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:16:53,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737811265] [2019-11-20 01:16:53,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:53,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:16:53,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495195788] [2019-11-20 01:16:53,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:53,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:53,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:53,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:53,872 INFO L87 Difference]: Start difference. First operand 13107 states and 46172 transitions. Second operand 12 states. [2019-11-20 01:16:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:54,340 INFO L93 Difference]: Finished difference Result 18675 states and 64532 transitions. [2019-11-20 01:16:54,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:54,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:16:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:54,369 INFO L225 Difference]: With dead ends: 18675 [2019-11-20 01:16:54,369 INFO L226 Difference]: Without dead ends: 17331 [2019-11-20 01:16:54,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:16:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17331 states. [2019-11-20 01:16:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17331 to 12363. [2019-11-20 01:16:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12363 states. [2019-11-20 01:16:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12363 states to 12363 states and 43444 transitions. [2019-11-20 01:16:54,599 INFO L78 Accepts]: Start accepts. Automaton has 12363 states and 43444 transitions. Word has length 56 [2019-11-20 01:16:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:54,599 INFO L462 AbstractCegarLoop]: Abstraction has 12363 states and 43444 transitions. [2019-11-20 01:16:54,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:16:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 12363 states and 43444 transitions. [2019-11-20 01:16:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:54,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:54,609 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:54,609 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash -314318714, now seen corresponding path program 6 times [2019-11-20 01:16:54,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:54,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953602993] [2019-11-20 01:16:54,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:16:54,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953602993] [2019-11-20 01:16:54,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:54,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:16:54,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231304400] [2019-11-20 01:16:54,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:54,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:54,732 INFO L87 Difference]: Start difference. First operand 12363 states and 43444 transitions. Second operand 12 states. [2019-11-20 01:16:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:55,181 INFO L93 Difference]: Finished difference Result 17091 states and 59040 transitions. [2019-11-20 01:16:55,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:55,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:16:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:55,205 INFO L225 Difference]: With dead ends: 17091 [2019-11-20 01:16:55,205 INFO L226 Difference]: Without dead ends: 13319 [2019-11-20 01:16:55,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:16:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13319 states. [2019-11-20 01:16:55,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13319 to 8351. [2019-11-20 01:16:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8351 states. [2019-11-20 01:16:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8351 states to 8351 states and 29829 transitions. [2019-11-20 01:16:55,375 INFO L78 Accepts]: Start accepts. Automaton has 8351 states and 29829 transitions. Word has length 56 [2019-11-20 01:16:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:55,375 INFO L462 AbstractCegarLoop]: Abstraction has 8351 states and 29829 transitions. [2019-11-20 01:16:55,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:16:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 8351 states and 29829 transitions. [2019-11-20 01:16:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:55,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:55,384 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:55,384 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1621630509, now seen corresponding path program 1 times [2019-11-20 01:16:55,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:55,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712914384] [2019-11-20 01:16:55,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:55,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712914384] [2019-11-20 01:16:55,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137542761] [2019-11-20 01:16:55,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:55,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:16:55,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:55,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:55,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:55,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 01:16:55,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406882675] [2019-11-20 01:16:55,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:16:55,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:55,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:16:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:55,767 INFO L87 Difference]: Start difference. First operand 8351 states and 29829 transitions. Second operand 22 states. [2019-11-20 01:16:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:56,631 INFO L93 Difference]: Finished difference Result 13079 states and 45425 transitions. [2019-11-20 01:16:56,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 01:16:56,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 01:16:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:56,657 INFO L225 Difference]: With dead ends: 13079 [2019-11-20 01:16:56,658 INFO L226 Difference]: Without dead ends: 11735 [2019-11-20 01:16:56,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 01:16:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11735 states. [2019-11-20 01:16:56,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11735 to 8143. [2019-11-20 01:16:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8143 states. [2019-11-20 01:16:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8143 states to 8143 states and 28889 transitions. [2019-11-20 01:16:56,876 INFO L78 Accepts]: Start accepts. Automaton has 8143 states and 28889 transitions. Word has length 56 [2019-11-20 01:16:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:56,878 INFO L462 AbstractCegarLoop]: Abstraction has 8143 states and 28889 transitions. [2019-11-20 01:16:56,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:16:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 8143 states and 28889 transitions. [2019-11-20 01:16:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:56,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:56,891 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:57,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:57,103 INFO L410 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash -478781907, now seen corresponding path program 2 times [2019-11-20 01:16:57,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:57,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171026994] [2019-11-20 01:16:57,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:57,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171026994] [2019-11-20 01:16:57,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377388631] [2019-11-20 01:16:57,226 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:57,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:16:57,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:16:57,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:16:57,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:57,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:16:57,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:57,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 01:16:57,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309019397] [2019-11-20 01:16:57,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:16:57,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:57,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:16:57,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:16:57,516 INFO L87 Difference]: Start difference. First operand 8143 states and 28889 transitions. Second operand 22 states. [2019-11-20 01:16:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:58,346 INFO L93 Difference]: Finished difference Result 11495 states and 39933 transitions. [2019-11-20 01:16:58,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 01:16:58,347 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 01:16:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:58,366 INFO L225 Difference]: With dead ends: 11495 [2019-11-20 01:16:58,366 INFO L226 Difference]: Without dead ends: 9047 [2019-11-20 01:16:58,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-11-20 01:16:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9047 states. [2019-11-20 01:16:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9047 to 6831. [2019-11-20 01:16:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6831 states. [2019-11-20 01:16:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6831 states to 6831 states and 23989 transitions. [2019-11-20 01:16:58,485 INFO L78 Accepts]: Start accepts. Automaton has 6831 states and 23989 transitions. Word has length 56 [2019-11-20 01:16:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:58,485 INFO L462 AbstractCegarLoop]: Abstraction has 6831 states and 23989 transitions. [2019-11-20 01:16:58,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:16:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6831 states and 23989 transitions. [2019-11-20 01:16:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:58,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:58,491 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:58,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:16:58,692 INFO L410 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:58,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1292539661, now seen corresponding path program 3 times [2019-11-20 01:16:58,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:58,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341283615] [2019-11-20 01:16:58,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:16:58,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341283615] [2019-11-20 01:16:58,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:58,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:16:58,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610386408] [2019-11-20 01:16:58,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:58,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:58,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:58,801 INFO L87 Difference]: Start difference. First operand 6831 states and 23989 transitions. Second operand 12 states. [2019-11-20 01:16:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:59,259 INFO L93 Difference]: Finished difference Result 8807 states and 30481 transitions. [2019-11-20 01:16:59,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:59,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:16:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:59,275 INFO L225 Difference]: With dead ends: 8807 [2019-11-20 01:16:59,275 INFO L226 Difference]: Without dead ends: 7463 [2019-11-20 01:16:59,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-11-20 01:16:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2019-11-20 01:16:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6087. [2019-11-20 01:16:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6087 states. [2019-11-20 01:16:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6087 states to 6087 states and 21261 transitions. [2019-11-20 01:16:59,421 INFO L78 Accepts]: Start accepts. Automaton has 6087 states and 21261 transitions. Word has length 56 [2019-11-20 01:16:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:59,421 INFO L462 AbstractCegarLoop]: Abstraction has 6087 states and 21261 transitions. [2019-11-20 01:16:59,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:16:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6087 states and 21261 transitions. [2019-11-20 01:16:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:16:59,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:59,431 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:16:59,431 INFO L410 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1776666867, now seen corresponding path program 4 times [2019-11-20 01:16:59,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:59,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816013372] [2019-11-20 01:16:59,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:16:59,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816013372] [2019-11-20 01:16:59,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:59,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:16:59,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438555946] [2019-11-20 01:16:59,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:59,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:59,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:59,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:59,588 INFO L87 Difference]: Start difference. First operand 6087 states and 21261 transitions. Second operand 12 states. [2019-11-20 01:16:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:59,944 INFO L93 Difference]: Finished difference Result 8063 states and 27753 transitions. [2019-11-20 01:16:59,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:16:59,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:16:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:59,952 INFO L225 Difference]: With dead ends: 8063 [2019-11-20 01:16:59,953 INFO L226 Difference]: Without dead ends: 5615 [2019-11-20 01:16:59,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-11-20 01:16:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5615 states. [2019-11-20 01:17:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5615 to 4775. [2019-11-20 01:17:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4775 states. [2019-11-20 01:17:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 16361 transitions. [2019-11-20 01:17:00,026 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 16361 transitions. Word has length 56 [2019-11-20 01:17:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:00,026 INFO L462 AbstractCegarLoop]: Abstraction has 4775 states and 16361 transitions. [2019-11-20 01:17:00,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:17:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 16361 transitions. [2019-11-20 01:17:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:17:00,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:00,030 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:17:00,031 INFO L410 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:17:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:00,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1438762765, now seen corresponding path program 5 times [2019-11-20 01:17:00,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:00,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834429806] [2019-11-20 01:17:00,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:17:00,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834429806] [2019-11-20 01:17:00,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:00,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:17:00,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762590188] [2019-11-20 01:17:00,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:17:00,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:00,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:17:00,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:17:00,159 INFO L87 Difference]: Start difference. First operand 4775 states and 16361 transitions. Second operand 12 states. [2019-11-20 01:17:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:00,499 INFO L93 Difference]: Finished difference Result 5375 states and 18301 transitions. [2019-11-20 01:17:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:17:00,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:17:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:00,507 INFO L225 Difference]: With dead ends: 5375 [2019-11-20 01:17:00,508 INFO L226 Difference]: Without dead ends: 4031 [2019-11-20 01:17:00,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:17:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2019-11-20 01:17:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 4031. [2019-11-20 01:17:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-11-20 01:17:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 13633 transitions. [2019-11-20 01:17:00,566 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 13633 transitions. Word has length 56 [2019-11-20 01:17:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:00,566 INFO L462 AbstractCegarLoop]: Abstraction has 4031 states and 13633 transitions. [2019-11-20 01:17:00,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:17:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 13633 transitions. [2019-11-20 01:17:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:17:00,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:00,570 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:17:00,570 INFO L410 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:17:00,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1638369523, now seen corresponding path program 6 times [2019-11-20 01:17:00,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:00,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66374094] [2019-11-20 01:17:00,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:17:00,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66374094] [2019-11-20 01:17:00,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:00,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 01:17:00,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357059848] [2019-11-20 01:17:00,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:17:00,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:00,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:17:00,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:17:00,698 INFO L87 Difference]: Start difference. First operand 4031 states and 13633 transitions. Second operand 12 states. [2019-11-20 01:17:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:00,970 INFO L93 Difference]: Finished difference Result 3791 states and 12809 transitions. [2019-11-20 01:17:00,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 01:17:00,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 01:17:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:00,971 INFO L225 Difference]: With dead ends: 3791 [2019-11-20 01:17:00,971 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 01:17:00,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-20 01:17:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 01:17:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 01:17:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 01:17:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 01:17:00,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-20 01:17:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:00,972 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 01:17:00,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:17:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 01:17:00,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 01:17:00,975 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-20 01:17:00,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:17:00 BasicIcfg [2019-11-20 01:17:00,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:17:00,977 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:17:00,977 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:17:00,978 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:17:00,978 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:14:35" (3/4) ... [2019-11-20 01:17:00,982 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 01:17:00,988 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-20 01:17:00,989 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-20 01:17:01,006 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-20 01:17:01,007 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 01:17:01,007 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 01:17:01,051 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_00ec53d5-45dd-4485-b1ac-f57f6c1128a0/bin/uautomizer/witness.graphml [2019-11-20 01:17:01,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:17:01,052 INFO L168 Benchmark]: Toolchain (without parser) took 146134.18 ms. Allocated memory was 1.0 GB in the beginning and 6.2 GB in the end (delta: 5.2 GB). Free memory was 939.3 MB in the beginning and 1.9 GB in the end (delta: -942.5 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-11-20 01:17:01,053 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:17:01,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-20 01:17:01,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.16 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 01:17:01,054 INFO L168 Benchmark]: Boogie Preprocessor took 33.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:17:01,054 INFO L168 Benchmark]: RCFGBuilder took 344.81 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:17:01,055 INFO L168 Benchmark]: TraceAbstraction took 145031.49 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -825.4 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-11-20 01:17:01,055 INFO L168 Benchmark]: Witness Printer took 74.20 ms. Allocated memory is still 6.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:17:01,058 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 598.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.16 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 33.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 344.81 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 145031.49 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -825.4 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 74.20 ms. Allocated memory is still 6.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 96 locations, 4 error locations. Result: SAFE, OverallTime: 144.8s, OverallIterations: 48, TraceHistogramMax: 3, AutomataDifference: 40.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9328 SDtfs, 27799 SDslu, 53049 SDs, 0 SdLazy, 13522 SolverSat, 634 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1669 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 1087 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5995 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138880occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 58.4s AutomataMinimizationTime, 48 MinimizatonAttempts, 860814 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2805 NumberOfCodeBlocks, 2805 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2745 ConstructedInterpolants, 0 QuantifiedInterpolants, 645528 SizeOfPredicates, 108 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 60 InterpolantComputations, 36 PerfectInterpolantSequences, 252/384 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...