/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:35:36,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:35:36,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:35:36,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:35:36,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:35:36,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:35:36,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:35:36,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:35:36,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:35:36,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:35:36,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:35:36,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:35:36,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:35:36,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:35:36,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:35:36,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:35:36,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:35:36,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:35:36,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:35:36,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:35:36,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:35:36,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:35:36,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:35:36,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:35:36,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:35:36,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:35:36,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:35:36,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:35:36,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:35:36,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:35:36,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:35:36,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:35:36,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:35:36,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:35:36,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:35:36,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:35:36,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:35:36,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:35:36,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:35:36,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:35:36,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:35:36,730 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.epf [2020-10-05 23:35:36,752 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:35:36,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:35:36,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:35:36,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:35:36,754 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:35:36,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:35:36,754 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:35:36,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:35:36,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:35:36,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:35:36,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:35:36,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:35:36,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:35:36,755 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:35:36,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:35:36,756 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:35:36,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:35:36,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:35:36,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:35:36,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:35:36,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:35:36,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:35:36,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:35:36,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:35:36,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:35:36,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:35:36,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:35:36,758 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:35:36,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:35:37,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:35:37,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:35:37,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:35:37,076 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:35:37,076 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:35:37,077 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2020-10-05 23:35:37,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de6dedcb/b8961af8eeee4c4d97ae5ba455624b3a/FLAGf3c752ae0 [2020-10-05 23:35:37,734 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:35:37,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2020-10-05 23:35:37,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de6dedcb/b8961af8eeee4c4d97ae5ba455624b3a/FLAGf3c752ae0 [2020-10-05 23:35:38,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de6dedcb/b8961af8eeee4c4d97ae5ba455624b3a [2020-10-05 23:35:38,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:35:38,054 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:35:38,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:35:38,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:35:38,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:35:38,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15006561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38, skipping insertion in model container [2020-10-05 23:35:38,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:35:38,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:35:38,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:35:38,639 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:35:38,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:35:38,796 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:35:38,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38 WrapperNode [2020-10-05 23:35:38,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:35:38,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:35:38,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:35:38,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:35:38,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:35:38,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:35:38,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:35:38,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:35:38,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (1/1) ... [2020-10-05 23:35:38,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:35:38,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:35:38,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:35:38,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:35:38,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (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-05 23:35:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:35:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:35:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:35:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:35:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:35:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:35:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:35:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:35:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:35:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:35:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 23:35:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 23:35:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:35:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:35:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:35:38,975 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:35:40,985 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:35:40,985 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:35:40,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:35:40 BoogieIcfgContainer [2020-10-05 23:35:40,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:35:40,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:35:40,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:35:40,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:35:40,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:35:38" (1/3) ... [2020-10-05 23:35:40,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcf13e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:35:40, skipping insertion in model container [2020-10-05 23:35:40,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:38" (2/3) ... [2020-10-05 23:35:40,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcf13e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:35:40, skipping insertion in model container [2020-10-05 23:35:40,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:35:40" (3/3) ... [2020-10-05 23:35:40,997 INFO L109 eAbstractionObserver]: Analyzing ICFG mix057_rmo.opt.i [2020-10-05 23:35:41,009 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:35:41,010 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:35:41,018 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:35:41,019 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:35:41,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,052 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,052 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,054 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,054 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,055 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,056 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,059 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,059 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,059 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,060 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,061 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,061 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,061 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,061 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,061 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,062 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,062 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,062 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,067 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,068 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,072 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,073 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,074 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,076 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,077 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,082 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,083 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:41,099 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:35:41,122 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:35:41,122 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:35:41,122 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:35:41,123 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:35:41,123 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:35:41,123 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:35:41,123 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:35:41,123 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:35:41,141 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-05 23:35:41,143 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-05 23:35:41,199 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-05 23:35:41,199 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:35:41,205 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-05 23:35:41,210 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-05 23:35:41,240 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-05 23:35:41,240 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:35:41,241 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-05 23:35:41,244 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2352 [2020-10-05 23:35:41,246 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:35:42,746 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-05 23:35:42,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-05 23:35:42,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:35:42,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:35:42,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:35:43,980 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-05 23:35:44,626 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:35:45,657 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-05 23:35:45,982 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-05 23:35:46,148 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-05 23:35:46,251 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-05 23:35:47,419 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 137 DAG size of output: 128 [2020-10-05 23:35:47,749 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-05 23:35:48,375 WARN L193 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2020-10-05 23:35:48,659 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-05 23:35:49,488 WARN L193 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-05 23:35:49,974 WARN L193 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-05 23:35:50,240 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-05 23:35:50,362 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-05 23:35:50,395 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5363 [2020-10-05 23:35:50,395 INFO L214 etLargeBlockEncoding]: Total number of compositions: 84 [2020-10-05 23:35:50,399 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-05 23:35:50,556 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-05 23:35:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-05 23:35:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:35:50,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:50,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:50,569 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:50,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:50,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1680903237, now seen corresponding path program 1 times [2020-10-05 23:35:50,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:50,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133386312] [2020-10-05 23:35:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:50,848 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-05 23:35:50,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133386312] [2020-10-05 23:35:50,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:50,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:50,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333739096] [2020-10-05 23:35:50,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:50,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:50,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:50,870 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-05 23:35:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:51,055 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-05 23:35:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:51,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:35:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:51,108 INFO L225 Difference]: With dead ends: 2202 [2020-10-05 23:35:51,108 INFO L226 Difference]: Without dead ends: 1802 [2020-10-05 23:35:51,110 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-05 23:35:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-05 23:35:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-05 23:35:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-05 23:35:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-05 23:35:51,289 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-05 23:35:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:51,291 INFO L479 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-05 23:35:51,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-05 23:35:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:35:51,296 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:51,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:51,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:35:51,296 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:51,297 INFO L82 PathProgramCache]: Analyzing trace with hash 440307530, now seen corresponding path program 1 times [2020-10-05 23:35:51,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:51,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186174294] [2020-10-05 23:35:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:51,421 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-05 23:35:51,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186174294] [2020-10-05 23:35:51,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:51,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:51,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175997151] [2020-10-05 23:35:51,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:51,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:51,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:51,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:51,425 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-05 23:35:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:51,506 INFO L93 Difference]: Finished difference Result 1762 states and 6602 transitions. [2020-10-05 23:35:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:51,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:35:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:51,524 INFO L225 Difference]: With dead ends: 1762 [2020-10-05 23:35:51,524 INFO L226 Difference]: Without dead ends: 1762 [2020-10-05 23:35:51,525 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-05 23:35:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-10-05 23:35:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-10-05 23:35:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-10-05 23:35:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6602 transitions. [2020-10-05 23:35:51,599 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6602 transitions. Word has length 11 [2020-10-05 23:35:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:51,599 INFO L479 AbstractCegarLoop]: Abstraction has 1762 states and 6602 transitions. [2020-10-05 23:35:51,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6602 transitions. [2020-10-05 23:35:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:35:51,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:51,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:51,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:35:51,607 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash 249955351, now seen corresponding path program 1 times [2020-10-05 23:35:51,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:51,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543774247] [2020-10-05 23:35:51,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:51,785 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-05 23:35:51,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543774247] [2020-10-05 23:35:51,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:51,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:51,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224985873] [2020-10-05 23:35:51,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:51,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:51,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:51,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:51,789 INFO L87 Difference]: Start difference. First operand 1762 states and 6602 transitions. Second operand 3 states. [2020-10-05 23:35:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:51,848 INFO L93 Difference]: Finished difference Result 1754 states and 6564 transitions. [2020-10-05 23:35:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:51,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:35:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:51,868 INFO L225 Difference]: With dead ends: 1754 [2020-10-05 23:35:51,868 INFO L226 Difference]: Without dead ends: 1754 [2020-10-05 23:35:51,869 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-05 23:35:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2020-10-05 23:35:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2020-10-05 23:35:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2020-10-05 23:35:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 6564 transitions. [2020-10-05 23:35:51,943 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 6564 transitions. Word has length 12 [2020-10-05 23:35:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:51,943 INFO L479 AbstractCegarLoop]: Abstraction has 1754 states and 6564 transitions. [2020-10-05 23:35:51,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 6564 transitions. [2020-10-05 23:35:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:35:51,949 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:51,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:51,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:35:51,957 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash -840938303, now seen corresponding path program 1 times [2020-10-05 23:35:51,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:51,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771892024] [2020-10-05 23:35:51,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:52,087 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-05 23:35:52,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771892024] [2020-10-05 23:35:52,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:52,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:52,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988482010] [2020-10-05 23:35:52,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:52,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:52,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:52,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:52,091 INFO L87 Difference]: Start difference. First operand 1754 states and 6564 transitions. Second operand 3 states. [2020-10-05 23:35:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:52,133 INFO L93 Difference]: Finished difference Result 1732 states and 6468 transitions. [2020-10-05 23:35:52,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:52,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:35:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:52,151 INFO L225 Difference]: With dead ends: 1732 [2020-10-05 23:35:52,151 INFO L226 Difference]: Without dead ends: 1732 [2020-10-05 23:35:52,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2020-10-05 23:35:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2020-10-05 23:35:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2020-10-05 23:35:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 6468 transitions. [2020-10-05 23:35:52,223 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 6468 transitions. Word has length 13 [2020-10-05 23:35:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:52,223 INFO L479 AbstractCegarLoop]: Abstraction has 1732 states and 6468 transitions. [2020-10-05 23:35:52,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 6468 transitions. [2020-10-05 23:35:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:35:52,225 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:52,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:52,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:35:52,226 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:52,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:52,226 INFO L82 PathProgramCache]: Analyzing trace with hash -840461647, now seen corresponding path program 1 times [2020-10-05 23:35:52,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:52,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920221701] [2020-10-05 23:35:52,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:52,297 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-05 23:35:52,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920221701] [2020-10-05 23:35:52,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:52,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:52,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191514185] [2020-10-05 23:35:52,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:52,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:52,300 INFO L87 Difference]: Start difference. First operand 1732 states and 6468 transitions. Second operand 3 states. [2020-10-05 23:35:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:52,322 INFO L93 Difference]: Finished difference Result 1700 states and 6324 transitions. [2020-10-05 23:35:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:52,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:35:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:52,339 INFO L225 Difference]: With dead ends: 1700 [2020-10-05 23:35:52,339 INFO L226 Difference]: Without dead ends: 1700 [2020-10-05 23:35:52,340 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-05 23:35:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-10-05 23:35:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2020-10-05 23:35:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2020-10-05 23:35:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 6324 transitions. [2020-10-05 23:35:52,407 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 6324 transitions. Word has length 13 [2020-10-05 23:35:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:52,407 INFO L479 AbstractCegarLoop]: Abstraction has 1700 states and 6324 transitions. [2020-10-05 23:35:52,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 6324 transitions. [2020-10-05 23:35:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:35:52,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:52,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:52,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:35:52,410 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:52,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash -333997007, now seen corresponding path program 1 times [2020-10-05 23:35:52,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:52,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643123028] [2020-10-05 23:35:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:52,591 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-05 23:35:52,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643123028] [2020-10-05 23:35:52,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:52,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:52,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503886264] [2020-10-05 23:35:52,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:52,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:52,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:52,594 INFO L87 Difference]: Start difference. First operand 1700 states and 6324 transitions. Second operand 5 states. [2020-10-05 23:35:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:52,732 INFO L93 Difference]: Finished difference Result 1702 states and 6318 transitions. [2020-10-05 23:35:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:52,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:35:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:52,748 INFO L225 Difference]: With dead ends: 1702 [2020-10-05 23:35:52,748 INFO L226 Difference]: Without dead ends: 1702 [2020-10-05 23:35:52,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2020-10-05 23:35:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1686. [2020-10-05 23:35:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2020-10-05 23:35:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 6262 transitions. [2020-10-05 23:35:52,805 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 6262 transitions. Word has length 14 [2020-10-05 23:35:52,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:52,805 INFO L479 AbstractCegarLoop]: Abstraction has 1686 states and 6262 transitions. [2020-10-05 23:35:52,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 6262 transitions. [2020-10-05 23:35:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:35:52,808 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:52,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:52,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:35:52,818 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:52,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:52,818 INFO L82 PathProgramCache]: Analyzing trace with hash -298426553, now seen corresponding path program 1 times [2020-10-05 23:35:52,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:52,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086194514] [2020-10-05 23:35:52,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:52,914 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-05 23:35:52,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086194514] [2020-10-05 23:35:52,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:52,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:52,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547521893] [2020-10-05 23:35:52,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:52,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:52,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:52,917 INFO L87 Difference]: Start difference. First operand 1686 states and 6262 transitions. Second operand 5 states. [2020-10-05 23:35:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:53,008 INFO L93 Difference]: Finished difference Result 1642 states and 6070 transitions. [2020-10-05 23:35:53,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:53,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:35:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:53,025 INFO L225 Difference]: With dead ends: 1642 [2020-10-05 23:35:53,025 INFO L226 Difference]: Without dead ends: 1642 [2020-10-05 23:35:53,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-05 23:35:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2020-10-05 23:35:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2020-10-05 23:35:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2020-10-05 23:35:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 6070 transitions. [2020-10-05 23:35:53,144 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 6070 transitions. Word has length 14 [2020-10-05 23:35:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:53,145 INFO L479 AbstractCegarLoop]: Abstraction has 1642 states and 6070 transitions. [2020-10-05 23:35:53,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 6070 transitions. [2020-10-05 23:35:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:35:53,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:53,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:53,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:35:53,148 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1797762494, now seen corresponding path program 1 times [2020-10-05 23:35:53,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:53,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476862331] [2020-10-05 23:35:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:53,383 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-05 23:35:53,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476862331] [2020-10-05 23:35:53,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:53,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:53,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093148467] [2020-10-05 23:35:53,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:53,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:53,385 INFO L87 Difference]: Start difference. First operand 1642 states and 6070 transitions. Second operand 6 states. [2020-10-05 23:35:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:53,518 INFO L93 Difference]: Finished difference Result 1662 states and 6112 transitions. [2020-10-05 23:35:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:53,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-05 23:35:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:53,533 INFO L225 Difference]: With dead ends: 1662 [2020-10-05 23:35:53,533 INFO L226 Difference]: Without dead ends: 1662 [2020-10-05 23:35:53,534 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2020-10-05 23:35:53,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1614. [2020-10-05 23:35:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-10-05 23:35:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 5960 transitions. [2020-10-05 23:35:53,583 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 5960 transitions. Word has length 15 [2020-10-05 23:35:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:53,584 INFO L479 AbstractCegarLoop]: Abstraction has 1614 states and 5960 transitions. [2020-10-05 23:35:53,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 5960 transitions. [2020-10-05 23:35:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:35:53,586 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:53,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:53,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:35:53,587 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1763115561, now seen corresponding path program 1 times [2020-10-05 23:35:53,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:53,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596548152] [2020-10-05 23:35:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:53,665 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-05 23:35:53,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596548152] [2020-10-05 23:35:53,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:53,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:53,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084666201] [2020-10-05 23:35:53,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:53,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:53,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:53,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:53,669 INFO L87 Difference]: Start difference. First operand 1614 states and 5960 transitions. Second operand 6 states. [2020-10-05 23:35:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:53,751 INFO L93 Difference]: Finished difference Result 1726 states and 6416 transitions. [2020-10-05 23:35:53,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:53,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-05 23:35:53,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:53,774 INFO L225 Difference]: With dead ends: 1726 [2020-10-05 23:35:53,774 INFO L226 Difference]: Without dead ends: 1726 [2020-10-05 23:35:53,776 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2020-10-05 23:35:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2020-10-05 23:35:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2020-10-05 23:35:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 6416 transitions. [2020-10-05 23:35:53,836 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 6416 transitions. Word has length 15 [2020-10-05 23:35:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:53,836 INFO L479 AbstractCegarLoop]: Abstraction has 1726 states and 6416 transitions. [2020-10-05 23:35:53,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 6416 transitions. [2020-10-05 23:35:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:35:53,841 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:53,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:53,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:35:53,842 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:53,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1763973021, now seen corresponding path program 2 times [2020-10-05 23:35:53,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:53,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576703682] [2020-10-05 23:35:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:54,021 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-05 23:35:54,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576703682] [2020-10-05 23:35:54,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:54,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:54,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156711569] [2020-10-05 23:35:54,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:54,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:54,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:54,024 INFO L87 Difference]: Start difference. First operand 1726 states and 6416 transitions. Second operand 6 states. [2020-10-05 23:35:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:54,118 INFO L93 Difference]: Finished difference Result 1854 states and 6838 transitions. [2020-10-05 23:35:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:54,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-05 23:35:54,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:54,131 INFO L225 Difference]: With dead ends: 1854 [2020-10-05 23:35:54,131 INFO L226 Difference]: Without dead ends: 1854 [2020-10-05 23:35:54,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2020-10-05 23:35:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1682. [2020-10-05 23:35:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-10-05 23:35:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 6188 transitions. [2020-10-05 23:35:54,186 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 6188 transitions. Word has length 15 [2020-10-05 23:35:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:54,187 INFO L479 AbstractCegarLoop]: Abstraction has 1682 states and 6188 transitions. [2020-10-05 23:35:54,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 6188 transitions. [2020-10-05 23:35:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:35:54,191 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:54,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:54,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:35:54,191 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash 104794598, now seen corresponding path program 1 times [2020-10-05 23:35:54,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:54,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553618784] [2020-10-05 23:35:54,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:54,442 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-05 23:35:54,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553618784] [2020-10-05 23:35:54,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:54,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:54,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604095579] [2020-10-05 23:35:54,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:35:54,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:35:54,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:54,444 INFO L87 Difference]: Start difference. First operand 1682 states and 6188 transitions. Second operand 7 states. [2020-10-05 23:35:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:54,671 INFO L93 Difference]: Finished difference Result 1874 states and 6892 transitions. [2020-10-05 23:35:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:54,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-05 23:35:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:54,680 INFO L225 Difference]: With dead ends: 1874 [2020-10-05 23:35:54,680 INFO L226 Difference]: Without dead ends: 1874 [2020-10-05 23:35:54,681 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:35:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2020-10-05 23:35:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2020-10-05 23:35:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2020-10-05 23:35:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 6892 transitions. [2020-10-05 23:35:54,738 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 6892 transitions. Word has length 16 [2020-10-05 23:35:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:54,739 INFO L479 AbstractCegarLoop]: Abstraction has 1874 states and 6892 transitions. [2020-10-05 23:35:54,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:35:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 6892 transitions. [2020-10-05 23:35:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:35:54,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:54,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:54,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:35:54,743 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:54,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:54,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1177270598, now seen corresponding path program 2 times [2020-10-05 23:35:54,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:54,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135758915] [2020-10-05 23:35:54,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:54,948 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-05 23:35:54,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135758915] [2020-10-05 23:35:54,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:54,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:54,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520770626] [2020-10-05 23:35:54,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:35:54,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:54,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:35:54,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:54,950 INFO L87 Difference]: Start difference. First operand 1874 states and 6892 transitions. Second operand 7 states. [2020-10-05 23:35:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:55,084 INFO L93 Difference]: Finished difference Result 1986 states and 7252 transitions. [2020-10-05 23:35:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:55,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-05 23:35:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:55,093 INFO L225 Difference]: With dead ends: 1986 [2020-10-05 23:35:55,093 INFO L226 Difference]: Without dead ends: 1986 [2020-10-05 23:35:55,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:35:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2020-10-05 23:35:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1794. [2020-10-05 23:35:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-10-05 23:35:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6548 transitions. [2020-10-05 23:35:55,151 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6548 transitions. Word has length 16 [2020-10-05 23:35:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:55,152 INFO L479 AbstractCegarLoop]: Abstraction has 1794 states and 6548 transitions. [2020-10-05 23:35:55,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:35:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6548 transitions. [2020-10-05 23:35:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:35:55,156 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:55,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:55,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:35:55,156 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:55,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1151409158, now seen corresponding path program 3 times [2020-10-05 23:35:55,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:55,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997723679] [2020-10-05 23:35:55,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:55,487 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-05 23:35:55,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997723679] [2020-10-05 23:35:55,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:55,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:55,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857353731] [2020-10-05 23:35:55,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:35:55,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:35:55,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:55,490 INFO L87 Difference]: Start difference. First operand 1794 states and 6548 transitions. Second operand 7 states. [2020-10-05 23:35:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:55,825 INFO L93 Difference]: Finished difference Result 1738 states and 6328 transitions. [2020-10-05 23:35:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:55,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-05 23:35:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:55,833 INFO L225 Difference]: With dead ends: 1738 [2020-10-05 23:35:55,834 INFO L226 Difference]: Without dead ends: 1738 [2020-10-05 23:35:55,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:35:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-10-05 23:35:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1626. [2020-10-05 23:35:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-10-05 23:35:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5968 transitions. [2020-10-05 23:35:55,886 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 5968 transitions. Word has length 16 [2020-10-05 23:35:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:55,887 INFO L479 AbstractCegarLoop]: Abstraction has 1626 states and 5968 transitions. [2020-10-05 23:35:55,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:35:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 5968 transitions. [2020-10-05 23:35:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:35:55,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:55,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:55,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:35:55,891 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash 974833126, now seen corresponding path program 1 times [2020-10-05 23:35:55,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:55,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444776848] [2020-10-05 23:35:55,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:55,942 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-05 23:35:55,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444776848] [2020-10-05 23:35:55,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:55,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:55,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855084106] [2020-10-05 23:35:55,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:35:55,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:55,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:35:55,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:55,944 INFO L87 Difference]: Start difference. First operand 1626 states and 5968 transitions. Second operand 4 states. [2020-10-05 23:35:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:55,982 INFO L93 Difference]: Finished difference Result 1728 states and 5807 transitions. [2020-10-05 23:35:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:55,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-05 23:35:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:55,988 INFO L225 Difference]: With dead ends: 1728 [2020-10-05 23:35:55,988 INFO L226 Difference]: Without dead ends: 1296 [2020-10-05 23:35:55,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2020-10-05 23:35:56,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2020-10-05 23:35:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2020-10-05 23:35:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 4318 transitions. [2020-10-05 23:35:56,027 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 4318 transitions. Word has length 16 [2020-10-05 23:35:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:56,027 INFO L479 AbstractCegarLoop]: Abstraction has 1296 states and 4318 transitions. [2020-10-05 23:35:56,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:35:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 4318 transitions. [2020-10-05 23:35:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:35:56,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:56,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:56,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:35:56,031 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:56,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:56,032 INFO L82 PathProgramCache]: Analyzing trace with hash -350364005, now seen corresponding path program 1 times [2020-10-05 23:35:56,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:56,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159809879] [2020-10-05 23:35:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:56,107 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-05 23:35:56,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159809879] [2020-10-05 23:35:56,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:56,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:56,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222472806] [2020-10-05 23:35:56,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:56,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:56,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:56,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:56,110 INFO L87 Difference]: Start difference. First operand 1296 states and 4318 transitions. Second operand 5 states. [2020-10-05 23:35:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:56,172 INFO L93 Difference]: Finished difference Result 1156 states and 3549 transitions. [2020-10-05 23:35:56,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:56,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:35:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:56,177 INFO L225 Difference]: With dead ends: 1156 [2020-10-05 23:35:56,177 INFO L226 Difference]: Without dead ends: 877 [2020-10-05 23:35:56,180 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2020-10-05 23:35:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2020-10-05 23:35:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2020-10-05 23:35:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 2642 transitions. [2020-10-05 23:35:56,209 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 2642 transitions. Word has length 17 [2020-10-05 23:35:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:56,209 INFO L479 AbstractCegarLoop]: Abstraction has 877 states and 2642 transitions. [2020-10-05 23:35:56,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:56,210 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 2642 transitions. [2020-10-05 23:35:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:35:56,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:56,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:56,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:35:56,213 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1278143232, now seen corresponding path program 1 times [2020-10-05 23:35:56,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:56,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142697189] [2020-10-05 23:35:56,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:56,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-05 23:35:56,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142697189] [2020-10-05 23:35:56,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:56,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:35:56,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703538829] [2020-10-05 23:35:56,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:56,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:56,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:56,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:56,299 INFO L87 Difference]: Start difference. First operand 877 states and 2642 transitions. Second operand 3 states. [2020-10-05 23:35:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:56,318 INFO L93 Difference]: Finished difference Result 1249 states and 3669 transitions. [2020-10-05 23:35:56,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:56,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-05 23:35:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:56,324 INFO L225 Difference]: With dead ends: 1249 [2020-10-05 23:35:56,324 INFO L226 Difference]: Without dead ends: 887 [2020-10-05 23:35:56,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-05 23:35:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 871. [2020-10-05 23:35:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2020-10-05 23:35:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2481 transitions. [2020-10-05 23:35:56,428 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2481 transitions. Word has length 18 [2020-10-05 23:35:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:56,428 INFO L479 AbstractCegarLoop]: Abstraction has 871 states and 2481 transitions. [2020-10-05 23:35:56,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2481 transitions. [2020-10-05 23:35:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:35:56,431 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:56,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:56,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:35:56,431 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:56,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 125424893, now seen corresponding path program 1 times [2020-10-05 23:35:56,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:56,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169938688] [2020-10-05 23:35:56,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:56,489 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-05 23:35:56,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169938688] [2020-10-05 23:35:56,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:56,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:56,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840523493] [2020-10-05 23:35:56,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:35:56,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:56,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:35:56,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:56,494 INFO L87 Difference]: Start difference. First operand 871 states and 2481 transitions. Second operand 4 states. [2020-10-05 23:35:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:56,517 INFO L93 Difference]: Finished difference Result 1201 states and 3360 transitions. [2020-10-05 23:35:56,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:56,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-05 23:35:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:56,522 INFO L225 Difference]: With dead ends: 1201 [2020-10-05 23:35:56,522 INFO L226 Difference]: Without dead ends: 561 [2020-10-05 23:35:56,523 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-10-05 23:35:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2020-10-05 23:35:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2020-10-05 23:35:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1483 transitions. [2020-10-05 23:35:56,537 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1483 transitions. Word has length 19 [2020-10-05 23:35:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:56,538 INFO L479 AbstractCegarLoop]: Abstraction has 561 states and 1483 transitions. [2020-10-05 23:35:56,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:35:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1483 transitions. [2020-10-05 23:35:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:35:56,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:56,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:56,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:35:56,542 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:56,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:56,542 INFO L82 PathProgramCache]: Analyzing trace with hash -900066335, now seen corresponding path program 2 times [2020-10-05 23:35:56,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:56,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27666042] [2020-10-05 23:35:56,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:56,592 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-05 23:35:56,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27666042] [2020-10-05 23:35:56,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:56,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:35:56,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461886112] [2020-10-05 23:35:56,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:56,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:56,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:56,595 INFO L87 Difference]: Start difference. First operand 561 states and 1483 transitions. Second operand 3 states. [2020-10-05 23:35:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:56,608 INFO L93 Difference]: Finished difference Result 757 states and 1944 transitions. [2020-10-05 23:35:56,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:56,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-05 23:35:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:56,611 INFO L225 Difference]: With dead ends: 757 [2020-10-05 23:35:56,611 INFO L226 Difference]: Without dead ends: 569 [2020-10-05 23:35:56,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-10-05 23:35:56,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 551. [2020-10-05 23:35:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-10-05 23:35:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1387 transitions. [2020-10-05 23:35:56,626 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 1387 transitions. Word has length 19 [2020-10-05 23:35:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:56,626 INFO L479 AbstractCegarLoop]: Abstraction has 551 states and 1387 transitions. [2020-10-05 23:35:56,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 1387 transitions. [2020-10-05 23:35:56,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:35:56,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:56,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:56,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:35:56,628 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:56,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:56,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2026188855, now seen corresponding path program 1 times [2020-10-05 23:35:56,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:56,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674921542] [2020-10-05 23:35:56,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:56,698 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-05 23:35:56,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674921542] [2020-10-05 23:35:56,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:56,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:56,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194783944] [2020-10-05 23:35:56,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:56,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:56,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:56,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:56,701 INFO L87 Difference]: Start difference. First operand 551 states and 1387 transitions. Second operand 6 states. [2020-10-05 23:35:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:56,779 INFO L93 Difference]: Finished difference Result 474 states and 1145 transitions. [2020-10-05 23:35:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:56,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-05 23:35:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:56,782 INFO L225 Difference]: With dead ends: 474 [2020-10-05 23:35:56,782 INFO L226 Difference]: Without dead ends: 358 [2020-10-05 23:35:56,782 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:35:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-10-05 23:35:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 338. [2020-10-05 23:35:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-10-05 23:35:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 790 transitions. [2020-10-05 23:35:56,790 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 790 transitions. Word has length 19 [2020-10-05 23:35:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:56,791 INFO L479 AbstractCegarLoop]: Abstraction has 338 states and 790 transitions. [2020-10-05 23:35:56,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 790 transitions. [2020-10-05 23:35:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:35:56,792 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:56,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:56,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:35:56,793 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:56,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:56,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1225847851, now seen corresponding path program 1 times [2020-10-05 23:35:56,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:56,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970040027] [2020-10-05 23:35:56,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:56,872 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-05 23:35:56,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970040027] [2020-10-05 23:35:56,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:56,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:35:56,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142167971] [2020-10-05 23:35:56,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:35:56,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:56,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:35:56,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:56,874 INFO L87 Difference]: Start difference. First operand 338 states and 790 transitions. Second operand 7 states. [2020-10-05 23:35:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:56,958 INFO L93 Difference]: Finished difference Result 317 states and 748 transitions. [2020-10-05 23:35:56,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:35:56,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-05 23:35:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:56,960 INFO L225 Difference]: With dead ends: 317 [2020-10-05 23:35:56,960 INFO L226 Difference]: Without dead ends: 99 [2020-10-05 23:35:56,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:35:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-05 23:35:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2020-10-05 23:35:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-05 23:35:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 197 transitions. [2020-10-05 23:35:56,963 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 197 transitions. Word has length 22 [2020-10-05 23:35:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:56,964 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 197 transitions. [2020-10-05 23:35:56,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:35:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 197 transitions. [2020-10-05 23:35:56,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:35:56,965 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:56,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:56,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:35:56,965 INFO L427 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:56,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:56,965 INFO L82 PathProgramCache]: Analyzing trace with hash 358783119, now seen corresponding path program 1 times [2020-10-05 23:35:56,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:56,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601507587] [2020-10-05 23:35:56,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:35:57,001 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:35:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:35:57,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:35:57,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:35:57,095 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:35:57,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 23:35:57,097 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:35:57,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L3-->L841: Formula: (let ((.cse7 (= (mod ~z$w_buff0_used~0_In-1173296503 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-1173296503 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-1173296503 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-1173296503 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~z$r_buff0_thd0~0_Out-1173296503 ~z$r_buff0_thd0~0_In-1173296503) (or (and (or (and .cse0 (= ~z$w_buff1~0_In-1173296503 ~z~0_Out-1173296503) .cse1) (and (= ~z~0_In-1173296503 ~z~0_Out-1173296503) .cse2)) .cse3) (and (= ~z~0_Out-1173296503 ~z$w_buff0~0_In-1173296503) .cse4 .cse5)) (or (and .cse2 (= ~z$w_buff1_used~0_In-1173296503 ~z$w_buff1_used~0_Out-1173296503)) (and (= ~z$w_buff1_used~0_Out-1173296503 0) .cse0 .cse1)) (= ~z$r_buff1_thd0~0_Out-1173296503 ~z$r_buff1_thd0~0_In-1173296503) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1173296503 0)) (or (and (= ~z$w_buff0_used~0_Out-1173296503 ~z$w_buff0_used~0_In-1173296503) .cse3) (and .cse4 (= ~z$w_buff0_used~0_Out-1173296503 0) .cse5))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1173296503, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1173296503, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1173296503, ~z$w_buff0~0=~z$w_buff0~0_In-1173296503, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1173296503, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1173296503, ~z$w_buff1~0=~z$w_buff1~0_In-1173296503, ~z~0=~z~0_In-1173296503} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1173296503, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1173296503|, ~z$w_buff0~0=~z$w_buff0~0_In-1173296503, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1173296503|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1173296503, ~z$w_buff1~0=~z$w_buff1~0_In-1173296503, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1173296503|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1173296503|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1173296503|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1173296503|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1173296503, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1173296503, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1173296503, ~z~0=~z~0_Out-1173296503} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-05 23:35:57,125 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,125 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,127 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,128 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,128 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,128 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,129 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,131 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,131 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,132 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,132 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,134 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,135 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:35:57,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:57,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:35:57 BasicIcfg [2020-10-05 23:35:57,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:35:57,251 INFO L168 Benchmark]: Toolchain (without parser) took 19197.78 ms. Allocated memory was 137.9 MB in the beginning and 437.8 MB in the end (delta: 299.9 MB). Free memory was 97.7 MB in the beginning and 223.9 MB in the end (delta: -126.1 MB). Peak memory consumption was 173.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:57,251 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 118.1 MB in the beginning and 117.7 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-05 23:35:57,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.02 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 97.3 MB in the beginning and 154.2 MB in the end (delta: -56.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:57,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.12 ms. Allocated memory is still 200.8 MB. Free memory was 153.2 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:57,253 INFO L168 Benchmark]: Boogie Preprocessor took 39.01 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 148.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:57,253 INFO L168 Benchmark]: RCFGBuilder took 2085.64 ms. Allocated memory was 200.8 MB in the beginning and 252.2 MB in the end (delta: 51.4 MB). Free memory was 148.4 MB in the beginning and 197.4 MB in the end (delta: -49.1 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:57,254 INFO L168 Benchmark]: TraceAbstraction took 16259.44 ms. Allocated memory was 252.2 MB in the beginning and 437.8 MB in the end (delta: 185.6 MB). Free memory was 195.3 MB in the beginning and 223.9 MB in the end (delta: -28.6 MB). Peak memory consumption was 157.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:57,257 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 118.1 MB in the beginning and 117.7 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.02 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 97.3 MB in the beginning and 154.2 MB in the end (delta: -56.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.12 ms. Allocated memory is still 200.8 MB. Free memory was 153.2 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.01 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 148.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2085.64 ms. Allocated memory was 200.8 MB in the beginning and 252.2 MB in the end (delta: 51.4 MB). Free memory was 148.4 MB in the beginning and 197.4 MB in the end (delta: -49.1 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16259.44 ms. Allocated memory was 252.2 MB in the beginning and 437.8 MB in the end (delta: 185.6 MB). Free memory was 195.3 MB in the beginning and 223.9 MB in the end (delta: -28.6 MB). Peak memory consumption was 157.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.2s, 118 ProgramPointsBefore, 44 ProgramPointsAfterwards, 107 TransitionsBefore, 31 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 1232 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5363 CheckedPairsTotal, 84 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int a = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L709] 0 int y = 0; [L711] 0 int z = 0; [L712] 0 _Bool z$flush_delayed; [L713] 0 int z$mem_tmp; [L714] 0 _Bool z$r_buff0_thd0; [L715] 0 _Bool z$r_buff0_thd1; [L716] 0 _Bool z$r_buff0_thd2; [L717] 0 _Bool z$r_buff0_thd3; [L718] 0 _Bool z$r_buff0_thd4; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$r_buff1_thd4; [L724] 0 _Bool z$read_delayed; [L725] 0 int *z$read_delayed_var; [L726] 0 int z$w_buff0; [L727] 0 _Bool z$w_buff0_used; [L728] 0 int z$w_buff1; [L729] 0 _Bool z$w_buff1_used; [L730] 0 _Bool weak$$choice0; [L731] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1533; [L824] FCALL, FORK 0 pthread_create(&t1533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 pthread_t t1534; [L826] FCALL, FORK 0 pthread_create(&t1534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1535; [L828] FCALL, FORK 0 pthread_create(&t1535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1536; [L830] FCALL, FORK 0 pthread_create(&t1536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 4 z$w_buff1 = z$w_buff0 [L786] 4 z$w_buff0 = 2 [L787] 4 z$w_buff1_used = z$w_buff0_used [L788] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L790] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L791] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L792] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L793] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L794] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L795] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L750] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L772] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L774] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L775] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L778] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 3 return 0; [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L802] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L803] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L808] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 4 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 z$flush_delayed = weak$$choice2 [L846] 0 z$mem_tmp = z [L847] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L848] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L849] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L855] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L855] 0 z = z$flush_delayed ? z$mem_tmp : z [L856] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 588 SDtfs, 764 SDslu, 857 SDs, 0 SdLazy, 384 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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: 1.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 602 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 41737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 incorrect! Received shutdown request...