/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:16:24,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:16:24,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:16:24,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:16:24,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:16:24,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:16:24,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:16:24,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:16:24,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:16:24,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:16:24,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:16:24,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:16:24,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:16:24,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:16:24,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:16:24,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:16:24,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:16:24,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:16:24,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:16:24,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:16:24,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:16:24,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:16:24,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:16:24,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:16:24,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:16:24,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:16:24,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:16:24,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:16:24,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:16:24,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:16:24,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:16:24,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:16:24,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:16:24,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:16:24,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:16:24,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:16:24,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:16:24,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:16:24,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:16:24,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:16:24,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:16:24,820 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.epf [2019-12-18 17:16:24,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:16:24,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:16:24,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:16:24,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:16:24,852 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:16:24,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:16:24,852 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:16:24,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:16:24,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:16:24,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:16:24,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:16:24,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:16:24,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:16:24,854 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:16:24,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:16:24,854 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:16:24,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:16:24,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:16:24,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:16:24,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:16:24,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:16:24,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:16:24,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:16:24,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:16:24,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:16:24,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:16:24,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:16:24,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:16:24,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:16:25,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:16:25,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:16:25,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:16:25,158 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:16:25,158 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:16:25,159 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.opt.i [2019-12-18 17:16:25,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959b94687/78c7a09422344c948048dc3eb0f9c51d/FLAG764fa638d [2019-12-18 17:16:25,816 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:16:25,817 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.opt.i [2019-12-18 17:16:25,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959b94687/78c7a09422344c948048dc3eb0f9c51d/FLAG764fa638d [2019-12-18 17:16:26,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959b94687/78c7a09422344c948048dc3eb0f9c51d [2019-12-18 17:16:26,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:16:26,018 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:16:26,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:16:26,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:16:26,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:16:26,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d5173bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26, skipping insertion in model container [2019-12-18 17:16:26,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:16:26,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:16:26,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:16:26,633 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:16:26,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:16:26,786 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:16:26,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26 WrapperNode [2019-12-18 17:16:26,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:16:26,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:16:26,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:16:26,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:16:26,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:16:26,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:16:26,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:16:26,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:16:26,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (1/1) ... [2019-12-18 17:16:26,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:16:26,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:16:26,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:16:26,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:16:26,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (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-18 17:16:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:16:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:16:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:16:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:16:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:16:26,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:16:26,955 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:16:26,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:16:26,955 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:16:26,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:16:26,955 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:16:26,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:16:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:16:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:16:26,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:16:26,958 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:16:27,726 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:16:27,726 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:16:27,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:16:27 BoogieIcfgContainer [2019-12-18 17:16:27,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:16:27,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:16:27,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:16:27,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:16:27,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:16:26" (1/3) ... [2019-12-18 17:16:27,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9b579b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:16:27, skipping insertion in model container [2019-12-18 17:16:27,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:16:26" (2/3) ... [2019-12-18 17:16:27,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9b579b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:16:27, skipping insertion in model container [2019-12-18 17:16:27,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:16:27" (3/3) ... [2019-12-18 17:16:27,738 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_power.opt.i [2019-12-18 17:16:27,748 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:16:27,749 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:16:27,756 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:16:27,758 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:16:27,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,811 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,811 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,817 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,817 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,877 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,878 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,878 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,879 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,879 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,888 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,889 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,893 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,895 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,902 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,903 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,904 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,907 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,908 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:16:27,923 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:16:27,944 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:16:27,944 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:16:27,944 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:16:27,944 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:16:27,944 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:16:27,945 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:16:27,945 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:16:27,945 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:16:27,966 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-18 17:16:27,968 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 17:16:28,049 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 17:16:28,049 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:16:28,065 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 17:16:28,085 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 17:16:28,130 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 17:16:28,130 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:16:28,137 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 17:16:28,153 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 17:16:28,154 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:16:33,121 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:16:33,236 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:16:33,731 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 17:16:33,896 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 17:16:33,915 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-18 17:16:33,916 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 17:16:33,920 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-18 17:16:35,248 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-18 17:16:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-18 17:16:35,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:16:35,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:35,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:35,257 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-18 17:16:35,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:35,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-18 17:16:35,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:35,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611927502] [2019-12-18 17:16:35,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:35,620 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-18 17:16:35,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611927502] [2019-12-18 17:16:35,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:35,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:16:35,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961889604] [2019-12-18 17:16:35,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:16:35,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:35,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:16:35,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:16:35,646 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-18 17:16:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:36,089 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-18 17:16:36,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:16:36,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:16:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:37,123 INFO L225 Difference]: With dead ends: 20958 [2019-12-18 17:16:37,123 INFO L226 Difference]: Without dead ends: 19662 [2019-12-18 17:16:37,124 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-18 17:16:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-18 17:16:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-18 17:16:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-18 17:16:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-18 17:16:38,319 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-18 17:16:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:38,320 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-18 17:16:38,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:16:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-18 17:16:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:16:38,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:38,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:38,333 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-18 17:16:38,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:38,334 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-18 17:16:38,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:38,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627085659] [2019-12-18 17:16:38,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:38,472 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-18 17:16:38,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627085659] [2019-12-18 17:16:38,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:38,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:38,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196493681] [2019-12-18 17:16:38,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:38,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:38,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:38,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:38,476 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-18 17:16:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:38,914 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-18 17:16:38,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:16:38,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:16:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:39,077 INFO L225 Difference]: With dead ends: 30494 [2019-12-18 17:16:39,077 INFO L226 Difference]: Without dead ends: 30438 [2019-12-18 17:16:39,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:16:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-18 17:16:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-18 17:16:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-18 17:16:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-18 17:16:41,516 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-18 17:16:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:41,517 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-18 17:16:41,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-18 17:16:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 17:16:41,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:41,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:41,523 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-18 17:16:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-18 17:16:41,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:41,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040128280] [2019-12-18 17:16:41,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:41,610 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-18 17:16:41,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040128280] [2019-12-18 17:16:41,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:41,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:41,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895963337] [2019-12-18 17:16:41,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:41,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:41,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:41,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:41,613 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-18 17:16:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:41,988 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-18 17:16:41,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:16:41,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 17:16:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:42,177 INFO L225 Difference]: With dead ends: 35230 [2019-12-18 17:16:42,177 INFO L226 Difference]: Without dead ends: 35182 [2019-12-18 17:16:42,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:16:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-18 17:16:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-18 17:16:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-18 17:16:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-18 17:16:45,723 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-18 17:16:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:45,723 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-18 17:16:45,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-18 17:16:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 17:16:45,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:45,744 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] [2019-12-18 17:16:45,744 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-18 17:16:45,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:45,744 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-18 17:16:45,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:45,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297870720] [2019-12-18 17:16:45,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:45,851 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-18 17:16:45,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297870720] [2019-12-18 17:16:45,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:45,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:16:45,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608052205] [2019-12-18 17:16:45,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:16:45,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:45,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:16:45,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:16:45,853 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-18 17:16:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:46,014 INFO L93 Difference]: Finished difference Result 29747 states and 123892 transitions. [2019-12-18 17:16:46,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:16:46,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 17:16:46,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:46,099 INFO L225 Difference]: With dead ends: 29747 [2019-12-18 17:16:46,100 INFO L226 Difference]: Without dead ends: 29747 [2019-12-18 17:16:46,100 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-18 17:16:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2019-12-18 17:16:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 29747. [2019-12-18 17:16:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29747 states. [2019-12-18 17:16:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29747 states to 29747 states and 123892 transitions. [2019-12-18 17:16:47,023 INFO L78 Accepts]: Start accepts. Automaton has 29747 states and 123892 transitions. Word has length 20 [2019-12-18 17:16:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:47,023 INFO L462 AbstractCegarLoop]: Abstraction has 29747 states and 123892 transitions. [2019-12-18 17:16:47,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:16:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 29747 states and 123892 transitions. [2019-12-18 17:16:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:16:47,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:47,035 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] [2019-12-18 17:16:47,035 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-18 17:16:47,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:47,035 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-18 17:16:47,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:47,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829001862] [2019-12-18 17:16:47,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:47,091 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-18 17:16:47,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829001862] [2019-12-18 17:16:47,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:47,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:47,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628070399] [2019-12-18 17:16:47,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:16:47,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:16:47,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:16:47,093 INFO L87 Difference]: Start difference. First operand 29747 states and 123892 transitions. Second operand 3 states. [2019-12-18 17:16:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:47,279 INFO L93 Difference]: Finished difference Result 36709 states and 144810 transitions. [2019-12-18 17:16:47,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:16:47,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 17:16:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:47,365 INFO L225 Difference]: With dead ends: 36709 [2019-12-18 17:16:47,366 INFO L226 Difference]: Without dead ends: 30167 [2019-12-18 17:16:47,366 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-18 17:16:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-18 17:16:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 29499. [2019-12-18 17:16:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29499 states. [2019-12-18 17:16:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29499 states to 29499 states and 115623 transitions. [2019-12-18 17:16:48,415 INFO L78 Accepts]: Start accepts. Automaton has 29499 states and 115623 transitions. Word has length 21 [2019-12-18 17:16:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:48,416 INFO L462 AbstractCegarLoop]: Abstraction has 29499 states and 115623 transitions. [2019-12-18 17:16:48,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:16:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 29499 states and 115623 transitions. [2019-12-18 17:16:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:16:48,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:48,426 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] [2019-12-18 17:16:48,427 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-18 17:16:48,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:48,427 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-18 17:16:48,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:48,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107121267] [2019-12-18 17:16:48,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:48,476 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-18 17:16:48,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107121267] [2019-12-18 17:16:48,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:48,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:16:48,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389153784] [2019-12-18 17:16:48,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:16:48,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:48,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:16:48,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:16:48,478 INFO L87 Difference]: Start difference. First operand 29499 states and 115623 transitions. Second operand 3 states. [2019-12-18 17:16:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:48,933 INFO L93 Difference]: Finished difference Result 29289 states and 114842 transitions. [2019-12-18 17:16:48,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:16:48,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 17:16:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:49,008 INFO L225 Difference]: With dead ends: 29289 [2019-12-18 17:16:49,009 INFO L226 Difference]: Without dead ends: 29289 [2019-12-18 17:16:49,009 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-18 17:16:49,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29289 states. [2019-12-18 17:16:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29289 to 29205. [2019-12-18 17:16:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29205 states. [2019-12-18 17:16:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29205 states to 29205 states and 114644 transitions. [2019-12-18 17:16:50,027 INFO L78 Accepts]: Start accepts. Automaton has 29205 states and 114644 transitions. Word has length 21 [2019-12-18 17:16:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:50,027 INFO L462 AbstractCegarLoop]: Abstraction has 29205 states and 114644 transitions. [2019-12-18 17:16:50,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:16:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 29205 states and 114644 transitions. [2019-12-18 17:16:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:16:50,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:50,041 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] [2019-12-18 17:16:50,041 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-18 17:16:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:50,041 INFO L82 PathProgramCache]: Analyzing trace with hash 291958640, now seen corresponding path program 1 times [2019-12-18 17:16:50,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:50,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627381601] [2019-12-18 17:16:50,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:50,148 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-18 17:16:50,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627381601] [2019-12-18 17:16:50,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:50,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:16:50,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348208751] [2019-12-18 17:16:50,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:16:50,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:50,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:16:50,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:16:50,152 INFO L87 Difference]: Start difference. First operand 29205 states and 114644 transitions. Second operand 5 states. [2019-12-18 17:16:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:50,273 INFO L93 Difference]: Finished difference Result 12827 states and 41537 transitions. [2019-12-18 17:16:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:16:50,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:16:50,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:50,295 INFO L225 Difference]: With dead ends: 12827 [2019-12-18 17:16:50,295 INFO L226 Difference]: Without dead ends: 10855 [2019-12-18 17:16:50,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:16:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10855 states. [2019-12-18 17:16:50,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10855 to 10855. [2019-12-18 17:16:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10855 states. [2019-12-18 17:16:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10855 states to 10855 states and 34345 transitions. [2019-12-18 17:16:50,454 INFO L78 Accepts]: Start accepts. Automaton has 10855 states and 34345 transitions. Word has length 22 [2019-12-18 17:16:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:50,455 INFO L462 AbstractCegarLoop]: Abstraction has 10855 states and 34345 transitions. [2019-12-18 17:16:50,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:16:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 10855 states and 34345 transitions. [2019-12-18 17:16:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 17:16:50,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:50,459 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] [2019-12-18 17:16:50,459 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-18 17:16:50,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:50,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1876344722, now seen corresponding path program 1 times [2019-12-18 17:16:50,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:50,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029106623] [2019-12-18 17:16:50,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:50,506 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-18 17:16:50,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029106623] [2019-12-18 17:16:50,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:50,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:16:50,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918129733] [2019-12-18 17:16:50,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:50,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:50,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:50,509 INFO L87 Difference]: Start difference. First operand 10855 states and 34345 transitions. Second operand 4 states. [2019-12-18 17:16:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:50,603 INFO L93 Difference]: Finished difference Result 16412 states and 52778 transitions. [2019-12-18 17:16:50,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:16:50,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 17:16:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:50,624 INFO L225 Difference]: With dead ends: 16412 [2019-12-18 17:16:50,625 INFO L226 Difference]: Without dead ends: 8743 [2019-12-18 17:16:50,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:16:50,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2019-12-18 17:16:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 8444. [2019-12-18 17:16:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8444 states. [2019-12-18 17:16:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 26914 transitions. [2019-12-18 17:16:50,812 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 26914 transitions. Word has length 23 [2019-12-18 17:16:50,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:50,814 INFO L462 AbstractCegarLoop]: Abstraction has 8444 states and 26914 transitions. [2019-12-18 17:16:50,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 26914 transitions. [2019-12-18 17:16:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 17:16:50,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:50,819 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] [2019-12-18 17:16:50,819 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-18 17:16:50,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:50,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1799428640, now seen corresponding path program 2 times [2019-12-18 17:16:50,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:50,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662693054] [2019-12-18 17:16:50,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:50,934 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-18 17:16:50,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662693054] [2019-12-18 17:16:50,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:50,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:16:50,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7326812] [2019-12-18 17:16:50,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:16:50,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:50,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:16:50,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:16:50,936 INFO L87 Difference]: Start difference. First operand 8444 states and 26914 transitions. Second operand 6 states. [2019-12-18 17:16:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:51,049 INFO L93 Difference]: Finished difference Result 3436 states and 9854 transitions. [2019-12-18 17:16:51,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:16:51,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-18 17:16:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:51,055 INFO L225 Difference]: With dead ends: 3436 [2019-12-18 17:16:51,055 INFO L226 Difference]: Without dead ends: 2817 [2019-12-18 17:16:51,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:16:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-12-18 17:16:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2797. [2019-12-18 17:16:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-12-18 17:16:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 7967 transitions. [2019-12-18 17:16:51,118 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 7967 transitions. Word has length 23 [2019-12-18 17:16:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:51,118 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 7967 transitions. [2019-12-18 17:16:51,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:16:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 7967 transitions. [2019-12-18 17:16:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:16:51,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:51,129 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] [2019-12-18 17:16:51,129 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-18 17:16:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-18 17:16:51,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:51,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019710859] [2019-12-18 17:16:51,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:51,188 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-18 17:16:51,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019710859] [2019-12-18 17:16:51,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:51,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:16:51,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298782035] [2019-12-18 17:16:51,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:16:51,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:51,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:16:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:16:51,191 INFO L87 Difference]: Start difference. First operand 2797 states and 7967 transitions. Second operand 3 states. [2019-12-18 17:16:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:51,252 INFO L93 Difference]: Finished difference Result 4322 states and 12247 transitions. [2019-12-18 17:16:51,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:16:51,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 17:16:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:51,261 INFO L225 Difference]: With dead ends: 4322 [2019-12-18 17:16:51,261 INFO L226 Difference]: Without dead ends: 4322 [2019-12-18 17:16:51,262 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-18 17:16:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2019-12-18 17:16:51,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 3273. [2019-12-18 17:16:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-12-18 17:16:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 9436 transitions. [2019-12-18 17:16:51,332 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 9436 transitions. Word has length 32 [2019-12-18 17:16:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:51,333 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 9436 transitions. [2019-12-18 17:16:51,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:16:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 9436 transitions. [2019-12-18 17:16:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:16:51,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:51,339 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] [2019-12-18 17:16:51,339 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-18 17:16:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-18 17:16:51,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:51,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341625492] [2019-12-18 17:16:51,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:51,517 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-18 17:16:51,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341625492] [2019-12-18 17:16:51,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:51,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:16:51,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136782235] [2019-12-18 17:16:51,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:16:51,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:51,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:16:51,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:16:51,520 INFO L87 Difference]: Start difference. First operand 3273 states and 9436 transitions. Second operand 6 states. [2019-12-18 17:16:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:52,069 INFO L93 Difference]: Finished difference Result 6672 states and 18337 transitions. [2019-12-18 17:16:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:16:52,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 17:16:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:52,079 INFO L225 Difference]: With dead ends: 6672 [2019-12-18 17:16:52,079 INFO L226 Difference]: Without dead ends: 6534 [2019-12-18 17:16:52,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:16:52,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-18 17:16:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 3403. [2019-12-18 17:16:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-12-18 17:16:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 9764 transitions. [2019-12-18 17:16:52,134 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 9764 transitions. Word has length 32 [2019-12-18 17:16:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:52,135 INFO L462 AbstractCegarLoop]: Abstraction has 3403 states and 9764 transitions. [2019-12-18 17:16:52,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:16:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 9764 transitions. [2019-12-18 17:16:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:16:52,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:52,140 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] [2019-12-18 17:16:52,140 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-18 17:16:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash 668169174, now seen corresponding path program 1 times [2019-12-18 17:16:52,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:52,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727791148] [2019-12-18 17:16:52,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:52,239 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-18 17:16:52,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727791148] [2019-12-18 17:16:52,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:52,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:16:52,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367369429] [2019-12-18 17:16:52,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:16:52,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:16:52,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:16:52,241 INFO L87 Difference]: Start difference. First operand 3403 states and 9764 transitions. Second operand 5 states. [2019-12-18 17:16:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:52,660 INFO L93 Difference]: Finished difference Result 5197 states and 14640 transitions. [2019-12-18 17:16:52,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:16:52,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-18 17:16:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:52,668 INFO L225 Difference]: With dead ends: 5197 [2019-12-18 17:16:52,668 INFO L226 Difference]: Without dead ends: 5197 [2019-12-18 17:16:52,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:16:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2019-12-18 17:16:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 4563. [2019-12-18 17:16:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4563 states. [2019-12-18 17:16:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 13058 transitions. [2019-12-18 17:16:52,749 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 13058 transitions. Word has length 32 [2019-12-18 17:16:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:52,749 INFO L462 AbstractCegarLoop]: Abstraction has 4563 states and 13058 transitions. [2019-12-18 17:16:52,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:16:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 13058 transitions. [2019-12-18 17:16:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:16:52,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:52,757 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] [2019-12-18 17:16:52,757 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-18 17:16:52,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-18 17:16:52,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:52,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072679072] [2019-12-18 17:16:52,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:52,843 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-18 17:16:52,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072679072] [2019-12-18 17:16:52,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:52,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:16:52,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545615865] [2019-12-18 17:16:52,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:16:52,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:52,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:16:52,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:16:52,845 INFO L87 Difference]: Start difference. First operand 4563 states and 13058 transitions. Second operand 6 states. [2019-12-18 17:16:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:53,266 INFO L93 Difference]: Finished difference Result 8693 states and 23894 transitions. [2019-12-18 17:16:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:16:53,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 17:16:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:53,278 INFO L225 Difference]: With dead ends: 8693 [2019-12-18 17:16:53,278 INFO L226 Difference]: Without dead ends: 8549 [2019-12-18 17:16:53,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:16:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8549 states. [2019-12-18 17:16:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8549 to 4625. [2019-12-18 17:16:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-18 17:16:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 13321 transitions. [2019-12-18 17:16:53,385 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 13321 transitions. Word has length 33 [2019-12-18 17:16:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:53,385 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 13321 transitions. [2019-12-18 17:16:53,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:16:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 13321 transitions. [2019-12-18 17:16:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:16:53,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:53,397 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] [2019-12-18 17:16:53,398 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-18 17:16:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1231616427, now seen corresponding path program 1 times [2019-12-18 17:16:53,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:53,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012323185] [2019-12-18 17:16:53,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:53,491 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-18 17:16:53,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012323185] [2019-12-18 17:16:53,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:53,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:16:53,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855330306] [2019-12-18 17:16:53,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:16:53,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:16:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:16:53,494 INFO L87 Difference]: Start difference. First operand 4625 states and 13321 transitions. Second operand 7 states. [2019-12-18 17:16:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:53,597 INFO L93 Difference]: Finished difference Result 3800 states and 11197 transitions. [2019-12-18 17:16:53,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:16:53,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 17:16:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:53,603 INFO L225 Difference]: With dead ends: 3800 [2019-12-18 17:16:53,603 INFO L226 Difference]: Without dead ends: 2791 [2019-12-18 17:16:53,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:16:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2019-12-18 17:16:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2401. [2019-12-18 17:16:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2019-12-18 17:16:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 6865 transitions. [2019-12-18 17:16:53,648 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 6865 transitions. Word has length 33 [2019-12-18 17:16:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:53,648 INFO L462 AbstractCegarLoop]: Abstraction has 2401 states and 6865 transitions. [2019-12-18 17:16:53,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:16:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 6865 transitions. [2019-12-18 17:16:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:16:53,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:53,653 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] [2019-12-18 17:16:53,653 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-18 17:16:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash 537782324, now seen corresponding path program 1 times [2019-12-18 17:16:53,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:53,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081878505] [2019-12-18 17:16:53,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:53,750 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-18 17:16:53,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081878505] [2019-12-18 17:16:53,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:53,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:16:53,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14300405] [2019-12-18 17:16:53,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:16:53,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:53,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:16:53,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:16:53,752 INFO L87 Difference]: Start difference. First operand 2401 states and 6865 transitions. Second operand 6 states. [2019-12-18 17:16:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:53,972 INFO L93 Difference]: Finished difference Result 6419 states and 18107 transitions. [2019-12-18 17:16:53,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:16:53,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 17:16:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:53,979 INFO L225 Difference]: With dead ends: 6419 [2019-12-18 17:16:53,980 INFO L226 Difference]: Without dead ends: 4118 [2019-12-18 17:16:53,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:16:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2019-12-18 17:16:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 2585. [2019-12-18 17:16:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2585 states. [2019-12-18 17:16:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 7335 transitions. [2019-12-18 17:16:54,016 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 7335 transitions. Word has length 47 [2019-12-18 17:16:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:54,016 INFO L462 AbstractCegarLoop]: Abstraction has 2585 states and 7335 transitions. [2019-12-18 17:16:54,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:16:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 7335 transitions. [2019-12-18 17:16:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:16:54,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:54,020 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] [2019-12-18 17:16:54,020 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:54,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1324143500, now seen corresponding path program 2 times [2019-12-18 17:16:54,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:54,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848163214] [2019-12-18 17:16:54,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:54,077 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-18 17:16:54,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848163214] [2019-12-18 17:16:54,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:54,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:16:54,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705495160] [2019-12-18 17:16:54,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:54,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:54,079 INFO L87 Difference]: Start difference. First operand 2585 states and 7335 transitions. Second operand 4 states. [2019-12-18 17:16:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:54,103 INFO L93 Difference]: Finished difference Result 3315 states and 8929 transitions. [2019-12-18 17:16:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:16:54,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 17:16:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:54,105 INFO L225 Difference]: With dead ends: 3315 [2019-12-18 17:16:54,105 INFO L226 Difference]: Without dead ends: 802 [2019-12-18 17:16:54,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:16:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-12-18 17:16:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2019-12-18 17:16:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-12-18 17:16:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1724 transitions. [2019-12-18 17:16:54,115 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1724 transitions. Word has length 47 [2019-12-18 17:16:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:54,115 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1724 transitions. [2019-12-18 17:16:54,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1724 transitions. [2019-12-18 17:16:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:16:54,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:54,117 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] [2019-12-18 17:16:54,117 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash 288167740, now seen corresponding path program 3 times [2019-12-18 17:16:54,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:54,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817728961] [2019-12-18 17:16:54,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:54,187 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-18 17:16:54,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817728961] [2019-12-18 17:16:54,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:54,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:16:54,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671320118] [2019-12-18 17:16:54,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:16:54,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:54,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:16:54,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:16:54,189 INFO L87 Difference]: Start difference. First operand 802 states and 1724 transitions. Second operand 7 states. [2019-12-18 17:16:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:54,343 INFO L93 Difference]: Finished difference Result 1252 states and 2651 transitions. [2019-12-18 17:16:54,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:16:54,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 17:16:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:54,345 INFO L225 Difference]: With dead ends: 1252 [2019-12-18 17:16:54,345 INFO L226 Difference]: Without dead ends: 820 [2019-12-18 17:16:54,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:16:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-18 17:16:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 778. [2019-12-18 17:16:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-12-18 17:16:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1674 transitions. [2019-12-18 17:16:54,362 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1674 transitions. Word has length 47 [2019-12-18 17:16:54,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:54,363 INFO L462 AbstractCegarLoop]: Abstraction has 778 states and 1674 transitions. [2019-12-18 17:16:54,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:16:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1674 transitions. [2019-12-18 17:16:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:16:54,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:54,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:54,366 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:54,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:54,366 INFO L82 PathProgramCache]: Analyzing trace with hash -261128468, now seen corresponding path program 4 times [2019-12-18 17:16:54,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:54,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353696010] [2019-12-18 17:16:54,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:54,451 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-18 17:16:54,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353696010] [2019-12-18 17:16:54,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:54,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:54,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553426257] [2019-12-18 17:16:54,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:16:54,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:54,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:16:54,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:16:54,457 INFO L87 Difference]: Start difference. First operand 778 states and 1674 transitions. Second operand 3 states. [2019-12-18 17:16:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:54,477 INFO L93 Difference]: Finished difference Result 778 states and 1672 transitions. [2019-12-18 17:16:54,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:16:54,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 17:16:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:54,479 INFO L225 Difference]: With dead ends: 778 [2019-12-18 17:16:54,479 INFO L226 Difference]: Without dead ends: 778 [2019-12-18 17:16:54,479 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-18 17:16:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-12-18 17:16:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 704. [2019-12-18 17:16:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-12-18 17:16:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1526 transitions. [2019-12-18 17:16:54,489 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1526 transitions. Word has length 47 [2019-12-18 17:16:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:54,490 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 1526 transitions. [2019-12-18 17:16:54,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:16:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1526 transitions. [2019-12-18 17:16:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:16:54,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:54,492 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] [2019-12-18 17:16:54,492 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:54,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:54,492 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 1 times [2019-12-18 17:16:54,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:54,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188657167] [2019-12-18 17:16:54,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:16:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:16:54,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:16:54,679 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:16:54,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (= |v_ULTIMATE.start_main_~#t973~0.offset_37| 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t973~0.base_59|) (= 0 v_~z$r_buff1_thd1~0_59) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t973~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t973~0.base_59|) |v_ULTIMATE.start_main_~#t973~0.offset_37| 0)) |v_#memory_int_27|) (= 0 v_~z$r_buff0_thd4~0_166) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t973~0.base_59|)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t973~0.base_59| 1)) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t973~0.base_59| 4) |v_#length_31|) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t974~0.base=|v_ULTIMATE.start_main_~#t974~0.base_56|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start_main_~#t974~0.offset=|v_ULTIMATE.start_main_~#t974~0.offset_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ULTIMATE.start_main_~#t976~0.offset=|v_ULTIMATE.start_main_~#t976~0.offset_22|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ULTIMATE.start_main_~#t975~0.offset=|v_ULTIMATE.start_main_~#t975~0.offset_23|, ULTIMATE.start_main_~#t973~0.base=|v_ULTIMATE.start_main_~#t973~0.base_59|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ULTIMATE.start_main_~#t976~0.base=|v_ULTIMATE.start_main_~#t976~0.base_32|, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ULTIMATE.start_main_~#t973~0.offset=|v_ULTIMATE.start_main_~#t973~0.offset_37|, ULTIMATE.start_main_~#t975~0.base=|v_ULTIMATE.start_main_~#t975~0.base_32|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t974~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t974~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t976~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t975~0.offset, ULTIMATE.start_main_~#t973~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t976~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t973~0.offset, ULTIMATE.start_main_~#t975~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:16:54,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t974~0.base_11|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t974~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t974~0.base_11| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t974~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t974~0.offset_10|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t974~0.base_11| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t974~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t974~0.base_11|) |v_ULTIMATE.start_main_~#t974~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t974~0.offset=|v_ULTIMATE.start_main_~#t974~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t974~0.base=|v_ULTIMATE.start_main_~#t974~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t974~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t974~0.base] because there is no mapped edge [2019-12-18 17:16:54,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t975~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t975~0.base_12|)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t975~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t975~0.offset_11|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t975~0.base_12| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t975~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t975~0.base_12|) |v_ULTIMATE.start_main_~#t975~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t975~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t975~0.base=|v_ULTIMATE.start_main_~#t975~0.base_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t975~0.offset=|v_ULTIMATE.start_main_~#t975~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t975~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t975~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 17:16:54,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t976~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t976~0.base_12|) |v_ULTIMATE.start_main_~#t976~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t976~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t976~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t976~0.base_12|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t976~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t976~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t976~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t976~0.offset=|v_ULTIMATE.start_main_~#t976~0.offset_10|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t976~0.base=|v_ULTIMATE.start_main_~#t976~0.base_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t976~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t976~0.base, #length] because there is no mapped edge [2019-12-18 17:16:54,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff1_thd0~0_Out786524537 ~z$r_buff0_thd0~0_In786524537) (= 1 ~z$r_buff0_thd4~0_Out786524537) (= ~z$r_buff0_thd3~0_In786524537 ~z$r_buff1_thd3~0_Out786524537) (= ~z$r_buff1_thd4~0_Out786524537 ~z$r_buff0_thd4~0_In786524537) (= 1 ~a~0_Out786524537) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In786524537)) (= ~__unbuffered_p3_EBX~0_Out786524537 ~b~0_In786524537) (= ~z$r_buff0_thd1~0_In786524537 ~z$r_buff1_thd1~0_Out786524537) (= ~z$r_buff0_thd2~0_In786524537 ~z$r_buff1_thd2~0_Out786524537) (= ~__unbuffered_p3_EAX~0_Out786524537 ~a~0_Out786524537)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In786524537, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In786524537, ~b~0=~b~0_In786524537, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In786524537, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In786524537, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In786524537, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In786524537} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In786524537, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out786524537, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out786524537, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out786524537, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out786524537, ~a~0=~a~0_Out786524537, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In786524537, ~b~0=~b~0_In786524537, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out786524537, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out786524537, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out786524537, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out786524537, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In786524537, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In786524537, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In786524537} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 17:16:54,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_36 1) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~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-18 17:16:54,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 17:16:54,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2123339520 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2123339520 256)))) (or (= (mod ~z$w_buff0_used~0_In2123339520 256) 0) (and (= (mod ~z$w_buff1_used~0_In2123339520 256) 0) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In2123339520 256) 0)))) (= ~z$w_buff0~0_In2123339520 |P2Thread1of1ForFork1_#t~ite8_Out2123339520|) (= |P2Thread1of1ForFork1_#t~ite9_Out2123339520| |P2Thread1of1ForFork1_#t~ite8_Out2123339520|)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite8_In2123339520| |P2Thread1of1ForFork1_#t~ite8_Out2123339520|) (= ~z$w_buff0~0_In2123339520 |P2Thread1of1ForFork1_#t~ite9_Out2123339520|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In2123339520, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2123339520, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2123339520, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2123339520, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2123339520, ~weak$$choice2~0=~weak$$choice2~0_In2123339520, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In2123339520|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In2123339520, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2123339520, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2123339520, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2123339520, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2123339520, ~weak$$choice2~0=~weak$$choice2~0_In2123339520, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out2123339520|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out2123339520|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:16:54,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2115563941 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite12_Out2115563941| |P2Thread1of1ForFork1_#t~ite11_Out2115563941|) (= ~z$w_buff1~0_In2115563941 |P2Thread1of1ForFork1_#t~ite11_Out2115563941|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2115563941 256)))) (or (= (mod ~z$w_buff0_used~0_In2115563941 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In2115563941 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2115563941 256)))))) (and (= |P2Thread1of1ForFork1_#t~ite11_In2115563941| |P2Thread1of1ForFork1_#t~ite11_Out2115563941|) (= |P2Thread1of1ForFork1_#t~ite12_Out2115563941| ~z$w_buff1~0_In2115563941) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2115563941, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2115563941, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In2115563941|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2115563941, ~z$w_buff1~0=~z$w_buff1~0_In2115563941, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2115563941, ~weak$$choice2~0=~weak$$choice2~0_In2115563941} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2115563941, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out2115563941|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2115563941, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out2115563941|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2115563941, ~z$w_buff1~0=~z$w_buff1~0_In2115563941, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2115563941, ~weak$$choice2~0=~weak$$choice2~0_In2115563941} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:16:54,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-869451898 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite15_Out-869451898| ~z$w_buff0_used~0_In-869451898) (= |P2Thread1of1ForFork1_#t~ite14_In-869451898| |P2Thread1of1ForFork1_#t~ite14_Out-869451898|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out-869451898| ~z$w_buff0_used~0_In-869451898) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-869451898 256)))) (or (= (mod ~z$w_buff0_used~0_In-869451898 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-869451898 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-869451898 256) 0) .cse1))) (= |P2Thread1of1ForFork1_#t~ite15_Out-869451898| |P2Thread1of1ForFork1_#t~ite14_Out-869451898|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-869451898|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-869451898, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-869451898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-869451898, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-869451898, ~weak$$choice2~0=~weak$$choice2~0_In-869451898} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-869451898|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-869451898|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-869451898, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-869451898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-869451898, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-869451898, ~weak$$choice2~0=~weak$$choice2~0_In-869451898} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-18 17:16:54,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 17:16:54,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2133992210 256) 0))) (or (and .cse0 (= ~z$r_buff1_thd3~0_In2133992210 |P2Thread1of1ForFork1_#t~ite23_Out2133992210|) (= |P2Thread1of1ForFork1_#t~ite24_Out2133992210| |P2Thread1of1ForFork1_#t~ite23_Out2133992210|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2133992210 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In2133992210 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In2133992210 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In2133992210 256))))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In2133992210| |P2Thread1of1ForFork1_#t~ite23_Out2133992210|) (= |P2Thread1of1ForFork1_#t~ite24_Out2133992210| ~z$r_buff1_thd3~0_In2133992210)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2133992210, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2133992210, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In2133992210|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2133992210, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2133992210, ~weak$$choice2~0=~weak$$choice2~0_In2133992210} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out2133992210|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2133992210, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2133992210, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out2133992210|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2133992210, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2133992210, ~weak$$choice2~0=~weak$$choice2~0_In2133992210} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-18 17:16:54,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:16:54,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1188274019 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1188274019 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out1188274019| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1188274019 |P3Thread1of1ForFork2_#t~ite28_Out1188274019|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1188274019, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1188274019} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1188274019|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1188274019, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1188274019} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 17:16:54,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1901555377 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1901555377 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1901555377 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1901555377 256)))) (or (and (= ~z$w_buff1_used~0_In1901555377 |P3Thread1of1ForFork2_#t~ite29_Out1901555377|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork2_#t~ite29_Out1901555377|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1901555377, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1901555377, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1901555377, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1901555377} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1901555377|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1901555377, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1901555377, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1901555377, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1901555377} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 17:16:54,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In198604686 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In198604686 256) 0))) (or (and (= 0 ~z$r_buff0_thd4~0_Out198604686) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_In198604686 ~z$r_buff0_thd4~0_Out198604686) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In198604686, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In198604686} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In198604686, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out198604686, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out198604686|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-18 17:16:54,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In228059437 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In228059437 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In228059437 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In228059437 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out228059437| ~z$r_buff1_thd4~0_In228059437) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P3Thread1of1ForFork2_#t~ite31_Out228059437| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In228059437, ~z$w_buff0_used~0=~z$w_buff0_used~0_In228059437, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In228059437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In228059437} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In228059437, ~z$w_buff0_used~0=~z$w_buff0_used~0_In228059437, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In228059437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In228059437, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out228059437|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:16:54,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:16:54,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:16:54,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1995400553 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1995400553 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite37_Out-1995400553| |ULTIMATE.start_main_#t~ite36_Out-1995400553|))) (or (and .cse0 (= ~z~0_In-1995400553 |ULTIMATE.start_main_#t~ite36_Out-1995400553|) (or .cse1 .cse2)) (and (not .cse1) (not .cse2) (= ~z$w_buff1~0_In-1995400553 |ULTIMATE.start_main_#t~ite36_Out-1995400553|) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1995400553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1995400553, ~z$w_buff1~0=~z$w_buff1~0_In-1995400553, ~z~0=~z~0_In-1995400553} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1995400553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1995400553, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1995400553|, ~z$w_buff1~0=~z$w_buff1~0_In-1995400553, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1995400553|, ~z~0=~z~0_In-1995400553} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:16:54,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-391352317 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-391352317 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-391352317|)) (and (= ~z$w_buff0_used~0_In-391352317 |ULTIMATE.start_main_#t~ite38_Out-391352317|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-391352317, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-391352317} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-391352317, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-391352317, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-391352317|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:16:54,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1052429774 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1052429774 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1052429774 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1052429774 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out1052429774|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1052429774 |ULTIMATE.start_main_#t~ite39_Out1052429774|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1052429774, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1052429774, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1052429774, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1052429774} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1052429774, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1052429774|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1052429774, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1052429774, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1052429774} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:16:54,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In960090134 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In960090134 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out960090134| ~z$r_buff0_thd0~0_In960090134) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out960090134| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In960090134, ~z$w_buff0_used~0=~z$w_buff0_used~0_In960090134} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In960090134, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out960090134|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In960090134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:16:54,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1317549333 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1317549333 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1317549333 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1317549333 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1317549333| ~z$r_buff1_thd0~0_In1317549333) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out1317549333| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1317549333, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1317549333, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1317549333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1317549333} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1317549333|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1317549333, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1317549333, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1317549333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1317549333} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 17:16:54,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:16:54,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:16:54 BasicIcfg [2019-12-18 17:16:54,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:16:54,844 INFO L168 Benchmark]: Toolchain (without parser) took 28826.52 ms. Allocated memory was 146.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 103.2 MB in the beginning and 879.5 MB in the end (delta: -776.3 MB). Peak memory consumption was 629.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:16:54,845 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:16:54,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.08 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.8 MB in the beginning and 155.8 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:16:54,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.56 ms. Allocated memory is still 204.5 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:16:54,847 INFO L168 Benchmark]: Boogie Preprocessor took 42.19 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:16:54,848 INFO L168 Benchmark]: RCFGBuilder took 836.27 ms. Allocated memory is still 204.5 MB. Free memory was 151.1 MB in the beginning and 104.5 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:16:54,848 INFO L168 Benchmark]: TraceAbstraction took 27111.41 ms. Allocated memory was 204.5 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 103.9 MB in the beginning and 879.5 MB in the end (delta: -775.6 MB). Peak memory consumption was 571.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:16:54,852 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.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.08 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.8 MB in the beginning and 155.8 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.56 ms. Allocated memory is still 204.5 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.19 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.27 ms. Allocated memory is still 204.5 MB. Free memory was 151.1 MB in the beginning and 104.5 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27111.41 ms. Allocated memory was 204.5 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 103.9 MB in the beginning and 879.5 MB in the end (delta: -775.6 MB). Peak memory consumption was 571.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 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) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 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 [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 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 [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2127 SDtfs, 2662 SDslu, 3617 SDs, 0 SdLazy, 1447 SolverSat, 181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 19348 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 44582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...