/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:11:33,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:11:33,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:11:33,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:11:33,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:11:33,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:11:33,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:11:33,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:11:33,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:11:33,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:11:33,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:11:33,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:11:33,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:11:33,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:11:33,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:11:33,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:11:33,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:11:33,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:11:33,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:11:33,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:11:33,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:11:33,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:11:33,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:11:33,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:11:33,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:11:33,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:11:33,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:11:33,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:11:33,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:11:33,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:11:33,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:11:33,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:11:33,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:11:33,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:11:33,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:11:33,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:11:33,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:11:33,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:11:33,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:11:33,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:11:33,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:11:33,834 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:11:33,862 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:11:33,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:11:33,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:11:33,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:11:33,865 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:11:33,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:11:33,865 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:11:33,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:11:33,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:11:33,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:11:33,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:11:33,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:11:33,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:11:33,868 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:11:33,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:11:33,868 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:11:33,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:11:33,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:11:33,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:11:33,869 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:11:33,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:11:33,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:11:33,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:11:33,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:11:33,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:11:33,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:11:33,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:11:33,871 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:11:33,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:11:33,871 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:11:33,872 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:11:34,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:11:34,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:11:34,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:11:34,236 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:11:34,236 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:11:34,237 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2019-12-27 17:11:34,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168c815d8/c75a3230b035457b8df47fd0b81697f6/FLAG9d912c5f6 [2019-12-27 17:11:34,938 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:11:34,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2019-12-27 17:11:34,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168c815d8/c75a3230b035457b8df47fd0b81697f6/FLAG9d912c5f6 [2019-12-27 17:11:35,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/168c815d8/c75a3230b035457b8df47fd0b81697f6 [2019-12-27 17:11:35,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:11:35,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:11:35,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:11:35,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:11:35,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:11:35,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:11:35" (1/1) ... [2019-12-27 17:11:35,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73811c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:35, skipping insertion in model container [2019-12-27 17:11:35,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:11:35" (1/1) ... [2019-12-27 17:11:35,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:11:35,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:11:35,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:11:35,898 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:11:35,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:11:36,080 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:11:36,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36 WrapperNode [2019-12-27 17:11:36,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:11:36,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:11:36,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:11:36,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:11:36,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (1/1) ... [2019-12-27 17:11:36,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (1/1) ... [2019-12-27 17:11:36,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:11:36,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:11:36,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:11:36,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:11:36,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (1/1) ... [2019-12-27 17:11:36,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (1/1) ... [2019-12-27 17:11:36,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (1/1) ... [2019-12-27 17:11:36,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (1/1) ... [2019-12-27 17:11:36,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (1/1) ... [2019-12-27 17:11:36,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (1/1) ... [2019-12-27 17:11:36,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (1/1) ... [2019-12-27 17:11:36,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:11:36,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:11:36,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:11:36,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:11:36,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (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 [2019-12-27 17:11:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:11:36,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:11:36,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:11:36,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:11:36,268 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:11:36,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:11:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:11:36,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:11:36,270 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:11:36,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:11:36,271 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 17:11:36,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 17:11:36,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:11:36,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:11:36,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:11:36,274 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:11:37,078 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:11:37,078 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:11:37,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:11:37 BoogieIcfgContainer [2019-12-27 17:11:37,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:11:37,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:11:37,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:11:37,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:11:37,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:11:35" (1/3) ... [2019-12-27 17:11:37,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d878273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:11:37, skipping insertion in model container [2019-12-27 17:11:37,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:36" (2/3) ... [2019-12-27 17:11:37,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d878273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:11:37, skipping insertion in model container [2019-12-27 17:11:37,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:11:37" (3/3) ... [2019-12-27 17:11:37,090 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_tso.opt.i [2019-12-27 17:11:37,101 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:11:37,101 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:11:37,109 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:11:37,110 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:11:37,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,167 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,167 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,169 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,169 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,170 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,170 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,177 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,177 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,177 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,178 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,178 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,183 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,183 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,183 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,183 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,183 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,184 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,187 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,188 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,190 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,191 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,194 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,194 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,197 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,197 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,198 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,198 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,198 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,198 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,199 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,199 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,199 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,199 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,199 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,199 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:37,215 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 17:11:37,235 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:11:37,236 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:11:37,236 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:11:37,236 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:11:37,236 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:11:37,236 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:11:37,237 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:11:37,237 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:11:37,255 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 17:11:37,256 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 17:11:37,366 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 17:11:37,366 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:11:37,386 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:11:37,411 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 17:11:37,470 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 17:11:37,470 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:11:37,477 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:11:37,495 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 17:11:37,496 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:11:42,675 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 17:11:42,813 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 17:11:42,837 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-27 17:11:42,837 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 17:11:42,841 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-27 17:11:45,854 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-27 17:11:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-27 17:11:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 17:11:45,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:45,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:45,868 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-27 17:11:45,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:45,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388105864] [2019-12-27 17:11:45,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:46,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388105864] [2019-12-27 17:11:46,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:46,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:11:46,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142065728] [2019-12-27 17:11:46,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:46,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:46,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 17:11:46,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:46,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:11:46,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:11:46,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:46,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:11:46,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:46,217 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-27 17:11:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:47,002 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-27 17:11:47,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:11:47,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 17:11:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:47,519 INFO L225 Difference]: With dead ends: 36830 [2019-12-27 17:11:47,519 INFO L226 Difference]: Without dead ends: 36102 [2019-12-27 17:11:47,521 INFO L631 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 [2019-12-27 17:11:47,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-27 17:11:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-27 17:11:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-27 17:11:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-27 17:11:51,144 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-27 17:11:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:51,146 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-27 17:11:51,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:11:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-27 17:11:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:11:51,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:51,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:51,154 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:51,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:51,154 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-27 17:11:51,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:51,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405529204] [2019-12-27 17:11:51,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:51,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405529204] [2019-12-27 17:11:51,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:51,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:11:51,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1772568279] [2019-12-27 17:11:51,284 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:51,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:51,296 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 17:11:51,296 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:51,333 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:11:51,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:11:51,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:51,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:11:51,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:11:51,335 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 5 states. [2019-12-27 17:11:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:52,165 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-27 17:11:52,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:11:52,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 17:11:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:52,421 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 17:11:52,421 INFO L226 Difference]: Without dead ends: 56106 [2019-12-27 17:11:52,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:11:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-27 17:11:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-27 17:11:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-27 17:11:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-27 17:11:58,213 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-27 17:11:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:58,213 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-27 17:11:58,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:11:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-27 17:11:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:11:58,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:58,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:58,218 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:58,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-27 17:11:58,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:58,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449659499] [2019-12-27 17:11:58,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:58,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449659499] [2019-12-27 17:11:58,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:58,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:11:58,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285098017] [2019-12-27 17:11:58,297 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:58,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:58,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 17:11:58,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:58,306 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:11:58,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:11:58,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:58,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:11:58,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:58,307 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-27 17:11:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:58,560 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-27 17:11:58,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:11:58,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 17:11:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:58,686 INFO L225 Difference]: With dead ends: 40168 [2019-12-27 17:11:58,686 INFO L226 Difference]: Without dead ends: 40168 [2019-12-27 17:11:58,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-27 17:12:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-27 17:12:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-27 17:12:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-27 17:12:00,204 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-27 17:12:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:00,204 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-27 17:12:00,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:12:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-27 17:12:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:12:00,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:00,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:00,208 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:00,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:00,208 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-27 17:12:00,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:00,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828678902] [2019-12-27 17:12:00,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:00,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828678902] [2019-12-27 17:12:00,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:00,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:12:00,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358087620] [2019-12-27 17:12:00,257 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:00,259 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:00,261 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 17:12:00,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:00,262 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:12:00,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:12:00,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:12:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:12:00,263 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-27 17:12:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:00,339 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-27 17:12:00,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:12:00,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:12:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:00,365 INFO L225 Difference]: With dead ends: 16680 [2019-12-27 17:12:00,366 INFO L226 Difference]: Without dead ends: 16680 [2019-12-27 17:12:00,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:12:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-27 17:12:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-27 17:12:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-27 17:12:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-27 17:12:01,029 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-27 17:12:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:01,029 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-27 17:12:01,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:12:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-27 17:12:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:12:01,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:01,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:01,032 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:01,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-27 17:12:01,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:01,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972902404] [2019-12-27 17:12:01,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:01,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972902404] [2019-12-27 17:12:01,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:01,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:12:01,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [47879548] [2019-12-27 17:12:01,099 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:01,101 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:01,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 17:12:01,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:01,130 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:12:01,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:12:01,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:01,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:12:01,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:12:01,131 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 6 states. [2019-12-27 17:12:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:01,201 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-27 17:12:01,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:12:01,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 17:12:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:01,206 INFO L225 Difference]: With dead ends: 2823 [2019-12-27 17:12:01,207 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 17:12:01,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:12:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 17:12:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-27 17:12:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-27 17:12:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-27 17:12:01,240 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-27 17:12:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:01,241 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-27 17:12:01,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:12:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-27 17:12:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 17:12:01,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:01,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:01,246 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:01,246 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-27 17:12:01,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:01,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204904505] [2019-12-27 17:12:01,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:01,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204904505] [2019-12-27 17:12:01,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:01,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:12:01,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1594888160] [2019-12-27 17:12:01,328 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:01,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:01,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 17:12:01,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:01,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:12:01,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:12:01,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:01,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:12:01,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:12:01,411 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 8 states. [2019-12-27 17:12:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:01,474 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-27 17:12:01,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:12:01,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 17:12:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:01,477 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 17:12:01,477 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 17:12:01,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:12:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 17:12:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-27 17:12:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 17:12:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-27 17:12:01,498 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-27 17:12:01,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:01,498 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-27 17:12:01,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:12:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-27 17:12:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:12:01,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:01,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:01,502 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:01,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-27 17:12:01,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:01,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326147144] [2019-12-27 17:12:01,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:01,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326147144] [2019-12-27 17:12:01,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:01,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:12:01,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251974181] [2019-12-27 17:12:01,622 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:01,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:01,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 17:12:01,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:01,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:12:01,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:12:01,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:01,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:12:01,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:12:01,752 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-27 17:12:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:01,815 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-27 17:12:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:12:01,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 17:12:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:01,818 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 17:12:01,819 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 17:12:01,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:12:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 17:12:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-27 17:12:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 17:12:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-27 17:12:01,838 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-27 17:12:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:01,839 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-27 17:12:01,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:12:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-27 17:12:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:12:01,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:01,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:01,844 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-27 17:12:01,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:01,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890554155] [2019-12-27 17:12:01,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:01,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890554155] [2019-12-27 17:12:01,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:01,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:12:01,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834558668] [2019-12-27 17:12:01,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:01,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:02,069 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 17:12:02,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:02,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:12:02,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:12:02,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:02,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:12:02,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:12:02,071 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-27 17:12:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:02,129 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-27 17:12:02,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:12:02,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 17:12:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:02,133 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 17:12:02,133 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 17:12:02,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:12:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 17:12:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-27 17:12:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-27 17:12:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-27 17:12:02,153 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-27 17:12:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:02,154 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-27 17:12:02,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:12:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-27 17:12:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:12:02,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:02,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:02,158 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:02,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-27 17:12:02,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:02,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059047542] [2019-12-27 17:12:02,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:02,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059047542] [2019-12-27 17:12:02,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:02,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:12:02,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1011499461] [2019-12-27 17:12:02,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:02,277 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:02,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 17:12:02,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:02,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:12:02,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:12:02,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:02,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:12:02,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:12:02,352 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-27 17:12:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:02,616 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-27 17:12:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:12:02,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 17:12:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:02,620 INFO L225 Difference]: With dead ends: 1764 [2019-12-27 17:12:02,620 INFO L226 Difference]: Without dead ends: 1764 [2019-12-27 17:12:02,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:12:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-27 17:12:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-27 17:12:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-27 17:12:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-27 17:12:02,649 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-27 17:12:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:02,649 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-27 17:12:02,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:12:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-27 17:12:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:12:02,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:02,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:02,655 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-27 17:12:02,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:02,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649069246] [2019-12-27 17:12:02,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:02,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649069246] [2019-12-27 17:12:02,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:02,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:12:02,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260530494] [2019-12-27 17:12:02,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:02,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:02,878 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 242 transitions. [2019-12-27 17:12:02,878 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:02,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:12:02,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:12:02,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:02,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:12:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:12:02,977 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 10 states. [2019-12-27 17:12:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:04,669 INFO L93 Difference]: Finished difference Result 3069 states and 8423 transitions. [2019-12-27 17:12:04,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:12:04,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 17:12:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:04,675 INFO L225 Difference]: With dead ends: 3069 [2019-12-27 17:12:04,675 INFO L226 Difference]: Without dead ends: 3069 [2019-12-27 17:12:04,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:12:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-12-27 17:12:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 1503. [2019-12-27 17:12:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-27 17:12:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-27 17:12:04,708 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-27 17:12:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:04,709 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-27 17:12:04,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:12:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-27 17:12:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:12:04,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:04,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:04,713 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-27 17:12:04,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:04,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281758034] [2019-12-27 17:12:04,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:04,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281758034] [2019-12-27 17:12:04,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:04,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:12:04,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1604472821] [2019-12-27 17:12:04,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:04,887 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:05,005 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 232 transitions. [2019-12-27 17:12:05,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:05,031 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 17:12:05,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:12:05,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:05,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:12:05,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:12:05,032 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 6 states. [2019-12-27 17:12:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:05,367 INFO L93 Difference]: Finished difference Result 2377 states and 6752 transitions. [2019-12-27 17:12:05,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:12:05,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 17:12:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:05,374 INFO L225 Difference]: With dead ends: 2377 [2019-12-27 17:12:05,374 INFO L226 Difference]: Without dead ends: 2377 [2019-12-27 17:12:05,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:12:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-27 17:12:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1691. [2019-12-27 17:12:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-12-27 17:12:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 4860 transitions. [2019-12-27 17:12:05,397 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 4860 transitions. Word has length 58 [2019-12-27 17:12:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:05,398 INFO L462 AbstractCegarLoop]: Abstraction has 1691 states and 4860 transitions. [2019-12-27 17:12:05,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:12:05,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 4860 transitions. [2019-12-27 17:12:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:12:05,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:05,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:05,402 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:05,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:05,402 INFO L82 PathProgramCache]: Analyzing trace with hash -687244225, now seen corresponding path program 4 times [2019-12-27 17:12:05,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:05,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413432956] [2019-12-27 17:12:05,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:05,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413432956] [2019-12-27 17:12:05,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:05,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:12:05,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [428692770] [2019-12-27 17:12:05,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:05,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:05,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 239 transitions. [2019-12-27 17:12:05,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:05,646 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:12:05,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:12:05,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:12:05,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:12:05,647 INFO L87 Difference]: Start difference. First operand 1691 states and 4860 transitions. Second operand 6 states. [2019-12-27 17:12:05,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:05,714 INFO L93 Difference]: Finished difference Result 2413 states and 6560 transitions. [2019-12-27 17:12:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:12:05,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 17:12:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:05,718 INFO L225 Difference]: With dead ends: 2413 [2019-12-27 17:12:05,718 INFO L226 Difference]: Without dead ends: 1545 [2019-12-27 17:12:05,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:12:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2019-12-27 17:12:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2019-12-27 17:12:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2019-12-27 17:12:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 4366 transitions. [2019-12-27 17:12:05,736 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 4366 transitions. Word has length 58 [2019-12-27 17:12:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:05,737 INFO L462 AbstractCegarLoop]: Abstraction has 1545 states and 4366 transitions. [2019-12-27 17:12:05,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:12:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 4366 transitions. [2019-12-27 17:12:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:12:05,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:05,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:05,740 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:05,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 723375403, now seen corresponding path program 5 times [2019-12-27 17:12:05,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:05,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641509180] [2019-12-27 17:12:05,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:05,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641509180] [2019-12-27 17:12:05,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:05,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:12:05,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [473431512] [2019-12-27 17:12:05,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:05,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:06,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 301 transitions. [2019-12-27 17:12:06,130 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:06,155 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:12:06,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:12:06,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:06,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:12:06,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:12:06,156 INFO L87 Difference]: Start difference. First operand 1545 states and 4366 transitions. Second operand 8 states. [2019-12-27 17:12:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:06,332 INFO L93 Difference]: Finished difference Result 2777 states and 7309 transitions. [2019-12-27 17:12:06,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:12:06,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-27 17:12:06,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:06,336 INFO L225 Difference]: With dead ends: 2777 [2019-12-27 17:12:06,336 INFO L226 Difference]: Without dead ends: 1593 [2019-12-27 17:12:06,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:12:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2019-12-27 17:12:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1136. [2019-12-27 17:12:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2019-12-27 17:12:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 2831 transitions. [2019-12-27 17:12:06,362 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 2831 transitions. Word has length 58 [2019-12-27 17:12:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:06,362 INFO L462 AbstractCegarLoop]: Abstraction has 1136 states and 2831 transitions. [2019-12-27 17:12:06,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:12:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 2831 transitions. [2019-12-27 17:12:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:12:06,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:06,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:06,366 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:06,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:06,367 INFO L82 PathProgramCache]: Analyzing trace with hash 503050939, now seen corresponding path program 6 times [2019-12-27 17:12:06,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:06,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303824730] [2019-12-27 17:12:06,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:06,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303824730] [2019-12-27 17:12:06,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:06,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:12:06,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [858071375] [2019-12-27 17:12:06,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:06,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:06,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 307 transitions. [2019-12-27 17:12:06,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:06,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:12:06,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:12:06,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:06,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:12:06,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:12:06,611 INFO L87 Difference]: Start difference. First operand 1136 states and 2831 transitions. Second operand 5 states. [2019-12-27 17:12:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:06,774 INFO L93 Difference]: Finished difference Result 1304 states and 3151 transitions. [2019-12-27 17:12:06,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:12:06,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 17:12:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:06,777 INFO L225 Difference]: With dead ends: 1304 [2019-12-27 17:12:06,777 INFO L226 Difference]: Without dead ends: 1304 [2019-12-27 17:12:06,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:12:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2019-12-27 17:12:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1003. [2019-12-27 17:12:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2019-12-27 17:12:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 2441 transitions. [2019-12-27 17:12:06,790 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 2441 transitions. Word has length 58 [2019-12-27 17:12:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:06,791 INFO L462 AbstractCegarLoop]: Abstraction has 1003 states and 2441 transitions. [2019-12-27 17:12:06,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:12:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 2441 transitions. [2019-12-27 17:12:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:12:06,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:06,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:06,792 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash -730467221, now seen corresponding path program 1 times [2019-12-27 17:12:06,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:06,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635987282] [2019-12-27 17:12:06,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:06,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635987282] [2019-12-27 17:12:06,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:06,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:12:06,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1383858052] [2019-12-27 17:12:06,860 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:06,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:07,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 276 transitions. [2019-12-27 17:12:07,007 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:07,008 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:12:07,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:12:07,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:12:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:12:07,009 INFO L87 Difference]: Start difference. First operand 1003 states and 2441 transitions. Second operand 3 states. [2019-12-27 17:12:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:07,063 INFO L93 Difference]: Finished difference Result 1002 states and 2439 transitions. [2019-12-27 17:12:07,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:12:07,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 17:12:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:07,065 INFO L225 Difference]: With dead ends: 1002 [2019-12-27 17:12:07,065 INFO L226 Difference]: Without dead ends: 1002 [2019-12-27 17:12:07,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:12:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-27 17:12:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 605. [2019-12-27 17:12:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 17:12:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1453 transitions. [2019-12-27 17:12:07,079 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1453 transitions. Word has length 59 [2019-12-27 17:12:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:07,080 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1453 transitions. [2019-12-27 17:12:07,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:12:07,080 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1453 transitions. [2019-12-27 17:12:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:07,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:07,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:07,091 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:07,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1492443498, now seen corresponding path program 1 times [2019-12-27 17:12:07,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:07,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956961504] [2019-12-27 17:12:07,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:07,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956961504] [2019-12-27 17:12:07,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:07,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:12:07,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634221429] [2019-12-27 17:12:07,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:07,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:07,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 253 transitions. [2019-12-27 17:12:07,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:07,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:12:07,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:12:07,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:07,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:12:07,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:12:07,473 INFO L87 Difference]: Start difference. First operand 605 states and 1453 transitions. Second operand 7 states. [2019-12-27 17:12:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:07,722 INFO L93 Difference]: Finished difference Result 1167 states and 2720 transitions. [2019-12-27 17:12:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:12:07,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 17:12:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:07,724 INFO L225 Difference]: With dead ends: 1167 [2019-12-27 17:12:07,724 INFO L226 Difference]: Without dead ends: 354 [2019-12-27 17:12:07,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:12:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-27 17:12:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 237. [2019-12-27 17:12:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-27 17:12:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-27 17:12:07,728 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 60 [2019-12-27 17:12:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:07,729 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-27 17:12:07,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:12:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-27 17:12:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:07,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:07,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:07,730 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:07,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 2 times [2019-12-27 17:12:07,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:07,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163882856] [2019-12-27 17:12:07,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:08,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163882856] [2019-12-27 17:12:08,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:08,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:12:08,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [669658473] [2019-12-27 17:12:08,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:08,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:08,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 298 transitions. [2019-12-27 17:12:08,225 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:08,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:12:08,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:12:08,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 17:12:08,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:08,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 17:12:08,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:12:08,486 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 18 states. [2019-12-27 17:12:08,933 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-27 17:12:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:10,765 INFO L93 Difference]: Finished difference Result 527 states and 895 transitions. [2019-12-27 17:12:10,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 17:12:10,765 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-12-27 17:12:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:10,766 INFO L225 Difference]: With dead ends: 527 [2019-12-27 17:12:10,766 INFO L226 Difference]: Without dead ends: 495 [2019-12-27 17:12:10,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=284, Invalid=1438, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 17:12:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-12-27 17:12:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 337. [2019-12-27 17:12:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-27 17:12:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 585 transitions. [2019-12-27 17:12:10,773 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 585 transitions. Word has length 60 [2019-12-27 17:12:10,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:10,773 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 585 transitions. [2019-12-27 17:12:10,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 17:12:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 585 transitions. [2019-12-27 17:12:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:10,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:10,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:10,774 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:10,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1191078724, now seen corresponding path program 3 times [2019-12-27 17:12:10,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:10,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73737566] [2019-12-27 17:12:10,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:11,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73737566] [2019-12-27 17:12:11,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:11,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:12:11,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802331490] [2019-12-27 17:12:11,022 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:11,039 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:11,197 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 226 transitions. [2019-12-27 17:12:11,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:11,227 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:12:11,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:12:11,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:11,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:12:11,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:12:11,228 INFO L87 Difference]: Start difference. First operand 337 states and 585 transitions. Second operand 13 states. [2019-12-27 17:12:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:11,674 INFO L93 Difference]: Finished difference Result 447 states and 750 transitions. [2019-12-27 17:12:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:12:11,675 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 17:12:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:11,676 INFO L225 Difference]: With dead ends: 447 [2019-12-27 17:12:11,676 INFO L226 Difference]: Without dead ends: 415 [2019-12-27 17:12:11,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:12:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-12-27 17:12:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 345. [2019-12-27 17:12:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-27 17:12:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-27 17:12:11,681 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-27 17:12:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:11,681 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-27 17:12:11,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:12:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-27 17:12:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:11,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:11,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:11,683 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:11,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:11,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 4 times [2019-12-27 17:12:11,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:11,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13975063] [2019-12-27 17:12:11,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:12:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:12:11,787 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:12:11,788 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:12:11,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_33) (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_#NULL.offset_7| 0) (= v_~x~0_30 0) (= v_~z$r_buff1_thd1~0_233 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= v_~b~0_102 0) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (= 0 v_~weak$$choice0~0_17) (= v_~z$w_buff1~0_400 0) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p3_EAX~0_243 0) (= 0 |v_ULTIMATE.start_main_~#t1245~0.offset_16|) (= v_~z$r_buff0_thd0~0_435 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1245~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1245~0.base_19|) |v_ULTIMATE.start_main_~#t1245~0.offset_16| 0)) |v_#memory_int_25|) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= v_~y~0_50 0) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1245~0.base_19| 4)) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_#NULL.base_7|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1245~0.base_19|) (= v_~z$r_buff0_thd1~0_87 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1245~0.base_19| 1)) (= v_~z$w_buff1_used~0_620 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1245~0.base_19|) 0) (= v_~main$tmp_guard1~0_25 0) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ~a~0=v_~a~0_234, ULTIMATE.start_main_~#t1246~0.offset=|v_ULTIMATE.start_main_~#t1246~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ULTIMATE.start_main_~#t1246~0.base=|v_ULTIMATE.start_main_~#t1246~0.base_22|, ULTIMATE.start_main_~#t1247~0.base=|v_ULTIMATE.start_main_~#t1247~0.base_21|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ULTIMATE.start_main_~#t1245~0.offset=|v_ULTIMATE.start_main_~#t1245~0.offset_16|, ~x~0=v_~x~0_30, ULTIMATE.start_main_~#t1245~0.base=|v_ULTIMATE.start_main_~#t1245~0.base_19|, ULTIMATE.start_main_~#t1248~0.base=|v_ULTIMATE.start_main_~#t1248~0.base_22|, ULTIMATE.start_main_~#t1247~0.offset=|v_ULTIMATE.start_main_~#t1247~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_50, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t1248~0.offset=|v_ULTIMATE.start_main_~#t1248~0.offset_17|, ~b~0=v_~b~0_102, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ULTIMATE.start_main_~#t1246~0.offset, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1246~0.base, ULTIMATE.start_main_~#t1247~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1245~0.offset, ~x~0, ULTIMATE.start_main_~#t1245~0.base, ULTIMATE.start_main_~#t1248~0.base, ULTIMATE.start_main_~#t1247~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1248~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:12:11,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1246~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1246~0.base_13|)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1246~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1246~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1246~0.base_13| 4) |v_#length_23|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1246~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1246~0.base_13|) |v_ULTIMATE.start_main_~#t1246~0.offset_11| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1246~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1246~0.offset=|v_ULTIMATE.start_main_~#t1246~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1246~0.base=|v_ULTIMATE.start_main_~#t1246~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1246~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1246~0.base] because there is no mapped edge [2019-12-27 17:12:11,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1247~0.base_12| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t1247~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1247~0.offset_10| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1247~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1247~0.base_12|) |v_ULTIMATE.start_main_~#t1247~0.offset_10| 2)) |v_#memory_int_17|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1247~0.base_12|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1247~0.base_12|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1247~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1247~0.offset=|v_ULTIMATE.start_main_~#t1247~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1247~0.base=|v_ULTIMATE.start_main_~#t1247~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1247~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1247~0.base] because there is no mapped edge [2019-12-27 17:12:11,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1248~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1248~0.base_12| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1248~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1248~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1248~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1248~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1248~0.base_12|) |v_ULTIMATE.start_main_~#t1248~0.offset_10| 3)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1248~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1248~0.base=|v_ULTIMATE.start_main_~#t1248~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1248~0.offset=|v_ULTIMATE.start_main_~#t1248~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1248~0.base, ULTIMATE.start_main_~#t1248~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 17:12:11,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 17:12:11,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~x~0_21 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_21, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 17:12:11,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_35 1) (= v_~x~0_26 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_35, ~x~0=v_~x~0_26, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:12:11,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-589440489 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-589440489 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-589440489| ~z$w_buff0_used~0_In-589440489)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-589440489|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-589440489, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-589440489} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-589440489, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-589440489, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-589440489|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 17:12:11,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In258137713 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In258137713 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out258137713| ~z~0_In258137713) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out258137713| ~z$w_buff1~0_In258137713) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In258137713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In258137713, ~z$w_buff1~0=~z$w_buff1~0_In258137713, ~z~0=~z~0_In258137713} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out258137713|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In258137713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In258137713, ~z$w_buff1~0=~z$w_buff1~0_In258137713, ~z~0=~z~0_In258137713} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:12:11,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1476162460 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1476162460 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1476162460 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1476162460 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-1476162460|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1476162460 |P3Thread1of1ForFork3_#t~ite12_Out-1476162460|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1476162460, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1476162460, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1476162460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1476162460} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1476162460, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1476162460, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1476162460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1476162460, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1476162460|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 17:12:11,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In329719444 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In329719444 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out329719444 ~z$r_buff0_thd4~0_In329719444)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out329719444 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In329719444, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In329719444} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In329719444, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out329719444, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out329719444|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 17:12:11,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1033122732 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1033122732 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1033122732 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1033122732 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-1033122732| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite14_Out-1033122732| ~z$r_buff1_thd4~0_In-1033122732)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1033122732, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1033122732, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1033122732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1033122732} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1033122732, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1033122732, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1033122732|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1033122732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1033122732} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 17:12:11,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 17:12:11,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 17:12:11,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1761689513 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1761689513 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1761689513 |P2Thread1of1ForFork2_#t~ite5_Out1761689513|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out1761689513|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1761689513, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1761689513} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1761689513|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1761689513, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1761689513} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 17:12:11,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In922514843 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In922514843 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In922514843 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In922514843 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out922514843|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In922514843 |P2Thread1of1ForFork2_#t~ite6_Out922514843|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In922514843, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In922514843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922514843, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In922514843} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out922514843|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In922514843, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In922514843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922514843, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In922514843} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 17:12:11,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1113759030 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1113759030 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1113759030|) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1113759030| ~z$r_buff0_thd3~0_In-1113759030) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113759030, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1113759030} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113759030, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1113759030, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1113759030|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 17:12:11,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1114737037 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1114737037 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1114737037 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1114737037 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-1114737037|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1114737037 |P2Thread1of1ForFork2_#t~ite8_Out-1114737037|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1114737037, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1114737037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1114737037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1114737037} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1114737037, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1114737037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1114737037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1114737037, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1114737037|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:12:11,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:12:11,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 17:12:11,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1015784174 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1015784174 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out1015784174| ~z$w_buff1~0_In1015784174)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1015784174| ~z~0_In1015784174)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1015784174, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1015784174, ~z$w_buff1~0=~z$w_buff1~0_In1015784174, ~z~0=~z~0_In1015784174} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1015784174|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1015784174, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1015784174, ~z$w_buff1~0=~z$w_buff1~0_In1015784174, ~z~0=~z~0_In1015784174} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:12:11,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:12:11,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-774595828 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-774595828 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-774595828| ~z$w_buff0_used~0_In-774595828) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-774595828|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-774595828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-774595828} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-774595828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-774595828, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-774595828|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:12:11,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In875252722 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In875252722 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In875252722 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In875252722 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out875252722| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out875252722| ~z$w_buff1_used~0_In875252722)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In875252722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In875252722, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In875252722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In875252722} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In875252722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In875252722, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In875252722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In875252722, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out875252722|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:12:11,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-5894029 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-5894029 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-5894029| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-5894029| ~z$r_buff0_thd0~0_In-5894029)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-5894029, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-5894029} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-5894029, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-5894029, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-5894029|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:12:11,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-76255799 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-76255799 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-76255799 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-76255799 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-76255799 |ULTIMATE.start_main_#t~ite24_Out-76255799|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-76255799|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-76255799, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-76255799, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-76255799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-76255799} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-76255799, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-76255799, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-76255799, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-76255799|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-76255799} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 17:12:11,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In956039513 256) 0))) (or (and .cse0 (= ~z$w_buff1_used~0_In956039513 |ULTIMATE.start_main_#t~ite39_Out956039513|) (= |ULTIMATE.start_main_#t~ite40_Out956039513| |ULTIMATE.start_main_#t~ite39_Out956039513|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In956039513 256)))) (or (and (= (mod ~z$r_buff1_thd0~0_In956039513 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In956039513 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In956039513 256))))) (and (= |ULTIMATE.start_main_#t~ite39_In956039513| |ULTIMATE.start_main_#t~ite39_Out956039513|) (= |ULTIMATE.start_main_#t~ite40_Out956039513| ~z$w_buff1_used~0_In956039513) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In956039513, ~z$w_buff0_used~0=~z$w_buff0_used~0_In956039513, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In956039513|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In956039513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In956039513, ~weak$$choice2~0=~weak$$choice2~0_In956039513} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In956039513, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out956039513|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out956039513|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In956039513, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In956039513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In956039513, ~weak$$choice2~0=~weak$$choice2~0_In956039513} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:12:11,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:12:11,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In220663219 256)))) (or (and (= ~z$r_buff1_thd0~0_In220663219 |ULTIMATE.start_main_#t~ite46_Out220663219|) (= |ULTIMATE.start_main_#t~ite45_In220663219| |ULTIMATE.start_main_#t~ite45_Out220663219|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite45_Out220663219| ~z$r_buff1_thd0~0_In220663219) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In220663219 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd0~0_In220663219 256) 0)) (= (mod ~z$w_buff0_used~0_In220663219 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In220663219 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out220663219| |ULTIMATE.start_main_#t~ite46_Out220663219|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In220663219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In220663219, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In220663219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In220663219, ~weak$$choice2~0=~weak$$choice2~0_In220663219, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In220663219|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In220663219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In220663219, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In220663219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In220663219, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out220663219|, ~weak$$choice2~0=~weak$$choice2~0_In220663219, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out220663219|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:12:11,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:12:11,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:12:11,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:12:11 BasicIcfg [2019-12-27 17:12:11,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:12:11,935 INFO L168 Benchmark]: Toolchain (without parser) took 36765.97 ms. Allocated memory was 140.0 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 102.7 MB in the beginning and 916.1 MB in the end (delta: -813.3 MB). Peak memory consumption was 824.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:12:11,936 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:12:11,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 910.90 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 102.5 MB in the beginning and 153.0 MB in the end (delta: -50.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:12:11,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.17 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 149.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:12:11,938 INFO L168 Benchmark]: Boogie Preprocessor took 44.60 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 147.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:12:11,941 INFO L168 Benchmark]: RCFGBuilder took 881.67 ms. Allocated memory is still 201.3 MB. Free memory was 147.2 MB in the beginning and 97.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:12:11,942 INFO L168 Benchmark]: TraceAbstraction took 34849.06 ms. Allocated memory was 201.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 97.3 MB in the beginning and 916.1 MB in the end (delta: -818.8 MB). Peak memory consumption was 757.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:12:11,948 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 910.90 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 102.5 MB in the beginning and 153.0 MB in the end (delta: -50.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.17 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 149.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.60 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 147.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 881.67 ms. Allocated memory is still 201.3 MB. Free memory was 147.2 MB in the beginning and 97.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34849.06 ms. Allocated memory was 201.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 97.3 MB in the beginning and 916.1 MB in the end (delta: -818.8 MB). Peak memory consumption was 757.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L835] FCALL, FORK 0 pthread_create(&t1246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L837] FCALL, FORK 0 pthread_create(&t1247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L839] FCALL, FORK 0 pthread_create(&t1248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] 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) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L810] 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) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 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 [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, 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] [L856] 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) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, 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] [L856] 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) [L857] 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, 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] [L857] 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)) [L858] 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, 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] [L858] 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)) [L859] 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, 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] [L859] 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)) [L860] 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)) [L862] 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)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, 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, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2117 SDtfs, 2624 SDslu, 6137 SDs, 0 SdLazy, 3667 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 76 SyntacticMatches, 27 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 9132 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 171833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...