/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/mix057_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:35:03,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:35:03,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:35:03,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:35:03,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:35:03,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:35:03,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:35:03,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:35:03,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:35:03,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:35:03,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:35:03,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:35:03,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:35:03,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:35:03,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:35:03,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:35:03,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:35:03,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:35:03,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:35:03,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:35:03,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:35:03,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:35:03,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:35:03,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:35:03,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:35:03,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:35:03,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:35:03,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:35:03,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:35:03,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:35:03,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:35:03,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:35:03,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:35:03,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:35:03,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:35:03,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:35:03,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:35:03,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:35:03,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:35:03,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:35:03,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:35:03,828 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:35:03,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:35:03,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:35:03,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:35:03,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:35:03,855 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:35:03,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:35:03,856 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:35:03,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:35:03,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:35:03,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:35:03,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:35:03,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:35:03,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:35:03,859 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:35:03,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:35:03,859 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:35:03,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:35:03,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:35:03,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:35:03,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:35:03,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:35:03,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:35:03,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:35:03,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:35:03,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:35:03,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:35:03,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:35:03,865 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:35:03,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:35:03,866 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:35:03,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:35:04,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:35:04,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:35:04,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:35:04,205 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:35:04,205 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:35:04,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2019-12-27 17:35:04,285 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e401d0e71/31d91e16d9574157ae7e15a7ec8e20b5/FLAGdda20fed8 [2019-12-27 17:35:04,913 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:35:04,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2019-12-27 17:35:04,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e401d0e71/31d91e16d9574157ae7e15a7ec8e20b5/FLAGdda20fed8 [2019-12-27 17:35:05,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e401d0e71/31d91e16d9574157ae7e15a7ec8e20b5 [2019-12-27 17:35:05,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:35:05,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:35:05,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:35:05,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:35:05,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:35:05,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:35:05" (1/1) ... [2019-12-27 17:35:05,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05, skipping insertion in model container [2019-12-27 17:35:05,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:35:05" (1/1) ... [2019-12-27 17:35:05,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:35:05,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:35:05,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:35:05,732 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:35:05,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:35:05,880 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:35:05,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05 WrapperNode [2019-12-27 17:35:05,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:35:05,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:35:05,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:35:05,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:35:05,891 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:35:05" (1/1) ... [2019-12-27 17:35:05,910 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:35:05" (1/1) ... [2019-12-27 17:35:05,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:35:05,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:35:05,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:35:05,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:35:05,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05" (1/1) ... [2019-12-27 17:35:05,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05" (1/1) ... [2019-12-27 17:35:05,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05" (1/1) ... [2019-12-27 17:35:05,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05" (1/1) ... [2019-12-27 17:35:05,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05" (1/1) ... [2019-12-27 17:35:05,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05" (1/1) ... [2019-12-27 17:35:05,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05" (1/1) ... [2019-12-27 17:35:06,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:35:06,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:35:06,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:35:06,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:35:06,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05" (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:35:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:35:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:35:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:35:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:35:06,066 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:35:06,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:35:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:35:06,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:35:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:35:06,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:35:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 17:35:06,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 17:35:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:35:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:35:06,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:35:06,070 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:35:06,822 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:35:06,823 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:35:06,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:35:06 BoogieIcfgContainer [2019-12-27 17:35:06,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:35:06,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:35:06,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:35:06,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:35:06,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:35:05" (1/3) ... [2019-12-27 17:35:06,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ed2100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:35:06, skipping insertion in model container [2019-12-27 17:35:06,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:35:05" (2/3) ... [2019-12-27 17:35:06,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ed2100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:35:06, skipping insertion in model container [2019-12-27 17:35:06,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:35:06" (3/3) ... [2019-12-27 17:35:06,834 INFO L109 eAbstractionObserver]: Analyzing ICFG mix057_rmo.opt.i [2019-12-27 17:35:06,844 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:35:06,845 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:35:06,853 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:35:06,854 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:35:06,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,898 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,898 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,905 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,906 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,906 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,906 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,907 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,907 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,917 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,918 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,923 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,923 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,928 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,928 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,945 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,949 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:35:06,965 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 17:35:06,982 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:35:06,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:35:06,983 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:35:06,983 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:35:06,983 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:35:06,983 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:35:06,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:35:06,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:35:07,001 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 206 transitions [2019-12-27 17:35:07,002 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-27 17:35:07,120 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-27 17:35:07,121 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:35:07,140 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:35:07,157 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-27 17:35:07,255 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-27 17:35:07,255 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:35:07,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:35:07,277 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 17:35:07,279 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:35:12,664 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 17:35:12,807 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 17:35:12,827 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56276 [2019-12-27 17:35:12,828 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 17:35:12,831 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 100 transitions [2019-12-27 17:35:15,458 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32878 states. [2019-12-27 17:35:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 32878 states. [2019-12-27 17:35:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 17:35:15,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:15,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:35:15,468 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:15,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:15,475 INFO L82 PathProgramCache]: Analyzing trace with hash -667351009, now seen corresponding path program 1 times [2019-12-27 17:35:15,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:15,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203879100] [2019-12-27 17:35:15,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:15,724 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:35:15,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203879100] [2019-12-27 17:35:15,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:15,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:35:15,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223309015] [2019-12-27 17:35:15,727 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:15,733 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:15,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 17:35:15,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:15,753 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:35:15,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:35:15,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:15,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:35:15,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:35:15,771 INFO L87 Difference]: Start difference. First operand 32878 states. Second operand 3 states. [2019-12-27 17:35:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:16,553 INFO L93 Difference]: Finished difference Result 32686 states and 139960 transitions. [2019-12-27 17:35:16,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:35:16,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 17:35:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:16,914 INFO L225 Difference]: With dead ends: 32686 [2019-12-27 17:35:16,914 INFO L226 Difference]: Without dead ends: 32062 [2019-12-27 17:35:16,915 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:35:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32062 states. [2019-12-27 17:35:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32062 to 32062. [2019-12-27 17:35:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32062 states. [2019-12-27 17:35:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32062 states to 32062 states and 137412 transitions. [2019-12-27 17:35:18,694 INFO L78 Accepts]: Start accepts. Automaton has 32062 states and 137412 transitions. Word has length 9 [2019-12-27 17:35:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:18,695 INFO L462 AbstractCegarLoop]: Abstraction has 32062 states and 137412 transitions. [2019-12-27 17:35:18,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:35:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 32062 states and 137412 transitions. [2019-12-27 17:35:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:35:18,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:18,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:35:18,703 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash -139405083, now seen corresponding path program 1 times [2019-12-27 17:35:18,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:18,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960300985] [2019-12-27 17:35:18,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:18,816 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:35:18,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960300985] [2019-12-27 17:35:18,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:18,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:35:18,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1058111034] [2019-12-27 17:35:18,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:18,819 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:18,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 17:35:18,826 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:18,864 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:35:18,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:35:18,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:18,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:35:18,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:35:18,867 INFO L87 Difference]: Start difference. First operand 32062 states and 137412 transitions. Second operand 5 states. [2019-12-27 17:35:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:21,311 INFO L93 Difference]: Finished difference Result 51166 states and 211740 transitions. [2019-12-27 17:35:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:35:21,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 17:35:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:21,591 INFO L225 Difference]: With dead ends: 51166 [2019-12-27 17:35:21,591 INFO L226 Difference]: Without dead ends: 51138 [2019-12-27 17:35:21,592 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:35:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51138 states. [2019-12-27 17:35:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51138 to 46670. [2019-12-27 17:35:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46670 states. [2019-12-27 17:35:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46670 states to 46670 states and 195108 transitions. [2019-12-27 17:35:23,723 INFO L78 Accepts]: Start accepts. Automaton has 46670 states and 195108 transitions. Word has length 15 [2019-12-27 17:35:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:23,724 INFO L462 AbstractCegarLoop]: Abstraction has 46670 states and 195108 transitions. [2019-12-27 17:35:23,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:35:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 46670 states and 195108 transitions. [2019-12-27 17:35:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:35:23,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:23,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:35:23,728 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:23,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:23,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2113277815, now seen corresponding path program 1 times [2019-12-27 17:35:23,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:23,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468075122] [2019-12-27 17:35:23,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:23,809 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:35:23,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468075122] [2019-12-27 17:35:23,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:23,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:35:23,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [514771610] [2019-12-27 17:35:23,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:23,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:23,819 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 17:35:23,819 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:23,819 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:35:23,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:35:23,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:23,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:35:23,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:35:23,821 INFO L87 Difference]: Start difference. First operand 46670 states and 195108 transitions. Second operand 3 states. [2019-12-27 17:35:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:24,026 INFO L93 Difference]: Finished difference Result 36669 states and 141744 transitions. [2019-12-27 17:35:24,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:35:24,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 17:35:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:24,265 INFO L225 Difference]: With dead ends: 36669 [2019-12-27 17:35:24,265 INFO L226 Difference]: Without dead ends: 36669 [2019-12-27 17:35:24,266 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:35:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36669 states. [2019-12-27 17:35:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36669 to 36669. [2019-12-27 17:35:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36669 states. [2019-12-27 17:35:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36669 states to 36669 states and 141744 transitions. [2019-12-27 17:35:27,287 INFO L78 Accepts]: Start accepts. Automaton has 36669 states and 141744 transitions. Word has length 15 [2019-12-27 17:35:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:27,288 INFO L462 AbstractCegarLoop]: Abstraction has 36669 states and 141744 transitions. [2019-12-27 17:35:27,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:35:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 36669 states and 141744 transitions. [2019-12-27 17:35:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:35:27,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:27,291 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:35:27,291 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:27,291 INFO L82 PathProgramCache]: Analyzing trace with hash -456655226, now seen corresponding path program 1 times [2019-12-27 17:35:27,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:27,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928852516] [2019-12-27 17:35:27,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:27,346 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:35:27,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928852516] [2019-12-27 17:35:27,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:27,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:35:27,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1407750405] [2019-12-27 17:35:27,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:27,349 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:27,351 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 17:35:27,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:27,355 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:35:27,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:35:27,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:27,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:35:27,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:35:27,356 INFO L87 Difference]: Start difference. First operand 36669 states and 141744 transitions. Second operand 4 states. [2019-12-27 17:35:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:27,460 INFO L93 Difference]: Finished difference Result 15339 states and 49236 transitions. [2019-12-27 17:35:27,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:35:27,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:35:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:27,492 INFO L225 Difference]: With dead ends: 15339 [2019-12-27 17:35:27,492 INFO L226 Difference]: Without dead ends: 15339 [2019-12-27 17:35:27,493 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:35:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15339 states. [2019-12-27 17:35:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15339 to 15339. [2019-12-27 17:35:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15339 states. [2019-12-27 17:35:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 49236 transitions. [2019-12-27 17:35:28,072 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 49236 transitions. Word has length 16 [2019-12-27 17:35:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:28,072 INFO L462 AbstractCegarLoop]: Abstraction has 15339 states and 49236 transitions. [2019-12-27 17:35:28,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:35:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 49236 transitions. [2019-12-27 17:35:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:35:28,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:28,074 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:35:28,074 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:28,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:28,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1764835742, now seen corresponding path program 1 times [2019-12-27 17:35:28,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:28,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749700722] [2019-12-27 17:35:28,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:28,131 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:35:28,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749700722] [2019-12-27 17:35:28,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:28,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:35:28,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884113123] [2019-12-27 17:35:28,133 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:28,135 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:28,138 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 17:35:28,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:28,186 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:35:28,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:35:28,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:35:28,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:35:28,188 INFO L87 Difference]: Start difference. First operand 15339 states and 49236 transitions. Second operand 7 states. [2019-12-27 17:35:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:28,257 INFO L93 Difference]: Finished difference Result 2638 states and 6819 transitions. [2019-12-27 17:35:28,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:35:28,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 17:35:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:28,262 INFO L225 Difference]: With dead ends: 2638 [2019-12-27 17:35:28,262 INFO L226 Difference]: Without dead ends: 2638 [2019-12-27 17:35:28,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:35:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2019-12-27 17:35:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2638. [2019-12-27 17:35:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2019-12-27 17:35:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 6819 transitions. [2019-12-27 17:35:28,293 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 6819 transitions. Word has length 17 [2019-12-27 17:35:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:28,294 INFO L462 AbstractCegarLoop]: Abstraction has 2638 states and 6819 transitions. [2019-12-27 17:35:28,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:35:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 6819 transitions. [2019-12-27 17:35:28,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 17:35:28,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:28,297 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:35:28,297 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:28,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:28,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1144833891, now seen corresponding path program 1 times [2019-12-27 17:35:28,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:28,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904678422] [2019-12-27 17:35:28,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:28,403 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:35:28,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904678422] [2019-12-27 17:35:28,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:28,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:35:28,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599218776] [2019-12-27 17:35:28,405 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:28,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:28,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 17:35:28,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:28,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:28,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:35:28,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:35:28,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:28,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:35:28,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:35:28,733 INFO L87 Difference]: Start difference. First operand 2638 states and 6819 transitions. Second operand 11 states. [2019-12-27 17:35:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:29,049 INFO L93 Difference]: Finished difference Result 1225 states and 3490 transitions. [2019-12-27 17:35:29,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:35:29,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-12-27 17:35:29,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:29,053 INFO L225 Difference]: With dead ends: 1225 [2019-12-27 17:35:29,054 INFO L226 Difference]: Without dead ends: 1225 [2019-12-27 17:35:29,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:35:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-12-27 17:35:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1110. [2019-12-27 17:35:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-12-27 17:35:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3167 transitions. [2019-12-27 17:35:29,070 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3167 transitions. Word has length 29 [2019-12-27 17:35:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:29,070 INFO L462 AbstractCegarLoop]: Abstraction has 1110 states and 3167 transitions. [2019-12-27 17:35:29,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:35:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3167 transitions. [2019-12-27 17:35:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:35:29,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:29,074 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:35:29,074 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:29,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash -275883304, now seen corresponding path program 1 times [2019-12-27 17:35:29,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:29,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848548338] [2019-12-27 17:35:29,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:29,158 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:35:29,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848548338] [2019-12-27 17:35:29,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:29,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:35:29,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [589597384] [2019-12-27 17:35:29,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:29,177 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:29,246 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 178 transitions. [2019-12-27 17:35:29,246 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:29,247 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:35:29,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:35:29,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:29,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:35:29,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:35:29,248 INFO L87 Difference]: Start difference. First operand 1110 states and 3167 transitions. Second operand 3 states. [2019-12-27 17:35:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:29,305 INFO L93 Difference]: Finished difference Result 1120 states and 3182 transitions. [2019-12-27 17:35:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:35:29,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 17:35:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:29,308 INFO L225 Difference]: With dead ends: 1120 [2019-12-27 17:35:29,309 INFO L226 Difference]: Without dead ends: 1120 [2019-12-27 17:35:29,309 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:35:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-27 17:35:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1114. [2019-12-27 17:35:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-12-27 17:35:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 3175 transitions. [2019-12-27 17:35:29,322 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 3175 transitions. Word has length 58 [2019-12-27 17:35:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:29,322 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 3175 transitions. [2019-12-27 17:35:29,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:35:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 3175 transitions. [2019-12-27 17:35:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:35:29,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:29,326 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:35:29,326 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash -791070951, now seen corresponding path program 1 times [2019-12-27 17:35:29,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:29,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061478937] [2019-12-27 17:35:29,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:29,428 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:35:29,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061478937] [2019-12-27 17:35:29,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:29,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:35:29,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [194487867] [2019-12-27 17:35:29,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:29,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:29,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 178 transitions. [2019-12-27 17:35:29,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:29,509 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:35:29,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:35:29,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:29,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:35:29,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:35:29,510 INFO L87 Difference]: Start difference. First operand 1114 states and 3175 transitions. Second operand 5 states. [2019-12-27 17:35:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:29,951 INFO L93 Difference]: Finished difference Result 1623 states and 4613 transitions. [2019-12-27 17:35:29,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:35:29,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 17:35:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:29,954 INFO L225 Difference]: With dead ends: 1623 [2019-12-27 17:35:29,954 INFO L226 Difference]: Without dead ends: 1623 [2019-12-27 17:35:29,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:35:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2019-12-27 17:35:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1210. [2019-12-27 17:35:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-12-27 17:35:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3463 transitions. [2019-12-27 17:35:29,976 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3463 transitions. Word has length 58 [2019-12-27 17:35:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:29,976 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 3463 transitions. [2019-12-27 17:35:29,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:35:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3463 transitions. [2019-12-27 17:35:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:35:29,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:29,980 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:35:29,980 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:29,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:29,980 INFO L82 PathProgramCache]: Analyzing trace with hash 867176459, now seen corresponding path program 2 times [2019-12-27 17:35:29,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:29,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196709876] [2019-12-27 17:35:29,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:30,085 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:35:30,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196709876] [2019-12-27 17:35:30,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:30,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:35:30,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970293044] [2019-12-27 17:35:30,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:30,103 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:30,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 237 transitions. [2019-12-27 17:35:30,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:30,248 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:35:30,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:35:30,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:30,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:35:30,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:35:30,250 INFO L87 Difference]: Start difference. First operand 1210 states and 3463 transitions. Second operand 8 states. [2019-12-27 17:35:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:30,835 INFO L93 Difference]: Finished difference Result 1720 states and 4824 transitions. [2019-12-27 17:35:30,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:35:30,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-27 17:35:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:30,839 INFO L225 Difference]: With dead ends: 1720 [2019-12-27 17:35:30,839 INFO L226 Difference]: Without dead ends: 1720 [2019-12-27 17:35:30,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:35:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2019-12-27 17:35:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1266. [2019-12-27 17:35:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-12-27 17:35:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 3555 transitions. [2019-12-27 17:35:30,855 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 3555 transitions. Word has length 58 [2019-12-27 17:35:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:30,856 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 3555 transitions. [2019-12-27 17:35:30,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:35:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 3555 transitions. [2019-12-27 17:35:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:35:30,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:30,859 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:35:30,859 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:30,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:30,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2105802411, now seen corresponding path program 3 times [2019-12-27 17:35:30,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:30,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078073168] [2019-12-27 17:35:30,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:31,030 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:35:31,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078073168] [2019-12-27 17:35:31,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:31,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:35:31,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1531921155] [2019-12-27 17:35:31,032 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:31,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:31,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 274 transitions. [2019-12-27 17:35:31,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:31,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:35:31,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:35:31,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:31,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:35:31,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:35:31,180 INFO L87 Difference]: Start difference. First operand 1266 states and 3555 transitions. Second operand 3 states. [2019-12-27 17:35:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:31,248 INFO L93 Difference]: Finished difference Result 1265 states and 3553 transitions. [2019-12-27 17:35:31,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:35:31,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 17:35:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:31,252 INFO L225 Difference]: With dead ends: 1265 [2019-12-27 17:35:31,252 INFO L226 Difference]: Without dead ends: 1265 [2019-12-27 17:35:31,253 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:35:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-27 17:35:31,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 952. [2019-12-27 17:35:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-27 17:35:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2683 transitions. [2019-12-27 17:35:31,275 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2683 transitions. Word has length 58 [2019-12-27 17:35:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:31,275 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 2683 transitions. [2019-12-27 17:35:31,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:35:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2683 transitions. [2019-12-27 17:35:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:35:31,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:31,279 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:35:31,280 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:31,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:31,280 INFO L82 PathProgramCache]: Analyzing trace with hash 654382096, now seen corresponding path program 1 times [2019-12-27 17:35:31,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:31,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901564089] [2019-12-27 17:35:31,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:31,599 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:35:31,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901564089] [2019-12-27 17:35:31,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:31,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:35:31,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1858253802] [2019-12-27 17:35:31,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:31,617 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:31,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 234 transitions. [2019-12-27 17:35:31,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:32,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:35:32,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:35:32,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:32,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:35:32,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:35:32,369 INFO L87 Difference]: Start difference. First operand 952 states and 2683 transitions. Second operand 14 states. [2019-12-27 17:35:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:34,397 INFO L93 Difference]: Finished difference Result 3116 states and 8202 transitions. [2019-12-27 17:35:34,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 17:35:34,397 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-12-27 17:35:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:34,402 INFO L225 Difference]: With dead ends: 3116 [2019-12-27 17:35:34,402 INFO L226 Difference]: Without dead ends: 2104 [2019-12-27 17:35:34,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=379, Invalid=1181, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 17:35:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2019-12-27 17:35:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 808. [2019-12-27 17:35:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-27 17:35:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 2196 transitions. [2019-12-27 17:35:34,418 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 2196 transitions. Word has length 59 [2019-12-27 17:35:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:34,419 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 2196 transitions. [2019-12-27 17:35:34,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:35:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 2196 transitions. [2019-12-27 17:35:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:35:34,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:34,421 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:35:34,421 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:34,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash -516800392, now seen corresponding path program 2 times [2019-12-27 17:35:34,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:34,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59396496] [2019-12-27 17:35:34,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:34,493 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:35:34,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59396496] [2019-12-27 17:35:34,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:34,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:35:34,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1136195860] [2019-12-27 17:35:34,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:34,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:34,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 271 transitions. [2019-12-27 17:35:34,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:34,625 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:35:34,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:35:34,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:34,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:35:34,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:35:34,627 INFO L87 Difference]: Start difference. First operand 808 states and 2196 transitions. Second operand 3 states. [2019-12-27 17:35:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:34,642 INFO L93 Difference]: Finished difference Result 796 states and 2144 transitions. [2019-12-27 17:35:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:35:34,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 17:35:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:34,644 INFO L225 Difference]: With dead ends: 796 [2019-12-27 17:35:34,645 INFO L226 Difference]: Without dead ends: 796 [2019-12-27 17:35:34,645 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:35:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-27 17:35:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2019-12-27 17:35:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-12-27 17:35:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2144 transitions. [2019-12-27 17:35:34,658 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2144 transitions. Word has length 59 [2019-12-27 17:35:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:34,658 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 2144 transitions. [2019-12-27 17:35:34,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:35:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2144 transitions. [2019-12-27 17:35:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:35:34,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:34,660 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:35:34,661 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:34,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:34,661 INFO L82 PathProgramCache]: Analyzing trace with hash -92263015, now seen corresponding path program 1 times [2019-12-27 17:35:34,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:34,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883556344] [2019-12-27 17:35:34,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:34,794 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:35:34,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883556344] [2019-12-27 17:35:34,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:34,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:35:34,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1784368621] [2019-12-27 17:35:34,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:34,815 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:34,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 161 transitions. [2019-12-27 17:35:34,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:34,918 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:35:34,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:35:34,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:34,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:35:34,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:35:34,920 INFO L87 Difference]: Start difference. First operand 796 states and 2144 transitions. Second operand 7 states. [2019-12-27 17:35:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:35,107 INFO L93 Difference]: Finished difference Result 1381 states and 3534 transitions. [2019-12-27 17:35:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:35:35,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 17:35:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:35,108 INFO L225 Difference]: With dead ends: 1381 [2019-12-27 17:35:35,108 INFO L226 Difference]: Without dead ends: 555 [2019-12-27 17:35:35,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:35:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-27 17:35:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 449. [2019-12-27 17:35:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-27 17:35:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 979 transitions. [2019-12-27 17:35:35,116 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 979 transitions. Word has length 60 [2019-12-27 17:35:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:35,116 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 979 transitions. [2019-12-27 17:35:35,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:35:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 979 transitions. [2019-12-27 17:35:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:35:35,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:35,118 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:35:35,118 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:35,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:35,118 INFO L82 PathProgramCache]: Analyzing trace with hash -837634653, now seen corresponding path program 2 times [2019-12-27 17:35:35,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:35,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117762652] [2019-12-27 17:35:35,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:35,231 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:35:35,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117762652] [2019-12-27 17:35:35,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:35,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:35:35,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050236446] [2019-12-27 17:35:35,232 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:35,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:35,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 136 transitions. [2019-12-27 17:35:35,324 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:35,324 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:35:35,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:35:35,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:35:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:35:35,325 INFO L87 Difference]: Start difference. First operand 449 states and 979 transitions. Second operand 5 states. [2019-12-27 17:35:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:35,365 INFO L93 Difference]: Finished difference Result 631 states and 1298 transitions. [2019-12-27 17:35:35,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:35:35,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-27 17:35:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:35,366 INFO L225 Difference]: With dead ends: 631 [2019-12-27 17:35:35,366 INFO L226 Difference]: Without dead ends: 213 [2019-12-27 17:35:35,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:35:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-27 17:35:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-12-27 17:35:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-27 17:35:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 368 transitions. [2019-12-27 17:35:35,373 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 368 transitions. Word has length 60 [2019-12-27 17:35:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:35,373 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 368 transitions. [2019-12-27 17:35:35,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:35:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 368 transitions. [2019-12-27 17:35:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:35:35,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:35,375 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:35:35,375 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash -524819563, now seen corresponding path program 3 times [2019-12-27 17:35:35,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:35,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474954140] [2019-12-27 17:35:35,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:35:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:35:35,616 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:35:35,616 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:35:35,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~weak$$choice2~0_146 0) (= v_~z$w_buff0_used~0_885 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$r_buff1_thd0~0_298 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1533~0.base_24| 1) |v_#valid_73|) (= 0 v_~z$r_buff1_thd2~0_83) (= 0 v_~z$r_buff1_thd4~0_140) (= 0 v_~z$r_buff1_thd1~0_83) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1533~0.base_24| 4)) (= 0 v_~z$flush_delayed~0_36) (= v_~z$r_buff0_thd3~0_92 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p3_EAX~0_100 0) (= v_~z$w_buff0~0_503 0) (= v_~z$w_buff1_used~0_515 0) (= v_~a~0_48 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1533~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1533~0.base_24|) |v_ULTIMATE.start_main_~#t1533~0.offset_18| 0)) |v_#memory_int_25|) (= v_~x~0_57 0) (= v_~z$read_delayed_var~0.base_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1533~0.base_24|) 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1533~0.base_24|) (= v_~z~0_155 0) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= v_~__unbuffered_cnt~0_141 0) (= 0 v_~z$r_buff1_thd3~0_146) (= v_~z$w_buff1~0_306 0) (= v_~z$r_buff0_thd0~0_394 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff0_thd2~0_32 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd4~0_161) (= v_~y~0_76 0) (= v_~z$r_buff0_thd1~0_32 0) (= 0 |v_#NULL.base_5|) (= 0 |v_ULTIMATE.start_main_~#t1533~0.offset_18|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1534~0.offset=|v_ULTIMATE.start_main_~#t1534~0.offset_17|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_59|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_83, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_41|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_32|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_35|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_30|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_394, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_161, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_100, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_48|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_114|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_515, ULTIMATE.start_main_~#t1535~0.offset=|v_ULTIMATE.start_main_~#t1535~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_191|, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_35|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_38|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1536~0.offset=|v_ULTIMATE.start_main_~#t1536~0.offset_17|, ~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_92, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_57, ULTIMATE.start_main_~#t1533~0.base=|v_ULTIMATE.start_main_~#t1533~0.base_24|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_140, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ULTIMATE.start_main_~#t1536~0.base=|v_ULTIMATE.start_main_~#t1536~0.base_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~z$w_buff1~0=v_~z$w_buff1~0_306, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ~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_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_~#t1533~0.offset=|v_ULTIMATE.start_main_~#t1533~0.offset_18|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_298, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_25|, ~y~0=v_~y~0_76, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_885, ~z$w_buff0~0=v_~z$w_buff0~0_503, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_39|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_146, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_122|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_36|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ULTIMATE.start_main_~#t1535~0.base=|v_ULTIMATE.start_main_~#t1535~0.base_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ULTIMATE.start_main_~#t1534~0.base=|v_ULTIMATE.start_main_~#t1534~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_23|, ~z~0=v_~z~0_155, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1534~0.offset, 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, ~z$r_buff0_thd0~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_~#t1535~0.offset, ULTIMATE.start_main_#t~ite37, ~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, ULTIMATE.start_main_~#t1536~0.offset, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1533~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1536~0.base, ~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_~#t1533~0.offset, 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, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1535~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1534~0.base, 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:35:35,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L821-1-->L823: Formula: (and (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1534~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t1534~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t1534~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1534~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1534~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1534~0.base_10|) |v_ULTIMATE.start_main_~#t1534~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1534~0.base_10| 1) |v_#valid_35|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1534~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1534~0.offset=|v_ULTIMATE.start_main_~#t1534~0.offset_9|, ULTIMATE.start_main_~#t1534~0.base=|v_ULTIMATE.start_main_~#t1534~0.base_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1534~0.offset, ULTIMATE.start_main_~#t1534~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 17:35:35,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L823-1-->L825: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1535~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1535~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1535~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1535~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1535~0.base_12|) |v_ULTIMATE.start_main_~#t1535~0.offset_10| 2)) |v_#memory_int_17|) (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t1535~0.base_12| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t1535~0.base_12| 0)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t1535~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1535~0.offset=|v_ULTIMATE.start_main_~#t1535~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1535~0.base=|v_ULTIMATE.start_main_~#t1535~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1535~0.offset, #length, ULTIMATE.start_main_~#t1535~0.base] because there is no mapped edge [2019-12-27 17:35:35,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L825-1-->L827: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1536~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1536~0.base_11|) |v_ULTIMATE.start_main_~#t1536~0.offset_10| 3)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1536~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1536~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1536~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1536~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1536~0.base_11|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1536~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1536~0.base=|v_ULTIMATE.start_main_~#t1536~0.base_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1536~0.offset=|v_ULTIMATE.start_main_~#t1536~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1536~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1536~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 17:35:35,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11| 1) (= v_P3Thread1of1ForFork2_~arg.offset_11 |v_P3Thread1of1ForFork2_#in~arg.offset_11|) (= (mod v_~z$w_buff1_used~0_99 256) 0) (= |v_P3Thread1of1ForFork2_#in~arg.base_11| v_P3Thread1of1ForFork2_~arg.base_11) (= v_~z$w_buff0_used~0_218 1) (= v_~z$w_buff0~0_48 v_~z$w_buff1~0_32) (= 2 v_~z$w_buff0~0_47) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|) (= v_~z$w_buff0_used~0_219 v_~z$w_buff1_used~0_99)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_219, ~z$w_buff0~0=v_~z$w_buff0~0_48, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_11, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_218, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_99, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, ~z$w_buff1~0=v_~z$w_buff1~0_32, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_11, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 17:35:35,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_19 |v_P0Thread1of1ForFork3_#in~arg.base_19|) (= v_~x~0_44 1) (= 0 |v_P0Thread1of1ForFork3_#res.base_11|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_19| v_P0Thread1of1ForFork3_~arg.offset_19) (= 0 |v_P0Thread1of1ForFork3_#res.offset_11|) (= v_~a~0_40 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_19, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_11|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_19, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 17:35:35,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_39 2) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_~y~0_50 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_10| v_P1Thread1of1ForFork0_~arg.offset_10) (= v_P1Thread1of1ForFork0_~arg.base_10 |v_P1Thread1of1ForFork0_#in~arg.base_10|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_10, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_10, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_50, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 17:35:35,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1134667855 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1134667855 256) 0)) (.cse2 (= |P2Thread1of1ForFork1_#t~ite4_Out-1134667855| |P2Thread1of1ForFork1_#t~ite3_Out-1134667855|))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite3_Out-1134667855| ~z$w_buff1~0_In-1134667855) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite3_Out-1134667855| ~z~0_In-1134667855) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1134667855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1134667855, ~z$w_buff1~0=~z$w_buff1~0_In-1134667855, ~z~0=~z~0_In-1134667855} OutVars{P2Thread1of1ForFork1_#t~ite4=|P2Thread1of1ForFork1_#t~ite4_Out-1134667855|, P2Thread1of1ForFork1_#t~ite3=|P2Thread1of1ForFork1_#t~ite3_Out-1134667855|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1134667855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1134667855, ~z$w_buff1~0=~z$w_buff1~0_In-1134667855, ~z~0=~z~0_In-1134667855} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite4, P2Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-27 17:35:35,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In363831369 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In363831369 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite5_Out363831369|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In363831369 |P2Thread1of1ForFork1_#t~ite5_Out363831369|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In363831369, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In363831369} OutVars{P2Thread1of1ForFork1_#t~ite5=|P2Thread1of1ForFork1_#t~ite5_Out363831369|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In363831369, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In363831369} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 17:35:35,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-364069877 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-364069877 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-364069877 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-364069877 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite6_Out-364069877| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite6_Out-364069877| ~z$w_buff1_used~0_In-364069877)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-364069877, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-364069877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-364069877, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-364069877} OutVars{P2Thread1of1ForFork1_#t~ite6=|P2Thread1of1ForFork1_#t~ite6_Out-364069877|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364069877, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-364069877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-364069877, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-364069877} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 17:35:35,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In388838575 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In388838575 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite7_Out388838575| ~z$r_buff0_thd3~0_In388838575)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite7_Out388838575| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In388838575, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In388838575} OutVars{P2Thread1of1ForFork1_#t~ite7=|P2Thread1of1ForFork1_#t~ite7_Out388838575|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388838575, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In388838575} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 17:35:35,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1109304339 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1109304339 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1109304339 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1109304339 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1109304339 |P2Thread1of1ForFork1_#t~ite8_Out-1109304339|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite8_Out-1109304339| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1109304339, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1109304339, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1109304339, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1109304339} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1109304339, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1109304339, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1109304339, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1109304339, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1109304339|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 17:35:35,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L772-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~z$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork1_#t~ite8_46|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_46|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_45|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 17:35:35,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-573863866 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-573863866 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite11_Out-573863866| ~z$w_buff0_used~0_In-573863866)) (and (= |P3Thread1of1ForFork2_#t~ite11_Out-573863866| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-573863866, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-573863866} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-573863866, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-573863866, P3Thread1of1ForFork2_#t~ite11=|P3Thread1of1ForFork2_#t~ite11_Out-573863866|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 17:35:35,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1219370829 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1219370829 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1219370829 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1219370829 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite12_Out-1219370829| ~z$w_buff1_used~0_In-1219370829) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork2_#t~ite12_Out-1219370829|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1219370829, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1219370829, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1219370829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1219370829} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1219370829, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1219370829, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1219370829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1219370829, P3Thread1of1ForFork2_#t~ite12=|P3Thread1of1ForFork2_#t~ite12_Out-1219370829|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 17:35:35,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L801-->L802: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1881698642 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1881698642 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1881698642) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out1881698642 ~z$r_buff0_thd4~0_In1881698642) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1881698642, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1881698642} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1881698642, P3Thread1of1ForFork2_#t~ite13=|P3Thread1of1ForFork2_#t~ite13_Out1881698642|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1881698642} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite13, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 17:35:35,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-728144729 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-728144729 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-728144729 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-728144729 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite14_Out-728144729| 0)) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite14_Out-728144729| ~z$r_buff1_thd4~0_In-728144729) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-728144729, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-728144729, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-728144729, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-728144729} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-728144729, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-728144729, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-728144729, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-728144729, P3Thread1of1ForFork2_#t~ite14=|P3Thread1of1ForFork2_#t~ite14_Out-728144729|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 17:35:35,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L802-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite14_56| v_~z$r_buff1_thd4~0_130) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_130, P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_55|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite14, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:35:35,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L827-1-->L833: Formula: (and (= 4 v_~__unbuffered_cnt~0_21) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 17:35:35,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L833-2-->L833-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1693299632 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1693299632 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In1693299632 |ULTIMATE.start_main_#t~ite19_Out1693299632|)) (and (= |ULTIMATE.start_main_#t~ite19_Out1693299632| ~z$w_buff1~0_In1693299632) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1693299632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1693299632, ~z$w_buff1~0=~z$w_buff1~0_In1693299632, ~z~0=~z~0_In1693299632} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1693299632|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1693299632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1693299632, ~z$w_buff1~0=~z$w_buff1~0_In1693299632, ~z~0=~z~0_In1693299632} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:35:35,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L833-4-->L834: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite19_8|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|, ~z~0=v_~z~0_31, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:35:35,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1669047674 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1669047674 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1669047674| ~z$w_buff0_used~0_In-1669047674) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1669047674| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1669047674, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1669047674} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1669047674, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1669047674, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1669047674|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:35:35,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L835-->L835-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-627772457 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-627772457 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-627772457 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-627772457 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out-627772457| ~z$w_buff1_used~0_In-627772457)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out-627772457| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-627772457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-627772457, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-627772457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-627772457} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-627772457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-627772457, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-627772457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-627772457, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-627772457|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:35:35,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In70899378 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In70899378 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out70899378| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out70899378| ~z$r_buff0_thd0~0_In70899378)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In70899378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In70899378} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In70899378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In70899378, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out70899378|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:35:35,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L837-->L837-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-1024194431 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1024194431 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1024194431 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1024194431 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1024194431 |ULTIMATE.start_main_#t~ite24_Out-1024194431|)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-1024194431|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1024194431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1024194431, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1024194431, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1024194431} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1024194431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1024194431, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1024194431, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1024194431|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1024194431} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 17:35:35,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L849-->L850: Formula: (and (= v_~z$r_buff0_thd0~0_119 v_~z$r_buff0_thd0~0_120) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} 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:35:35,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L850-->L850-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-786335967 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In-786335967| |ULTIMATE.start_main_#t~ite45_Out-786335967|) (= ~z$r_buff1_thd0~0_In-786335967 |ULTIMATE.start_main_#t~ite46_Out-786335967|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-786335967| |ULTIMATE.start_main_#t~ite46_Out-786335967|) (= ~z$r_buff1_thd0~0_In-786335967 |ULTIMATE.start_main_#t~ite45_Out-786335967|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-786335967 256) 0))) (or (and (= (mod ~z$r_buff1_thd0~0_In-786335967 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In-786335967 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-786335967 256)))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-786335967, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-786335967, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-786335967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-786335967, ~weak$$choice2~0=~weak$$choice2~0_In-786335967, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-786335967|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-786335967, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-786335967, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-786335967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-786335967, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-786335967|, ~weak$$choice2~0=~weak$$choice2~0_In-786335967, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-786335967|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:35:35,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L852-->L855-1: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_120) (= 0 v_~z$flush_delayed~0_24) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (not (= 0 (mod v_~z$flush_delayed~0_25 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_25} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~z~0=v_~z~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[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:35:35,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L855-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:35:35,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:35:35 BasicIcfg [2019-12-27 17:35:35,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:35:35,785 INFO L168 Benchmark]: Toolchain (without parser) took 30644.78 ms. Allocated memory was 137.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 280.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:35,787 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 17:35:35,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.56 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 153.8 MB in the end (delta: -53.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:35,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.80 ms. Allocated memory is still 200.3 MB. Free memory was 153.8 MB in the beginning and 150.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:35,791 INFO L168 Benchmark]: Boogie Preprocessor took 40.90 ms. Allocated memory is still 200.3 MB. Free memory was 150.4 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:35,792 INFO L168 Benchmark]: RCFGBuilder took 824.50 ms. Allocated memory is still 200.3 MB. Free memory was 148.4 MB in the beginning and 98.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:35,795 INFO L168 Benchmark]: TraceAbstraction took 28956.54 ms. Allocated memory was 200.3 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 215.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:35,803 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.19 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.56 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 153.8 MB in the end (delta: -53.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.80 ms. Allocated memory is still 200.3 MB. Free memory was 153.8 MB in the beginning and 150.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.90 ms. Allocated memory is still 200.3 MB. Free memory was 150.4 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 824.50 ms. Allocated memory is still 200.3 MB. Free memory was 148.4 MB in the beginning and 98.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28956.54 ms. Allocated memory was 200.3 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 215.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 178 ProgramPointsBefore, 91 ProgramPointsAfterwards, 206 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 24 ChoiceCompositions, 4617 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 231 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 56276 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t1533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t1534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L788] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L789] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L790] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L791] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L792] 4 z$r_buff0_thd4 = (_Bool)1 [L795] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 3 y = 2 [L765] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L769] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 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 [L771] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 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) [L799] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L800] 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 [L833] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 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 [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L837] 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 [L840] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L841] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L842] 0 z$flush_delayed = weak$$choice2 [L843] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L844] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L844] 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) [L845] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L845] 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)) [L846] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L846] 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)) [L847] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L847] 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)) [L848] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L848] 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)) [L850] 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)) [L851] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1597 SDtfs, 2398 SDslu, 2972 SDs, 0 SdLazy, 2037 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 64 SyntacticMatches, 19 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46670occurred 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: 7.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 7171 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 103280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...