/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:48:17,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:48:17,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:48:17,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:48:17,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:48:17,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:48:17,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:48:17,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:48:17,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:48:17,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:48:17,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:48:17,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:48:17,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:48:17,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:48:17,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:48:17,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:48:17,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:48:17,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:48:17,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:48:17,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:48:17,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:48:17,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:48:17,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:48:17,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:48:17,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:48:17,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:48:17,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:48:17,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:48:17,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:48:17,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:48:17,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:48:17,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:48:17,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:48:17,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:48:17,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:48:17,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:48:17,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:48:17,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:48:17,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:48:17,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:48:17,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:48:17,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 00:48:17,700 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:48:17,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:48:17,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:48:17,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:48:17,702 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:48:17,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:48:17,702 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:48:17,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:48:17,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:48:17,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:48:17,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:48:17,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:48:17,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:48:17,704 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:48:17,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:48:17,704 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:48:17,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:48:17,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:48:17,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:48:17,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:48:17,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:48:17,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:48:17,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:48:17,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:48:17,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:48:17,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:48:17,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:48:17,706 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:48:17,707 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:48:17,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:48:17,707 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:48:17,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:48:18,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:48:18,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:48:18,011 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:48:18,011 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:48:18,012 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2020-10-06 00:48:18,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3001e850/40633e43939345c6bdcbd2f40adfd72c/FLAG119b88a2c [2020-10-06 00:48:18,611 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:48:18,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2020-10-06 00:48:18,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3001e850/40633e43939345c6bdcbd2f40adfd72c/FLAG119b88a2c [2020-10-06 00:48:18,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3001e850/40633e43939345c6bdcbd2f40adfd72c [2020-10-06 00:48:18,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:48:18,898 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:48:18,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:48:18,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:48:18,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:48:18,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:48:18" (1/1) ... [2020-10-06 00:48:18,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4775ff4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:18, skipping insertion in model container [2020-10-06 00:48:18,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:48:18" (1/1) ... [2020-10-06 00:48:18,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:48:18,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:48:19,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:48:19,560 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:48:19,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:48:19,780 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:48:19,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19 WrapperNode [2020-10-06 00:48:19,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:48:19,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:48:19,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:48:19,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:48:19,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (1/1) ... [2020-10-06 00:48:19,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (1/1) ... [2020-10-06 00:48:19,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:48:19,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:48:19,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:48:19,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:48:19,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (1/1) ... [2020-10-06 00:48:19,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (1/1) ... [2020-10-06 00:48:19,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (1/1) ... [2020-10-06 00:48:19,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (1/1) ... [2020-10-06 00:48:19,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (1/1) ... [2020-10-06 00:48:19,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (1/1) ... [2020-10-06 00:48:19,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (1/1) ... [2020-10-06 00:48:19,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:48:19,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:48:19,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:48:19,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:48:19,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-06 00:48:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:48:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 00:48:19,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:48:19,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:48:19,996 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 00:48:19,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 00:48:19,997 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 00:48:19,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 00:48:19,998 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 00:48:19,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 00:48:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 00:48:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:48:19,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:48:20,001 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:48:22,023 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:48:22,024 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 00:48:22,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:48:22 BoogieIcfgContainer [2020-10-06 00:48:22,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:48:22,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:48:22,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:48:22,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:48:22,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:48:18" (1/3) ... [2020-10-06 00:48:22,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee63511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:48:22, skipping insertion in model container [2020-10-06 00:48:22,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:48:19" (2/3) ... [2020-10-06 00:48:22,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee63511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:48:22, skipping insertion in model container [2020-10-06 00:48:22,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:48:22" (3/3) ... [2020-10-06 00:48:22,035 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.opt.i [2020-10-06 00:48:22,045 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:48:22,046 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:48:22,054 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:48:22,055 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:48:22,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,085 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,085 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,086 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,087 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,091 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,103 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,103 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,104 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,109 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:48:22,125 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 00:48:22,146 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:48:22,146 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:48:22,146 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:48:22,146 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:48:22,147 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:48:22,147 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:48:22,147 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:48:22,147 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:48:22,163 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-06 00:48:22,165 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-06 00:48:22,210 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-06 00:48:22,211 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:48:22,216 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-06 00:48:22,219 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-06 00:48:22,241 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-06 00:48:22,242 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:48:22,242 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-06 00:48:22,245 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1536 [2020-10-06 00:48:22,246 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:48:22,767 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-06 00:48:23,673 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-06 00:48:23,781 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-06 00:48:25,128 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-06 00:48:25,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-06 00:48:25,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:48:25,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-06 00:48:25,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:48:25,871 WARN L193 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 106 [2020-10-06 00:48:26,939 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-06 00:48:26,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-06 00:48:26,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:48:26,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-06 00:48:26,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:48:27,623 WARN L193 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2020-10-06 00:48:29,162 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-06 00:48:29,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-06 00:48:29,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:48:29,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-06 00:48:29,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:48:30,287 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-06 00:48:30,536 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-06 00:48:30,670 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-06 00:48:30,679 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4008 [2020-10-06 00:48:30,679 INFO L214 etLargeBlockEncoding]: Total number of compositions: 78 [2020-10-06 00:48:30,682 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-06 00:48:30,724 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-06 00:48:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-06 00:48:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-06 00:48:30,733 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:30,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:30,735 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:30,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1913445642, now seen corresponding path program 1 times [2020-10-06 00:48:30,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:30,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127826633] [2020-10-06 00:48:30,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:31,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127826633] [2020-10-06 00:48:31,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:31,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:48:31,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2036860122] [2020-10-06 00:48:31,035 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:31,038 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:31,052 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-06 00:48:31,052 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:31,057 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:48:31,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:48:31,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:31,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:48:31,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:48:31,075 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-06 00:48:31,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:31,162 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-06 00:48:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:48:31,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-06 00:48:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:31,198 INFO L225 Difference]: With dead ends: 550 [2020-10-06 00:48:31,198 INFO L226 Difference]: Without dead ends: 450 [2020-10-06 00:48:31,199 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:48:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-06 00:48:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-06 00:48:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-06 00:48:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-06 00:48:31,304 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-06 00:48:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:31,305 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-06 00:48:31,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:48:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-06 00:48:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 00:48:31,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:31,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:31,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:48:31,308 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash 575294358, now seen corresponding path program 1 times [2020-10-06 00:48:31,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:31,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027711774] [2020-10-06 00:48:31,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:31,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027711774] [2020-10-06 00:48:31,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:31,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:48:31,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1022586340] [2020-10-06 00:48:31,429 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:31,430 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:31,432 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 00:48:31,432 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:31,432 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:48:31,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:48:31,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:31,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:48:31,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:48:31,435 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-06 00:48:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:31,460 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-06 00:48:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:48:31,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 00:48:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:31,470 INFO L225 Difference]: With dead ends: 440 [2020-10-06 00:48:31,470 INFO L226 Difference]: Without dead ends: 440 [2020-10-06 00:48:31,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:48:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-06 00:48:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-06 00:48:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-06 00:48:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-06 00:48:31,520 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-06 00:48:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:31,521 INFO L479 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-06 00:48:31,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:48:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-06 00:48:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 00:48:31,522 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:31,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:31,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:48:31,522 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:31,523 INFO L82 PathProgramCache]: Analyzing trace with hash 654255379, now seen corresponding path program 1 times [2020-10-06 00:48:31,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:31,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028062284] [2020-10-06 00:48:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:31,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028062284] [2020-10-06 00:48:31,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:31,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:48:31,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1504461046] [2020-10-06 00:48:31,706 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:31,707 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:31,709 INFO L258 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-06 00:48:31,709 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:31,725 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 00:48:31,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:31,726 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:48:31,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:31,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:31,745 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 00:48:31,778 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:48:31,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:48:31,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:31,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:48:31,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:48:31,780 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-06 00:48:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:31,805 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-06 00:48:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:48:31,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-06 00:48:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:31,810 INFO L225 Difference]: With dead ends: 434 [2020-10-06 00:48:31,811 INFO L226 Difference]: Without dead ends: 434 [2020-10-06 00:48:31,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:48:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-06 00:48:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-06 00:48:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-06 00:48:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-06 00:48:31,828 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-06 00:48:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:31,828 INFO L479 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-06 00:48:31,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:48:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-06 00:48:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:48:31,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:31,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:31,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:48:31,831 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1192921599, now seen corresponding path program 1 times [2020-10-06 00:48:31,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:31,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9173357] [2020-10-06 00:48:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:31,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9173357] [2020-10-06 00:48:31,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:31,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:48:31,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [24677129] [2020-10-06 00:48:31,903 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:31,905 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:31,907 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-10-06 00:48:31,908 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:31,941 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:48:31,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:31,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:31,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:32,024 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:48:32,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:48:32,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:32,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:48:32,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:48:32,026 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 4 states. [2020-10-06 00:48:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:32,079 INFO L93 Difference]: Finished difference Result 438 states and 1309 transitions. [2020-10-06 00:48:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:48:32,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-06 00:48:32,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:32,084 INFO L225 Difference]: With dead ends: 438 [2020-10-06 00:48:32,084 INFO L226 Difference]: Without dead ends: 438 [2020-10-06 00:48:32,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:48:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-10-06 00:48:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2020-10-06 00:48:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-10-06 00:48:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1309 transitions. [2020-10-06 00:48:32,102 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1309 transitions. Word has length 11 [2020-10-06 00:48:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:32,102 INFO L479 AbstractCegarLoop]: Abstraction has 438 states and 1309 transitions. [2020-10-06 00:48:32,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:48:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1309 transitions. [2020-10-06 00:48:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:48:32,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:32,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:32,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:48:32,105 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:32,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1192920235, now seen corresponding path program 1 times [2020-10-06 00:48:32,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:32,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707975913] [2020-10-06 00:48:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:32,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707975913] [2020-10-06 00:48:32,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:32,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:48:32,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [773679855] [2020-10-06 00:48:32,363 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:32,365 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:32,369 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 21 transitions. [2020-10-06 00:48:32,369 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:32,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:32,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:32,381 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:48:32,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:32,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:32,538 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6806#(and (or (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0)) (<= ~y~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0))] [2020-10-06 00:48:32,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:48:32,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:48:32,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:48:32,540 INFO L87 Difference]: Start difference. First operand 438 states and 1309 transitions. Second operand 6 states. [2020-10-06 00:48:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:32,631 INFO L93 Difference]: Finished difference Result 426 states and 1265 transitions. [2020-10-06 00:48:32,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:48:32,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-06 00:48:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:32,636 INFO L225 Difference]: With dead ends: 426 [2020-10-06 00:48:32,637 INFO L226 Difference]: Without dead ends: 426 [2020-10-06 00:48:32,637 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:48:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-10-06 00:48:32,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-10-06 00:48:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-06 00:48:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1265 transitions. [2020-10-06 00:48:32,652 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1265 transitions. Word has length 11 [2020-10-06 00:48:32,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:32,653 INFO L479 AbstractCegarLoop]: Abstraction has 426 states and 1265 transitions. [2020-10-06 00:48:32,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:48:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1265 transitions. [2020-10-06 00:48:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:48:32,654 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:32,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:32,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:48:32,655 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:32,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:32,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1194181749, now seen corresponding path program 2 times [2020-10-06 00:48:32,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:32,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070269928] [2020-10-06 00:48:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:32,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070269928] [2020-10-06 00:48:32,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:32,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:48:32,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [442747556] [2020-10-06 00:48:32,821 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:32,823 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:32,827 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-10-06 00:48:32,828 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:32,848 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:48:32,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:48:32,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:32,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:48:32,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:48:32,850 INFO L87 Difference]: Start difference. First operand 426 states and 1265 transitions. Second operand 5 states. [2020-10-06 00:48:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:32,942 INFO L93 Difference]: Finished difference Result 422 states and 1250 transitions. [2020-10-06 00:48:32,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:48:32,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-06 00:48:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:32,946 INFO L225 Difference]: With dead ends: 422 [2020-10-06 00:48:32,947 INFO L226 Difference]: Without dead ends: 422 [2020-10-06 00:48:32,947 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:48:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-06 00:48:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 418. [2020-10-06 00:48:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-10-06 00:48:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1239 transitions. [2020-10-06 00:48:33,020 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1239 transitions. Word has length 11 [2020-10-06 00:48:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:33,020 INFO L479 AbstractCegarLoop]: Abstraction has 418 states and 1239 transitions. [2020-10-06 00:48:33,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:48:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1239 transitions. [2020-10-06 00:48:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:48:33,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:33,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:33,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:48:33,022 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1674134258, now seen corresponding path program 1 times [2020-10-06 00:48:33,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:33,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036591947] [2020-10-06 00:48:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:33,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036591947] [2020-10-06 00:48:33,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:33,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:48:33,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [73065752] [2020-10-06 00:48:33,175 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:33,177 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:33,180 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-10-06 00:48:33,180 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:33,189 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:48:33,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,227 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:48:33,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:48:33,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:33,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:48:33,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:48:33,229 INFO L87 Difference]: Start difference. First operand 418 states and 1239 transitions. Second operand 5 states. [2020-10-06 00:48:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:33,314 INFO L93 Difference]: Finished difference Result 430 states and 1268 transitions. [2020-10-06 00:48:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:48:33,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-06 00:48:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:33,320 INFO L225 Difference]: With dead ends: 430 [2020-10-06 00:48:33,320 INFO L226 Difference]: Without dead ends: 430 [2020-10-06 00:48:33,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:48:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-10-06 00:48:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2020-10-06 00:48:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-10-06 00:48:33,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1268 transitions. [2020-10-06 00:48:33,334 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1268 transitions. Word has length 12 [2020-10-06 00:48:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:33,334 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 1268 transitions. [2020-10-06 00:48:33,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:48:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1268 transitions. [2020-10-06 00:48:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:48:33,336 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:33,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:33,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:48:33,336 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:33,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:33,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1674135591, now seen corresponding path program 1 times [2020-10-06 00:48:33,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:33,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910114351] [2020-10-06 00:48:33,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:33,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910114351] [2020-10-06 00:48:33,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:33,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:48:33,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388501522] [2020-10-06 00:48:33,484 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:33,486 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:33,489 INFO L258 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-06 00:48:33,489 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:33,510 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:48:33,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,525 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:48:33,529 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-06 00:48:33,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,538 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:48:33,544 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:48:33,583 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10655#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0))] [2020-10-06 00:48:33,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:48:33,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:48:33,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:48:33,585 INFO L87 Difference]: Start difference. First operand 430 states and 1268 transitions. Second operand 7 states. [2020-10-06 00:48:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:33,703 INFO L93 Difference]: Finished difference Result 454 states and 1326 transitions. [2020-10-06 00:48:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:48:33,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-06 00:48:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:33,707 INFO L225 Difference]: With dead ends: 454 [2020-10-06 00:48:33,708 INFO L226 Difference]: Without dead ends: 454 [2020-10-06 00:48:33,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:48:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2020-10-06 00:48:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 446. [2020-10-06 00:48:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-10-06 00:48:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1308 transitions. [2020-10-06 00:48:33,722 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1308 transitions. Word has length 12 [2020-10-06 00:48:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:33,723 INFO L479 AbstractCegarLoop]: Abstraction has 446 states and 1308 transitions. [2020-10-06 00:48:33,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:48:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1308 transitions. [2020-10-06 00:48:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:48:33,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:33,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:33,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:48:33,725 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:33,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1634992418, now seen corresponding path program 2 times [2020-10-06 00:48:33,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:33,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726267820] [2020-10-06 00:48:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:33,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726267820] [2020-10-06 00:48:33,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:33,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:48:33,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875323687] [2020-10-06 00:48:33,915 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:33,916 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:33,918 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions. [2020-10-06 00:48:33,919 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:33,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-06 00:48:33,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:33,936 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-06 00:48:33,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:33,938 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:48:33,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:33,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:48:33,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:33,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:33,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:33,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:33,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:33,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:48:33,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,975 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:48:33,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,984 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:48:33,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:33,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-06 00:48:34,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-06 00:48:34,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,052 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:48:34,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,055 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:48:34,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:48:34,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:48:34,140 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:48:34,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-06 00:48:34,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-06 00:48:34,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,170 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:48:34,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,172 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:48:34,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,188 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:48:34,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:48:34,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:48:34,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:34,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:48:34,279 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:48:34,298 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:48:34,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:48:34,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:34,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:48:34,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:48:34,300 INFO L87 Difference]: Start difference. First operand 446 states and 1308 transitions. Second operand 6 states. [2020-10-06 00:48:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:34,357 INFO L93 Difference]: Finished difference Result 438 states and 1282 transitions. [2020-10-06 00:48:34,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:48:34,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-06 00:48:34,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:34,361 INFO L225 Difference]: With dead ends: 438 [2020-10-06 00:48:34,361 INFO L226 Difference]: Without dead ends: 438 [2020-10-06 00:48:34,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:48:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-10-06 00:48:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 426. [2020-10-06 00:48:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-06 00:48:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1253 transitions. [2020-10-06 00:48:34,377 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1253 transitions. Word has length 12 [2020-10-06 00:48:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:34,377 INFO L479 AbstractCegarLoop]: Abstraction has 426 states and 1253 transitions. [2020-10-06 00:48:34,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:48:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1253 transitions. [2020-10-06 00:48:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:48:34,379 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:34,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:34,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 00:48:34,379 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:34,380 INFO L82 PathProgramCache]: Analyzing trace with hash 358553942, now seen corresponding path program 1 times [2020-10-06 00:48:34,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:34,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66747875] [2020-10-06 00:48:34,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:34,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66747875] [2020-10-06 00:48:34,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:34,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:48:34,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1908433465] [2020-10-06 00:48:34,682 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:34,683 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:34,686 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-10-06 00:48:34,686 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:34,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,707 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:48:34,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:48:34,716 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 00:48:34,722 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:48:34,734 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:48:34,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:48:34,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:34,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:48:34,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:48:34,735 INFO L87 Difference]: Start difference. First operand 426 states and 1253 transitions. Second operand 7 states. [2020-10-06 00:48:34,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:34,903 INFO L93 Difference]: Finished difference Result 474 states and 1393 transitions. [2020-10-06 00:48:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:48:34,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-06 00:48:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:34,910 INFO L225 Difference]: With dead ends: 474 [2020-10-06 00:48:34,910 INFO L226 Difference]: Without dead ends: 474 [2020-10-06 00:48:34,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:48:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-10-06 00:48:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2020-10-06 00:48:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2020-10-06 00:48:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1393 transitions. [2020-10-06 00:48:34,933 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1393 transitions. Word has length 13 [2020-10-06 00:48:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:34,934 INFO L479 AbstractCegarLoop]: Abstraction has 474 states and 1393 transitions. [2020-10-06 00:48:34,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:48:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1393 transitions. [2020-10-06 00:48:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:48:34,936 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:34,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:34,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 00:48:34,936 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 358593932, now seen corresponding path program 2 times [2020-10-06 00:48:34,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:34,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503298890] [2020-10-06 00:48:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:35,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503298890] [2020-10-06 00:48:35,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:35,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:48:35,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2107768239] [2020-10-06 00:48:35,298 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:35,301 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:35,306 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-10-06 00:48:35,306 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:35,316 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:48:35,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:35,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:35,332 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:48:35,340 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-06 00:48:35,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:35,345 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:48:35,356 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:48:35,420 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14742#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)))] [2020-10-06 00:48:35,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-06 00:48:35,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:35,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-06 00:48:35,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:48:35,422 INFO L87 Difference]: Start difference. First operand 474 states and 1393 transitions. Second operand 8 states. [2020-10-06 00:48:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:35,701 INFO L93 Difference]: Finished difference Result 530 states and 1503 transitions. [2020-10-06 00:48:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:48:35,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-06 00:48:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:35,708 INFO L225 Difference]: With dead ends: 530 [2020-10-06 00:48:35,708 INFO L226 Difference]: Without dead ends: 458 [2020-10-06 00:48:35,709 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-06 00:48:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-06 00:48:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 386. [2020-10-06 00:48:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-10-06 00:48:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1107 transitions. [2020-10-06 00:48:35,728 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1107 transitions. Word has length 13 [2020-10-06 00:48:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:35,728 INFO L479 AbstractCegarLoop]: Abstraction has 386 states and 1107 transitions. [2020-10-06 00:48:35,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-06 00:48:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1107 transitions. [2020-10-06 00:48:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:48:35,730 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:48:35,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:48:35,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 00:48:35,731 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:48:35,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:48:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 359870388, now seen corresponding path program 1 times [2020-10-06 00:48:35,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:48:35,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591951537] [2020-10-06 00:48:35,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:48:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:48:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:48:35,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591951537] [2020-10-06 00:48:35,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:48:35,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:48:35,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [156858793] [2020-10-06 00:48:35,808 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:48:35,811 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:48:35,816 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-10-06 00:48:35,816 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:48:35,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:48:35,854 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [16053#(= (mod ~main$tmp_guard0~0 256) 0)] [2020-10-06 00:48:35,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:48:35,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:48:35,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:48:35,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:48:35,855 INFO L87 Difference]: Start difference. First operand 386 states and 1107 transitions. Second operand 5 states. [2020-10-06 00:48:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:48:35,888 INFO L93 Difference]: Finished difference Result 302 states and 758 transitions. [2020-10-06 00:48:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:48:35,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 00:48:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:48:35,889 INFO L225 Difference]: With dead ends: 302 [2020-10-06 00:48:35,889 INFO L226 Difference]: Without dead ends: 0 [2020-10-06 00:48:35,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:48:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-06 00:48:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-06 00:48:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-06 00:48:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-06 00:48:35,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-10-06 00:48:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:48:35,892 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-06 00:48:35,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:48:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-06 00:48:35,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-06 00:48:35,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-06 00:48:35,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:48:35 BasicIcfg [2020-10-06 00:48:35,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:48:35,900 INFO L168 Benchmark]: Toolchain (without parser) took 17001.60 ms. Allocated memory was 146.8 MB in the beginning and 392.2 MB in the end (delta: 245.4 MB). Free memory was 101.6 MB in the beginning and 175.2 MB in the end (delta: -73.6 MB). Peak memory consumption was 171.8 MB. Max. memory is 7.1 GB. [2020-10-06 00:48:35,900 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-06 00:48:35,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.57 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 101.2 MB in the beginning and 156.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-10-06 00:48:35,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.17 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:48:35,903 INFO L168 Benchmark]: Boogie Preprocessor took 47.14 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:48:35,903 INFO L168 Benchmark]: RCFGBuilder took 2128.39 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 151.6 MB in the beginning and 192.9 MB in the end (delta: -41.4 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2020-10-06 00:48:35,904 INFO L168 Benchmark]: TraceAbstraction took 13870.02 ms. Allocated memory was 246.9 MB in the beginning and 392.2 MB in the end (delta: 145.2 MB). Free memory was 192.9 MB in the beginning and 175.2 MB in the end (delta: 17.8 MB). Peak memory consumption was 163.0 MB. Max. memory is 7.1 GB. [2020-10-06 00:48:35,908 INFO L336 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 146.8 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 882.57 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 101.2 MB in the beginning and 156.8 MB in the end (delta: -55.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.17 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.14 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2128.39 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 151.6 MB in the beginning and 192.9 MB in the end (delta: -41.4 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13870.02 ms. Allocated memory was 246.9 MB in the beginning and 392.2 MB in the end (delta: 145.2 MB). Free memory was 192.9 MB in the beginning and 175.2 MB in the end (delta: 17.8 MB). Peak memory consumption was 163.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.5s, 99 ProgramPointsBefore, 35 ProgramPointsAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 797 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4008 CheckedPairsTotal, 78 TotalNumberOfCompositions - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 244 SDtfs, 301 SDslu, 307 SDs, 0 SdLazy, 217 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 96 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 18855 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...