/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/safe022_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:50:39,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:50:39,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:50:39,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:50:39,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:50:39,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:50:39,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:50:39,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:50:39,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:50:39,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:50:39,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:50:39,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:50:39,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:50:39,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:50:39,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:50:39,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:50:39,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:50:39,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:50:39,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:50:39,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:50:39,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:50:39,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:50:39,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:50:39,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:50:39,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:50:39,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:50:39,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:50:39,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:50:39,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:50:39,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:50:39,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:50:39,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:50:39,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:50:39,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:50:39,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:50:39,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:50:39,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:50:39,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:50:39,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:50:39,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:50:39,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:50:39,861 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 18:50:39,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:50:39,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:50:39,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:50:39,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:50:39,899 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:50:39,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:50:39,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:50:39,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:50:39,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:50:39,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:50:39,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:50:39,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:50:39,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:50:39,901 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:50:39,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:50:39,901 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:50:39,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:50:39,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:50:39,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:50:39,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:50:39,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:50:39,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:50:39,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:50:39,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:50:39,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:50:39,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:50:39,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:50:39,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:50:39,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:50:40,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:50:40,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:50:40,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:50:40,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:50:40,189 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:50:40,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.oepc.i [2019-12-18 18:50:40,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccddb04b4/1bdf7d8ef4e3467ea7df51062c6e9f04/FLAG472f70f3d [2019-12-18 18:50:40,813 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:50:40,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_rmo.oepc.i [2019-12-18 18:50:40,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccddb04b4/1bdf7d8ef4e3467ea7df51062c6e9f04/FLAG472f70f3d [2019-12-18 18:50:41,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccddb04b4/1bdf7d8ef4e3467ea7df51062c6e9f04 [2019-12-18 18:50:41,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:50:41,118 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:50:41,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:50:41,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:50:41,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:50:41,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:41,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a3afa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41, skipping insertion in model container [2019-12-18 18:50:41,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:41,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:50:41,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:50:41,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:50:41,807 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:50:41,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:50:41,961 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:50:41,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41 WrapperNode [2019-12-18 18:50:41,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:50:41,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:50:41,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:50:41,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:50:41,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:41,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:42,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:50:42,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:50:42,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:50:42,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:50:42,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:42,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:42,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:42,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:42,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:42,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:42,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (1/1) ... [2019-12-18 18:50:42,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:50:42,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:50:42,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:50:42,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:50:42,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (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 18:50:42,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:50:42,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:50:42,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:50:42,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:50:42,134 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:50:42,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:50:42,134 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:50:42,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:50:42,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:50:42,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:50:42,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:50:42,138 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 18:50:42,831 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:50:42,832 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:50:42,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:50:42 BoogieIcfgContainer [2019-12-18 18:50:42,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:50:42,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:50:42,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:50:42,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:50:42,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:50:41" (1/3) ... [2019-12-18 18:50:42,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bed97ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:50:42, skipping insertion in model container [2019-12-18 18:50:42,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:50:41" (2/3) ... [2019-12-18 18:50:42,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bed97ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:50:42, skipping insertion in model container [2019-12-18 18:50:42,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:50:42" (3/3) ... [2019-12-18 18:50:42,842 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.oepc.i [2019-12-18 18:50:42,853 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:50:42,854 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:50:42,874 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:50:42,875 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:50:42,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,946 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:42,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,024 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:50:43,041 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:50:43,062 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:50:43,063 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:50:43,063 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:50:43,063 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:50:43,063 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:50:43,063 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:50:43,063 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:50:43,064 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:50:43,083 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 18:50:43,085 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:50:43,174 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:50:43,175 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:50:43,194 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:50:43,216 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:50:43,271 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:50:43,271 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:50:43,281 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:50:43,297 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 18:50:43,298 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:50:48,053 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 18:50:48,186 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 18:50:48,289 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-18 18:50:48,289 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-18 18:50:48,293 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-18 18:50:48,727 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-18 18:50:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-18 18:50:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:50:48,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:48,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:50:48,737 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:48,744 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-18 18:50:48,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:48,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211093472] [2019-12-18 18:50:48,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:48,950 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 18:50:48,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211093472] [2019-12-18 18:50:48,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:48,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:50:48,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244081940] [2019-12-18 18:50:48,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:50:48,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:48,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:50:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:50:48,977 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-18 18:50:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:49,264 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-18 18:50:49,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:50:49,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:50:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:49,363 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 18:50:49,363 INFO L226 Difference]: Without dead ends: 7606 [2019-12-18 18:50:49,365 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 18:50:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-18 18:50:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-18 18:50:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-18 18:50:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-18 18:50:49,865 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-18 18:50:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:49,866 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-18 18:50:49,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:50:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-18 18:50:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:50:49,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:49,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:49,872 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-18 18:50:49,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:49,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613566009] [2019-12-18 18:50:49,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:50,072 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 18:50:50,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613566009] [2019-12-18 18:50:50,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:50,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:50:50,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592496653] [2019-12-18 18:50:50,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:50:50,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:50,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:50:50,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:50:50,077 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-18 18:50:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:50,143 INFO L93 Difference]: Finished difference Result 1760 states and 4447 transitions. [2019-12-18 18:50:50,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:50:50,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:50:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:50,151 INFO L225 Difference]: With dead ends: 1760 [2019-12-18 18:50:50,152 INFO L226 Difference]: Without dead ends: 1292 [2019-12-18 18:50:50,153 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 18:50:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-18 18:50:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2019-12-18 18:50:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-12-18 18:50:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2938 transitions. [2019-12-18 18:50:50,189 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2938 transitions. Word has length 11 [2019-12-18 18:50:50,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:50,190 INFO L462 AbstractCegarLoop]: Abstraction has 1292 states and 2938 transitions. [2019-12-18 18:50:50,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:50:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2938 transitions. [2019-12-18 18:50:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:50:50,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:50,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:50,197 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:50,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-18 18:50:50,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:50,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279110571] [2019-12-18 18:50:50,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:50,330 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 18:50:50,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279110571] [2019-12-18 18:50:50,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:50,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:50:50,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124357426] [2019-12-18 18:50:50,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:50:50,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:50,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:50:50,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:50:50,332 INFO L87 Difference]: Start difference. First operand 1292 states and 2938 transitions. Second operand 5 states. [2019-12-18 18:50:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:50,692 INFO L93 Difference]: Finished difference Result 1855 states and 4087 transitions. [2019-12-18 18:50:50,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:50:50,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 18:50:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:50,704 INFO L225 Difference]: With dead ends: 1855 [2019-12-18 18:50:50,704 INFO L226 Difference]: Without dead ends: 1854 [2019-12-18 18:50:50,704 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 18:50:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-12-18 18:50:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1547. [2019-12-18 18:50:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-18 18:50:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-18 18:50:50,750 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 14 [2019-12-18 18:50:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:50,751 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-18 18:50:50,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:50:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-18 18:50:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 18:50:50,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:50,754 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] [2019-12-18 18:50:50,754 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:50,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:50,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-18 18:50:50,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:50,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447768465] [2019-12-18 18:50:50,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:50,951 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 18:50:50,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447768465] [2019-12-18 18:50:50,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:50,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:50:50,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664990930] [2019-12-18 18:50:50,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:50:50,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:50,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:50:50,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:50:50,954 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-18 18:50:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:51,461 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-18 18:50:51,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:50:51,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 18:50:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:51,476 INFO L225 Difference]: With dead ends: 2337 [2019-12-18 18:50:51,476 INFO L226 Difference]: Without dead ends: 2285 [2019-12-18 18:50:51,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:50:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-18 18:50:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-18 18:50:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-18 18:50:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-18 18:50:51,537 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-18 18:50:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:51,537 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-18 18:50:51,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:50:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-18 18:50:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 18:50:51,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:51,540 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] [2019-12-18 18:50:51,540 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:51,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-18 18:50:51,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:51,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049393612] [2019-12-18 18:50:51,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:51,624 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 18:50:51,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049393612] [2019-12-18 18:50:51,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:51,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:50:51,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464213847] [2019-12-18 18:50:51,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:50:51,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:51,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:50:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:50:51,627 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 3 states. [2019-12-18 18:50:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:51,642 INFO L93 Difference]: Finished difference Result 1624 states and 3602 transitions. [2019-12-18 18:50:51,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:50:51,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 18:50:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:51,652 INFO L225 Difference]: With dead ends: 1624 [2019-12-18 18:50:51,652 INFO L226 Difference]: Without dead ends: 1624 [2019-12-18 18:50:51,652 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 18:50:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-18 18:50:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2019-12-18 18:50:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2019-12-18 18:50:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 3602 transitions. [2019-12-18 18:50:51,695 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 3602 transitions. Word has length 26 [2019-12-18 18:50:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:51,696 INFO L462 AbstractCegarLoop]: Abstraction has 1624 states and 3602 transitions. [2019-12-18 18:50:51,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:50:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 3602 transitions. [2019-12-18 18:50:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:50:51,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:51,701 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] [2019-12-18 18:50:51,701 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:51,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:51,702 INFO L82 PathProgramCache]: Analyzing trace with hash -929253500, now seen corresponding path program 1 times [2019-12-18 18:50:51,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:51,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699387183] [2019-12-18 18:50:51,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:51,837 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 18:50:51,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699387183] [2019-12-18 18:50:51,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:51,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:50:51,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269763420] [2019-12-18 18:50:51,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:50:51,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:51,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:50:51,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:50:51,840 INFO L87 Difference]: Start difference. First operand 1624 states and 3602 transitions. Second operand 4 states. [2019-12-18 18:50:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:51,886 INFO L93 Difference]: Finished difference Result 2605 states and 5852 transitions. [2019-12-18 18:50:51,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:50:51,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 18:50:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:51,895 INFO L225 Difference]: With dead ends: 2605 [2019-12-18 18:50:51,895 INFO L226 Difference]: Without dead ends: 1149 [2019-12-18 18:50:51,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 18:50:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2019-12-18 18:50:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2019-12-18 18:50:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-12-18 18:50:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 2552 transitions. [2019-12-18 18:50:51,944 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 2552 transitions. Word has length 27 [2019-12-18 18:50:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:51,945 INFO L462 AbstractCegarLoop]: Abstraction has 1149 states and 2552 transitions. [2019-12-18 18:50:51,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:50:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2552 transitions. [2019-12-18 18:50:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:50:51,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:51,947 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] [2019-12-18 18:50:51,947 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:51,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:51,948 INFO L82 PathProgramCache]: Analyzing trace with hash -451164714, now seen corresponding path program 2 times [2019-12-18 18:50:51,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:51,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975376440] [2019-12-18 18:50:51,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:52,068 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 18:50:52,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975376440] [2019-12-18 18:50:52,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:52,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:50:52,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208077951] [2019-12-18 18:50:52,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:50:52,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:52,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:50:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:50:52,070 INFO L87 Difference]: Start difference. First operand 1149 states and 2552 transitions. Second operand 5 states. [2019-12-18 18:50:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:52,552 INFO L93 Difference]: Finished difference Result 1862 states and 4038 transitions. [2019-12-18 18:50:52,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:50:52,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 18:50:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:52,564 INFO L225 Difference]: With dead ends: 1862 [2019-12-18 18:50:52,564 INFO L226 Difference]: Without dead ends: 1862 [2019-12-18 18:50:52,565 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 18:50:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-12-18 18:50:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1665. [2019-12-18 18:50:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-12-18 18:50:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 3660 transitions. [2019-12-18 18:50:52,608 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 3660 transitions. Word has length 27 [2019-12-18 18:50:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:52,609 INFO L462 AbstractCegarLoop]: Abstraction has 1665 states and 3660 transitions. [2019-12-18 18:50:52,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:50:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3660 transitions. [2019-12-18 18:50:52,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 18:50:52,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:52,612 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] [2019-12-18 18:50:52,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:52,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:52,613 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-18 18:50:52,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:52,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902851601] [2019-12-18 18:50:52,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:52,745 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 18:50:52,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902851601] [2019-12-18 18:50:52,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:52,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:50:52,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673673392] [2019-12-18 18:50:52,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:50:52,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:52,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:50:52,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:50:52,747 INFO L87 Difference]: Start difference. First operand 1665 states and 3660 transitions. Second operand 5 states. [2019-12-18 18:50:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:52,804 INFO L93 Difference]: Finished difference Result 974 states and 2029 transitions. [2019-12-18 18:50:52,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:50:52,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 18:50:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:52,815 INFO L225 Difference]: With dead ends: 974 [2019-12-18 18:50:52,816 INFO L226 Difference]: Without dead ends: 842 [2019-12-18 18:50:52,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:50:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-12-18 18:50:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 800. [2019-12-18 18:50:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-18 18:50:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-18 18:50:52,839 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 28 [2019-12-18 18:50:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:52,840 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-18 18:50:52,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:50:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-18 18:50:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 18:50:52,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:52,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:52,843 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 1 times [2019-12-18 18:50:52,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:52,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067671328] [2019-12-18 18:50:52,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:52,930 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 18:50:52,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067671328] [2019-12-18 18:50:52,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:52,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:50:52,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713835509] [2019-12-18 18:50:52,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:50:52,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:50:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:50:52,932 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 7 states. [2019-12-18 18:50:53,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:53,137 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-18 18:50:53,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:50:53,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 18:50:53,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:53,142 INFO L225 Difference]: With dead ends: 1394 [2019-12-18 18:50:53,142 INFO L226 Difference]: Without dead ends: 931 [2019-12-18 18:50:53,143 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 18:50:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-18 18:50:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-18 18:50:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-18 18:50:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-18 18:50:53,162 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-18 18:50:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:53,162 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-18 18:50:53,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:50:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-18 18:50:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 18:50:53,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:53,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:53,165 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:53,166 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 2 times [2019-12-18 18:50:53,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:53,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133738371] [2019-12-18 18:50:53,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:53,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133738371] [2019-12-18 18:50:53,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:53,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:50:53,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142995628] [2019-12-18 18:50:53,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:50:53,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:53,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:50:53,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:50:53,260 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-18 18:50:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:53,314 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-18 18:50:53,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:50:53,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-18 18:50:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:53,323 INFO L225 Difference]: With dead ends: 1051 [2019-12-18 18:50:53,323 INFO L226 Difference]: Without dead ends: 1051 [2019-12-18 18:50:53,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 18:50:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-18 18:50:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-18 18:50:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-18 18:50:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-18 18:50:53,343 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-18 18:50:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:53,343 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-18 18:50:53,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:50:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-18 18:50:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 18:50:53,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:53,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:53,346 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:53,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-18 18:50:53,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:53,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095088160] [2019-12-18 18:50:53,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:53,452 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 18:50:53,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095088160] [2019-12-18 18:50:53,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:53,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:50:53,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956257753] [2019-12-18 18:50:53,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:50:53,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:53,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:50:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:50:53,455 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 3 states. [2019-12-18 18:50:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:53,467 INFO L93 Difference]: Finished difference Result 848 states and 1813 transitions. [2019-12-18 18:50:53,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:50:53,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 18:50:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:53,471 INFO L225 Difference]: With dead ends: 848 [2019-12-18 18:50:53,471 INFO L226 Difference]: Without dead ends: 848 [2019-12-18 18:50:53,472 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 18:50:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-12-18 18:50:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 754. [2019-12-18 18:50:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-18 18:50:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-18 18:50:53,488 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-18 18:50:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:53,489 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-18 18:50:53,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:50:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-18 18:50:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:50:53,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:53,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:53,492 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:53,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:53,492 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-18 18:50:53,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:53,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145205909] [2019-12-18 18:50:53,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:50:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:50:53,677 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:50:53,678 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:50:53,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_48|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2313~0.base_48|) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2313~0.base_48| 4)) (= v_~y$r_buff1_thd0~0_129 0) (= |v_ULTIMATE.start_main_~#t2313~0.offset_31| 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_48| 1)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_48|) |v_ULTIMATE.start_main_~#t2313~0.offset_31| 0))) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_49|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2313~0.offset=|v_ULTIMATE.start_main_~#t2313~0.offset_31|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ULTIMATE.start_main_~#t2313~0.base=|v_ULTIMATE.start_main_~#t2313~0.base_48|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2313~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t2313~0.base, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2314~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:50:53,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t2314~0.offset_11| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2314~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2314~0.base_13| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13|) |v_ULTIMATE.start_main_~#t2314~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2314~0.offset] because there is no mapped edge [2019-12-18 18:50:53,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd1~0_Out1432002162 ~y$r_buff0_thd1~0_In1432002162) (= 1 ~x~0_Out1432002162) (= ~y$r_buff1_thd2~0_Out1432002162 ~y$r_buff0_thd2~0_In1432002162) (= 1 ~y$r_buff0_thd1~0_Out1432002162) (= ~y$r_buff0_thd0~0_In1432002162 ~y$r_buff1_thd0~0_Out1432002162) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1432002162))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1432002162, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1432002162, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1432002162, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1432002162} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1432002162, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1432002162, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1432002162, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1432002162, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1432002162, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1432002162, ~x~0=~x~0_Out1432002162, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1432002162} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 18:50:53,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-730031358 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-730031358 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-730031358|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-730031358 |P0Thread1of1ForFork0_#t~ite5_Out-730031358|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-730031358, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-730031358} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-730031358|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-730031358, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-730031358} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:50:53,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1764370637 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-1764370637| |P1Thread1of1ForFork1_#t~ite20_Out-1764370637|) (not .cse0) (= ~y$w_buff0_used~0_In-1764370637 |P1Thread1of1ForFork1_#t~ite21_Out-1764370637|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1764370637 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1764370637 256))) (= (mod ~y$w_buff0_used~0_In-1764370637 256) 0) (and (= (mod ~y$w_buff1_used~0_In-1764370637 256) 0) .cse1))) (= ~y$w_buff0_used~0_In-1764370637 |P1Thread1of1ForFork1_#t~ite20_Out-1764370637|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1764370637| |P1Thread1of1ForFork1_#t~ite20_Out-1764370637|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1764370637, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1764370637, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1764370637|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1764370637, ~weak$$choice2~0=~weak$$choice2~0_In-1764370637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1764370637} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1764370637, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1764370637, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1764370637|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1764370637, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1764370637|, ~weak$$choice2~0=~weak$$choice2~0_In-1764370637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1764370637} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 18:50:53,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse5 (= 0 (mod ~y$r_buff1_thd2~0_In329974999 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out329974999| |P1Thread1of1ForFork1_#t~ite23_Out329974999|)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In329974999 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In329974999 256))) (.cse4 (= (mod ~y$w_buff1_used~0_In329974999 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In329974999 256) 0))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out329974999| |P1Thread1of1ForFork1_#t~ite23_In329974999|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out329974999| ~y$w_buff1_used~0_In329974999)) (and .cse1 .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out329974999| ~y$w_buff1_used~0_In329974999) (or .cse2 (and .cse3 .cse4) (and .cse3 .cse5)))) (= |P1Thread1of1ForFork1_#t~ite22_In329974999| |P1Thread1of1ForFork1_#t~ite22_Out329974999|)) (let ((.cse6 (not .cse3))) (and (or (not .cse5) .cse6) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite23_Out329974999| |P1Thread1of1ForFork1_#t~ite22_Out329974999|) .cse0 (= |P1Thread1of1ForFork1_#t~ite22_Out329974999| 0) (or (not .cse4) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In329974999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In329974999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In329974999, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In329974999|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In329974999|, ~weak$$choice2~0=~weak$$choice2~0_In329974999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In329974999} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In329974999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In329974999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In329974999, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out329974999|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out329974999|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out329974999|, ~weak$$choice2~0=~weak$$choice2~0_In329974999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In329974999} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 18:50:53,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In552622799 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In552622799 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In552622799 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In552622799 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out552622799| ~y$w_buff1_used~0_In552622799)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out552622799| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In552622799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In552622799, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In552622799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In552622799} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out552622799|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In552622799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In552622799, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In552622799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In552622799} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:50:53,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1228238249 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1228238249 256)))) (or (and (= ~y$r_buff0_thd1~0_Out1228238249 ~y$r_buff0_thd1~0_In1228238249) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd1~0_Out1228238249 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1228238249, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1228238249} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1228238249, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1228238249|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1228238249} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:50:53,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In749542105 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In749542105 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In749542105 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In749542105 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out749542105| ~y$r_buff1_thd1~0_In749542105) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out749542105| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In749542105, ~y$w_buff0_used~0=~y$w_buff0_used~0_In749542105, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In749542105, ~y$w_buff1_used~0=~y$w_buff1_used~0_In749542105} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In749542105, ~y$w_buff0_used~0=~y$w_buff0_used~0_In749542105, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out749542105|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In749542105, ~y$w_buff1_used~0=~y$w_buff1_used~0_In749542105} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:50:53,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:50:53,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2124782588 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In2124782588| |P1Thread1of1ForFork1_#t~ite29_Out2124782588|) (= ~y$r_buff1_thd2~0_In2124782588 |P1Thread1of1ForFork1_#t~ite30_Out2124782588|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out2124782588| |P1Thread1of1ForFork1_#t~ite29_Out2124782588|) (= ~y$r_buff1_thd2~0_In2124782588 |P1Thread1of1ForFork1_#t~ite29_Out2124782588|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2124782588 256) 0))) (or (= (mod ~y$w_buff0_used~0_In2124782588 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In2124782588 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In2124782588 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2124782588, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2124782588|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2124782588, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2124782588, ~weak$$choice2~0=~weak$$choice2~0_In2124782588, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2124782588} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2124782588, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2124782588|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2124782588|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2124782588, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2124782588, ~weak$$choice2~0=~weak$$choice2~0_In2124782588, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2124782588} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 18:50:53,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 18:50:53,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1322167952 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1322167952 256)))) (or (and (= ~y$w_buff1~0_In1322167952 |P1Thread1of1ForFork1_#t~ite32_Out1322167952|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In1322167952 |P1Thread1of1ForFork1_#t~ite32_Out1322167952|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1322167952, ~y$w_buff1~0=~y$w_buff1~0_In1322167952, ~y~0=~y~0_In1322167952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1322167952} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1322167952, ~y$w_buff1~0=~y$w_buff1~0_In1322167952, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1322167952|, ~y~0=~y~0_In1322167952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1322167952} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:50:53,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 18:50:53,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1235389833 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1235389833 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1235389833|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1235389833 |P1Thread1of1ForFork1_#t~ite34_Out-1235389833|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1235389833, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1235389833} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1235389833, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1235389833, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1235389833|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:50:53,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1725867501 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1725867501 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1725867501 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1725867501 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1725867501 |P1Thread1of1ForFork1_#t~ite35_Out1725867501|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1725867501|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1725867501, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1725867501, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1725867501, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1725867501} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1725867501, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1725867501, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1725867501, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1725867501|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1725867501} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:50:53,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1180651759 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1180651759 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1180651759| ~y$r_buff0_thd2~0_In-1180651759) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1180651759|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1180651759, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1180651759} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1180651759, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1180651759, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1180651759|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:50:53,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In391655757 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In391655757 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In391655757 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In391655757 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out391655757| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In391655757 |P1Thread1of1ForFork1_#t~ite37_Out391655757|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In391655757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In391655757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In391655757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In391655757} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In391655757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In391655757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In391655757, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out391655757|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In391655757} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:50:53,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:50:53,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:50:53,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:50:53,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-190106810 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-190106810 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-190106810| ~y$w_buff1~0_In-190106810)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-190106810| ~y~0_In-190106810)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-190106810, ~y~0=~y~0_In-190106810, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-190106810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-190106810} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-190106810|, ~y$w_buff1~0=~y$w_buff1~0_In-190106810, ~y~0=~y~0_In-190106810, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-190106810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-190106810} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 18:50:53,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 18:50:53,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2005012975 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2005012975 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out2005012975|)) (and (= ~y$w_buff0_used~0_In2005012975 |ULTIMATE.start_main_#t~ite42_Out2005012975|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2005012975, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2005012975} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2005012975, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2005012975, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2005012975|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 18:50:53,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In1205231710 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1205231710 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1205231710 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1205231710 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out1205231710| ~y$w_buff1_used~0_In1205231710)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite43_Out1205231710| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1205231710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1205231710, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1205231710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1205231710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1205231710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1205231710, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1205231710|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1205231710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1205231710} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:50:53,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1557598990 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1557598990 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1557598990| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1557598990| ~y$r_buff0_thd0~0_In-1557598990)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1557598990, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1557598990} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1557598990, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1557598990, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1557598990|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:50:53,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1414005580 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1414005580 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1414005580 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1414005580 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1414005580| ~y$r_buff1_thd0~0_In1414005580) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out1414005580| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1414005580, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1414005580, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1414005580, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1414005580} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1414005580, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1414005580, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1414005580, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1414005580|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1414005580} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:50:53,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:50:53,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:50:53 BasicIcfg [2019-12-18 18:50:53,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:50:53,809 INFO L168 Benchmark]: Toolchain (without parser) took 12691.63 ms. Allocated memory was 146.3 MB in the beginning and 361.2 MB in the end (delta: 215.0 MB). Free memory was 101.5 MB in the beginning and 107.6 MB in the end (delta: -6.0 MB). Peak memory consumption was 208.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:53,810 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 18:50:53,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.25 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 157.8 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:53,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.49 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:53,813 INFO L168 Benchmark]: Boogie Preprocessor took 38.71 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:53,814 INFO L168 Benchmark]: RCFGBuilder took 768.83 ms. Allocated memory is still 203.9 MB. Free memory was 152.7 MB in the beginning and 108.4 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:53,815 INFO L168 Benchmark]: TraceAbstraction took 10973.01 ms. Allocated memory was 203.9 MB in the beginning and 361.2 MB in the end (delta: 157.3 MB). Free memory was 108.4 MB in the beginning and 107.6 MB in the end (delta: 886.2 kB). Peak memory consumption was 158.2 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:53,826 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.43 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 843.25 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 157.8 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.49 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.71 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 768.83 ms. Allocated memory is still 203.9 MB. Free memory was 152.7 MB in the beginning and 108.4 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10973.01 ms. Allocated memory was 203.9 MB in the beginning and 361.2 MB in the end (delta: 157.3 MB). Free memory was 108.4 MB in the beginning and 107.6 MB in the end (delta: 886.2 kB). Peak memory consumption was 158.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2313, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2314, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1217 SDtfs, 1361 SDslu, 2154 SDs, 0 SdLazy, 1061 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8220occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 1641 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 30050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...