/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:49:29,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:49:29,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:49:29,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:49:29,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:49:29,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:49:29,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:49:29,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:49:29,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:49:29,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:49:29,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:49:29,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:49:29,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:49:29,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:49:29,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:49:29,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:49:29,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:49:29,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:49:29,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:49:29,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:49:29,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:49:29,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:49:29,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:49:29,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:49:29,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:49:29,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:49:29,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:49:29,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:49:29,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:49:29,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:49:29,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:49:29,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:49:29,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:49:29,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:49:29,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:49:29,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:49:29,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:49:29,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:49:29,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:49:29,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:49:29,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:49:29,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:49:30,008 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:49:30,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:49:30,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:49:30,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:49:30,013 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:49:30,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:49:30,014 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:49:30,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:49:30,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:49:30,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:49:30,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:49:30,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:49:30,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:49:30,016 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:49:30,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:49:30,017 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:49:30,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:49:30,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:49:30,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:49:30,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:49:30,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:49:30,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:49:30,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:49:30,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:49:30,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:49:30,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:49:30,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:49:30,021 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:49:30,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:49:30,022 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:49:30,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:49:30,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:49:30,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:49:30,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:49:30,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:49:30,332 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:49:30,333 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i [2019-12-27 15:49:30,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728e52a73/d3dddae6d6f74e358e0b16f66286d589/FLAG29318d733 [2019-12-27 15:49:30,985 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:49:30,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i [2019-12-27 15:49:31,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728e52a73/d3dddae6d6f74e358e0b16f66286d589/FLAG29318d733 [2019-12-27 15:49:31,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728e52a73/d3dddae6d6f74e358e0b16f66286d589 [2019-12-27 15:49:31,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:49:31,285 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:49:31,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:49:31,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:49:31,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:49:31,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:49:31" (1/1) ... [2019-12-27 15:49:31,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:31, skipping insertion in model container [2019-12-27 15:49:31,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:49:31" (1/1) ... [2019-12-27 15:49:31,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:49:31,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:49:31,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:49:31,916 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:49:31,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:49:32,056 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:49:32,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32 WrapperNode [2019-12-27 15:49:32,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:49:32,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:49:32,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:49:32,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:49:32,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (1/1) ... [2019-12-27 15:49:32,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (1/1) ... [2019-12-27 15:49:32,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:49:32,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:49:32,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:49:32,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:49:32,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (1/1) ... [2019-12-27 15:49:32,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (1/1) ... [2019-12-27 15:49:32,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (1/1) ... [2019-12-27 15:49:32,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (1/1) ... [2019-12-27 15:49:32,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (1/1) ... [2019-12-27 15:49:32,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (1/1) ... [2019-12-27 15:49:32,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (1/1) ... [2019-12-27 15:49:32,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:49:32,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:49:32,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:49:32,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:49:32,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:49:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:49:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:49:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:49:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:49:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:49:32,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:49:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:49:32,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:49:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:49:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:49:32,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:49:32,233 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:49:32,873 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:49:32,874 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:49:32,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:49:32 BoogieIcfgContainer [2019-12-27 15:49:32,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:49:32,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:49:32,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:49:32,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:49:32,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:49:31" (1/3) ... [2019-12-27 15:49:32,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec9cf1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:49:32, skipping insertion in model container [2019-12-27 15:49:32,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:49:32" (2/3) ... [2019-12-27 15:49:32,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec9cf1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:49:32, skipping insertion in model container [2019-12-27 15:49:32,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:49:32" (3/3) ... [2019-12-27 15:49:32,884 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_pso.oepc.i [2019-12-27 15:49:32,895 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:49:32,895 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:49:32,903 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:49:32,904 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:49:32,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,945 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,945 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,955 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,955 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:32,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,001 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,008 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:49:33,028 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 15:49:33,047 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:49:33,048 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:49:33,048 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:49:33,048 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:49:33,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:49:33,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:49:33,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:49:33,049 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:49:33,065 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 184 transitions [2019-12-27 15:49:33,067 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-27 15:49:33,152 INFO L132 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-27 15:49:33,152 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:49:33,167 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/139 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 15:49:33,190 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-27 15:49:33,234 INFO L132 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-27 15:49:33,234 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:49:33,241 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/139 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 15:49:33,259 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 15:49:33,260 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:49:38,103 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 15:49:38,347 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-12-27 15:49:38,614 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 15:49:38,721 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 15:49:38,742 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54623 [2019-12-27 15:49:38,743 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 15:49:38,746 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-27 15:49:39,280 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 15:49:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 15:49:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:49:39,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:39,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:49:39,290 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:39,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:39,296 INFO L82 PathProgramCache]: Analyzing trace with hash 798193, now seen corresponding path program 1 times [2019-12-27 15:49:39,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:39,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690351842] [2019-12-27 15:49:39,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:39,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690351842] [2019-12-27 15:49:39,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:39,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:49:39,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2047374136] [2019-12-27 15:49:39,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:39,516 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:39,528 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:49:39,529 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:39,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:49:39,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:49:39,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:39,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:49:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:49:39,550 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 15:49:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:39,847 INFO L93 Difference]: Finished difference Result 8466 states and 27782 transitions. [2019-12-27 15:49:39,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:49:39,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:49:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:39,946 INFO L225 Difference]: With dead ends: 8466 [2019-12-27 15:49:39,946 INFO L226 Difference]: Without dead ends: 7974 [2019-12-27 15:49:39,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:49:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-27 15:49:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-27 15:49:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-27 15:49:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 26121 transitions. [2019-12-27 15:49:40,382 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 26121 transitions. Word has length 3 [2019-12-27 15:49:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:40,382 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 26121 transitions. [2019-12-27 15:49:40,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:49:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 26121 transitions. [2019-12-27 15:49:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:49:40,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:40,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:49:40,387 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:40,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:40,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1209832272, now seen corresponding path program 1 times [2019-12-27 15:49:40,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:40,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822000299] [2019-12-27 15:49:40,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:40,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822000299] [2019-12-27 15:49:40,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:40,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:49:40,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1136267102] [2019-12-27 15:49:40,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:40,507 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:40,513 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:49:40,513 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:40,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:49:40,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:49:40,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:40,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:49:40,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:49:40,516 INFO L87 Difference]: Start difference. First operand 7974 states and 26121 transitions. Second operand 3 states. [2019-12-27 15:49:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:40,558 INFO L93 Difference]: Finished difference Result 1283 states and 2944 transitions. [2019-12-27 15:49:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:49:40,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 15:49:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:40,566 INFO L225 Difference]: With dead ends: 1283 [2019-12-27 15:49:40,566 INFO L226 Difference]: Without dead ends: 1283 [2019-12-27 15:49:40,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:49:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-27 15:49:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-12-27 15:49:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-27 15:49:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2944 transitions. [2019-12-27 15:49:40,610 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2944 transitions. Word has length 11 [2019-12-27 15:49:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:40,611 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2944 transitions. [2019-12-27 15:49:40,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:49:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2944 transitions. [2019-12-27 15:49:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:49:40,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:40,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:49:40,618 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:40,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash 768793875, now seen corresponding path program 1 times [2019-12-27 15:49:40,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:40,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940638600] [2019-12-27 15:49:40,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:40,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940638600] [2019-12-27 15:49:40,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:40,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:49:40,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1043859364] [2019-12-27 15:49:40,768 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:40,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:40,773 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 15:49:40,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:40,774 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:49:40,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:49:40,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:40,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:49:40,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:49:40,775 INFO L87 Difference]: Start difference. First operand 1283 states and 2944 transitions. Second operand 5 states. [2019-12-27 15:49:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:41,105 INFO L93 Difference]: Finished difference Result 1902 states and 4249 transitions. [2019-12-27 15:49:41,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:49:41,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 15:49:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:41,115 INFO L225 Difference]: With dead ends: 1902 [2019-12-27 15:49:41,116 INFO L226 Difference]: Without dead ends: 1902 [2019-12-27 15:49:41,116 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-27 15:49:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-12-27 15:49:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1604. [2019-12-27 15:49:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-27 15:49:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3640 transitions. [2019-12-27 15:49:41,160 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3640 transitions. Word has length 14 [2019-12-27 15:49:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:41,161 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3640 transitions. [2019-12-27 15:49:41,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:49:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3640 transitions. [2019-12-27 15:49:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:49:41,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:41,164 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] [2019-12-27 15:49:41,164 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:41,164 INFO L82 PathProgramCache]: Analyzing trace with hash -845336479, now seen corresponding path program 1 times [2019-12-27 15:49:41,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:41,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147406098] [2019-12-27 15:49:41,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:41,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147406098] [2019-12-27 15:49:41,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:41,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:49:41,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [966267373] [2019-12-27 15:49:41,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:41,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:41,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 15:49:41,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:41,288 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:49:41,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:49:41,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:41,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:49:41,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:49:41,289 INFO L87 Difference]: Start difference. First operand 1604 states and 3640 transitions. Second operand 6 states. [2019-12-27 15:49:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:41,684 INFO L93 Difference]: Finished difference Result 2385 states and 5172 transitions. [2019-12-27 15:49:41,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:49:41,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 15:49:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:41,697 INFO L225 Difference]: With dead ends: 2385 [2019-12-27 15:49:41,697 INFO L226 Difference]: Without dead ends: 2385 [2019-12-27 15:49:41,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:49:41,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-12-27 15:49:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1725. [2019-12-27 15:49:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-12-27 15:49:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3880 transitions. [2019-12-27 15:49:41,740 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3880 transitions. Word has length 25 [2019-12-27 15:49:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:41,741 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3880 transitions. [2019-12-27 15:49:41,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:49:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3880 transitions. [2019-12-27 15:49:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 15:49:41,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:41,743 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-27 15:49:41,744 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:41,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:41,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1948393738, now seen corresponding path program 1 times [2019-12-27 15:49:41,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:41,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826729113] [2019-12-27 15:49:41,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:41,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826729113] [2019-12-27 15:49:41,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:41,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:49:41,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408420190] [2019-12-27 15:49:41,842 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:41,846 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:41,855 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 15:49:41,856 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:41,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:49:41,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:49:41,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:41,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:49:41,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:49:41,859 INFO L87 Difference]: Start difference. First operand 1725 states and 3880 transitions. Second operand 3 states. [2019-12-27 15:49:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:41,872 INFO L93 Difference]: Finished difference Result 1724 states and 3878 transitions. [2019-12-27 15:49:41,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:49:41,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 15:49:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:41,883 INFO L225 Difference]: With dead ends: 1724 [2019-12-27 15:49:41,883 INFO L226 Difference]: Without dead ends: 1724 [2019-12-27 15:49:41,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:49:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-27 15:49:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2019-12-27 15:49:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-12-27 15:49:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3878 transitions. [2019-12-27 15:49:41,922 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3878 transitions. Word has length 26 [2019-12-27 15:49:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:41,923 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 3878 transitions. [2019-12-27 15:49:41,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:49:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3878 transitions. [2019-12-27 15:49:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:49:41,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:41,925 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-27 15:49:41,926 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash -50148810, now seen corresponding path program 1 times [2019-12-27 15:49:41,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:41,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785713104] [2019-12-27 15:49:41,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:42,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785713104] [2019-12-27 15:49:42,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:42,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:49:42,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048028290] [2019-12-27 15:49:42,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:42,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:42,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 15:49:42,072 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:42,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:49:42,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:49:42,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:42,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:49:42,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:49:42,078 INFO L87 Difference]: Start difference. First operand 1724 states and 3878 transitions. Second operand 5 states. [2019-12-27 15:49:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:42,607 INFO L93 Difference]: Finished difference Result 2512 states and 5536 transitions. [2019-12-27 15:49:42,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:49:42,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 15:49:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:42,620 INFO L225 Difference]: With dead ends: 2512 [2019-12-27 15:49:42,621 INFO L226 Difference]: Without dead ends: 2512 [2019-12-27 15:49:42,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:49:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2019-12-27 15:49:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2217. [2019-12-27 15:49:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-12-27 15:49:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 4954 transitions. [2019-12-27 15:49:42,667 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 4954 transitions. Word has length 27 [2019-12-27 15:49:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:42,668 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 4954 transitions. [2019-12-27 15:49:42,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:49:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 4954 transitions. [2019-12-27 15:49:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 15:49:42,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:42,671 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-27 15:49:42,671 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1337227567, now seen corresponding path program 1 times [2019-12-27 15:49:42,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:42,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029283042] [2019-12-27 15:49:42,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:42,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029283042] [2019-12-27 15:49:42,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:42,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:49:42,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834620499] [2019-12-27 15:49:42,711 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:42,717 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:42,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 15:49:42,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:42,731 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:49:42,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:49:42,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:42,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:49:42,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:49:42,732 INFO L87 Difference]: Start difference. First operand 2217 states and 4954 transitions. Second operand 4 states. [2019-12-27 15:49:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:42,747 INFO L93 Difference]: Finished difference Result 1233 states and 2633 transitions. [2019-12-27 15:49:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:49:42,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 15:49:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:42,752 INFO L225 Difference]: With dead ends: 1233 [2019-12-27 15:49:42,752 INFO L226 Difference]: Without dead ends: 1233 [2019-12-27 15:49:42,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:49:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-12-27 15:49:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1144. [2019-12-27 15:49:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-12-27 15:49:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2469 transitions. [2019-12-27 15:49:42,775 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2469 transitions. Word has length 28 [2019-12-27 15:49:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:42,776 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 2469 transitions. [2019-12-27 15:49:42,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:49:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2469 transitions. [2019-12-27 15:49:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 15:49:42,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:42,779 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-27 15:49:42,779 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:42,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2075557978, now seen corresponding path program 1 times [2019-12-27 15:49:42,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:42,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676789477] [2019-12-27 15:49:42,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:42,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676789477] [2019-12-27 15:49:42,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:42,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:49:42,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [629922993] [2019-12-27 15:49:42,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:42,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:42,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 15:49:42,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:42,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:49:42,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:49:42,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:49:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:49:42,911 INFO L87 Difference]: Start difference. First operand 1144 states and 2469 transitions. Second operand 3 states. [2019-12-27 15:49:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:42,964 INFO L93 Difference]: Finished difference Result 1748 states and 3666 transitions. [2019-12-27 15:49:42,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:49:42,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 15:49:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:42,972 INFO L225 Difference]: With dead ends: 1748 [2019-12-27 15:49:42,972 INFO L226 Difference]: Without dead ends: 1748 [2019-12-27 15:49:42,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-27 15:49:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-12-27 15:49:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1269. [2019-12-27 15:49:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2019-12-27 15:49:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2718 transitions. [2019-12-27 15:49:42,999 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2718 transitions. Word has length 51 [2019-12-27 15:49:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:43,000 INFO L462 AbstractCegarLoop]: Abstraction has 1269 states and 2718 transitions. [2019-12-27 15:49:43,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:49:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2718 transitions. [2019-12-27 15:49:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 15:49:43,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:43,003 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-27 15:49:43,004 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash -175297467, now seen corresponding path program 1 times [2019-12-27 15:49:43,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:43,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771706815] [2019-12-27 15:49:43,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:43,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771706815] [2019-12-27 15:49:43,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:43,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:49:43,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [202390942] [2019-12-27 15:49:43,092 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:43,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:43,204 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 15:49:43,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:43,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:49:43,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:49:43,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:49:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:49:43,230 INFO L87 Difference]: Start difference. First operand 1269 states and 2718 transitions. Second operand 7 states. [2019-12-27 15:49:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:43,592 INFO L93 Difference]: Finished difference Result 3420 states and 7139 transitions. [2019-12-27 15:49:43,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:49:43,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 15:49:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:43,598 INFO L225 Difference]: With dead ends: 3420 [2019-12-27 15:49:43,598 INFO L226 Difference]: Without dead ends: 2222 [2019-12-27 15:49:43,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:49:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2019-12-27 15:49:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1320. [2019-12-27 15:49:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-12-27 15:49:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2818 transitions. [2019-12-27 15:49:43,633 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2818 transitions. Word has length 51 [2019-12-27 15:49:43,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:43,634 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 2818 transitions. [2019-12-27 15:49:43,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:49:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2818 transitions. [2019-12-27 15:49:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 15:49:43,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:43,637 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-27 15:49:43,638 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:43,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash -128483093, now seen corresponding path program 2 times [2019-12-27 15:49:43,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:43,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826650250] [2019-12-27 15:49:43,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:43,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826650250] [2019-12-27 15:49:43,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:43,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:49:43,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [686642423] [2019-12-27 15:49:43,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:43,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:43,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 128 transitions. [2019-12-27 15:49:43,826 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:43,827 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:49:43,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:49:43,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:43,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:49:43,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:49:43,828 INFO L87 Difference]: Start difference. First operand 1320 states and 2818 transitions. Second operand 3 states. [2019-12-27 15:49:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:43,844 INFO L93 Difference]: Finished difference Result 1319 states and 2816 transitions. [2019-12-27 15:49:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:49:43,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 15:49:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:43,848 INFO L225 Difference]: With dead ends: 1319 [2019-12-27 15:49:43,848 INFO L226 Difference]: Without dead ends: 1319 [2019-12-27 15:49:43,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:49:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-12-27 15:49:43,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1128. [2019-12-27 15:49:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2019-12-27 15:49:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2448 transitions. [2019-12-27 15:49:43,874 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2448 transitions. Word has length 51 [2019-12-27 15:49:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:43,874 INFO L462 AbstractCegarLoop]: Abstraction has 1128 states and 2448 transitions. [2019-12-27 15:49:43,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:49:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2448 transitions. [2019-12-27 15:49:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 15:49:43,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:43,878 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-27 15:49:43,878 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash 529376956, now seen corresponding path program 1 times [2019-12-27 15:49:43,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:43,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12129748] [2019-12-27 15:49:43,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:49:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:49:44,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12129748] [2019-12-27 15:49:44,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:49:44,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:49:44,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410336431] [2019-12-27 15:49:44,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:49:44,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:49:44,159 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 115 transitions. [2019-12-27 15:49:44,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:49:44,160 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:49:44,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:49:44,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:49:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:49:44,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:49:44,161 INFO L87 Difference]: Start difference. First operand 1128 states and 2448 transitions. Second operand 5 states. [2019-12-27 15:49:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:49:44,238 INFO L93 Difference]: Finished difference Result 1374 states and 2961 transitions. [2019-12-27 15:49:44,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:49:44,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 15:49:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:49:44,243 INFO L225 Difference]: With dead ends: 1374 [2019-12-27 15:49:44,243 INFO L226 Difference]: Without dead ends: 1374 [2019-12-27 15:49:44,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:49:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2019-12-27 15:49:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1083. [2019-12-27 15:49:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-12-27 15:49:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2384 transitions. [2019-12-27 15:49:44,268 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 2384 transitions. Word has length 52 [2019-12-27 15:49:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:49:44,268 INFO L462 AbstractCegarLoop]: Abstraction has 1083 states and 2384 transitions. [2019-12-27 15:49:44,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:49:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2384 transitions. [2019-12-27 15:49:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 15:49:44,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:49:44,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:49:44,271 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:49:44,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:49:44,272 INFO L82 PathProgramCache]: Analyzing trace with hash -690859281, now seen corresponding path program 1 times [2019-12-27 15:49:44,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:49:44,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390262441] [2019-12-27 15:49:44,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:49:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:49:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:49:44,411 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:49:44,412 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:49:44,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t245~0.base_34|) (= v_~z$w_buff1~0_283 0) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t245~0.base_34|)) (= v_~z$w_buff0~0_493 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t245~0.base_34| 4)) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t245~0.offset_22|) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_34|) |v_ULTIMATE.start_main_~#t245~0.offset_22| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_cnt~0_48) (= (store .cse0 |v_ULTIMATE.start_main_~#t245~0.base_34| 1) |v_#valid_57|) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t245~0.offset=|v_ULTIMATE.start_main_~#t245~0.offset_22|, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ULTIMATE.start_main_~#t245~0.base=|v_ULTIMATE.start_main_~#t245~0.base_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_21|, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t245~0.offset, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t245~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t246~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t246~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 15:49:44,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= 1 ~x~0_Out409130265) (= ~z$r_buff0_thd1~0_Out409130265 1) (= ~z$r_buff0_thd1~0_In409130265 ~z$r_buff1_thd1~0_Out409130265) (= ~__unbuffered_p0_EAX~0_Out409130265 ~x~0_Out409130265) (= ~z$r_buff1_thd0~0_Out409130265 ~z$r_buff0_thd0~0_In409130265) (= ~__unbuffered_p0_EBX~0_Out409130265 ~y~0_In409130265) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In409130265)) (= ~z$r_buff1_thd2~0_Out409130265 ~z$r_buff0_thd2~0_In409130265)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In409130265, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In409130265, ~y~0=~y~0_In409130265, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In409130265, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In409130265} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out409130265, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In409130265, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out409130265, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out409130265, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out409130265, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out409130265, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In409130265, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out409130265, ~y~0=~y~0_In409130265, ~x~0=~x~0_Out409130265, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In409130265} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 15:49:44,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) |v_ULTIMATE.start_main_~#t246~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t246~0.base_12|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t246~0.base_12| 4) |v_#length_11|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t246~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_12|, #length=|v_#length_11|, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t246~0.base, #length, ULTIMATE.start_main_~#t246~0.offset] because there is no mapped edge [2019-12-27 15:49:44,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1851170712 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In1851170712| |P1Thread1of1ForFork1_#t~ite20_Out1851170712|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out1851170712| ~z$w_buff0_used~0_In1851170712)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1851170712 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1851170712 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1851170712 256)) (and (= (mod ~z$r_buff1_thd2~0_In1851170712 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out1851170712| |P1Thread1of1ForFork1_#t~ite21_Out1851170712|) (= |P1Thread1of1ForFork1_#t~ite20_Out1851170712| ~z$w_buff0_used~0_In1851170712)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1851170712, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1851170712|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1851170712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1851170712, ~weak$$choice2~0=~weak$$choice2~0_In1851170712, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1851170712} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1851170712, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1851170712|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1851170712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1851170712, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1851170712|, ~weak$$choice2~0=~weak$$choice2~0_In1851170712, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1851170712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 15:49:44,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 15:49:44,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-480493037 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-480493037| |P1Thread1of1ForFork1_#t~ite29_Out-480493037|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-480493037| ~z$r_buff1_thd2~0_In-480493037)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-480493037| ~z$r_buff1_thd2~0_In-480493037) (= |P1Thread1of1ForFork1_#t~ite29_Out-480493037| |P1Thread1of1ForFork1_#t~ite30_Out-480493037|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-480493037 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-480493037 256)) (and (= (mod ~z$w_buff1_used~0_In-480493037 256) 0) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-480493037 256))))) .cse0))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-480493037|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-480493037, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-480493037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-480493037, ~weak$$choice2~0=~weak$$choice2~0_In-480493037, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-480493037} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-480493037|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-480493037|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-480493037, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-480493037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-480493037, ~weak$$choice2~0=~weak$$choice2~0_In-480493037, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-480493037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 15:49:44,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 15:49:44,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-832938282 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-832938282 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite32_Out-832938282| |P1Thread1of1ForFork1_#t~ite33_Out-832938282|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-832938282| ~z$w_buff1~0_In-832938282)) (and (or .cse2 .cse0) .cse1 (= |P1Thread1of1ForFork1_#t~ite32_Out-832938282| ~z~0_In-832938282)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-832938282, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-832938282, ~z$w_buff1~0=~z$w_buff1~0_In-832938282, ~z~0=~z~0_In-832938282} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-832938282, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-832938282, ~z$w_buff1~0=~z$w_buff1~0_In-832938282, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-832938282|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-832938282|, ~z~0=~z~0_In-832938282} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 15:49:44,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-852049982 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-852049982 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-852049982 |P1Thread1of1ForFork1_#t~ite34_Out-852049982|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-852049982|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-852049982, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-852049982} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-852049982, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-852049982|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-852049982} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 15:49:44,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1564263601 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1564263601 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1564263601 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1564263601 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1564263601|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1564263601| ~z$w_buff1_used~0_In1564263601) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1564263601, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1564263601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1564263601, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1564263601} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1564263601, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1564263601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1564263601, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1564263601|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1564263601} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 15:49:44,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In697662924 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In697662924 256)))) (or (and (= ~z$r_buff0_thd2~0_In697662924 |P1Thread1of1ForFork1_#t~ite36_Out697662924|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out697662924| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In697662924, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In697662924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In697662924, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In697662924, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out697662924|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 15:49:44,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2044892607 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2044892607 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2044892607|) (not .cse1)) (and (= ~z$w_buff0_used~0_In2044892607 |P0Thread1of1ForFork0_#t~ite5_Out2044892607|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2044892607, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2044892607} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2044892607|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2044892607, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2044892607} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 15:49:44,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-782385187 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-782385187 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-782385187 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-782385187 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-782385187|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-782385187 |P0Thread1of1ForFork0_#t~ite6_Out-782385187|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-782385187, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-782385187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-782385187, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-782385187} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-782385187|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-782385187, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-782385187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-782385187, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-782385187} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 15:49:44,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1358559056 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1358559056 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1358559056 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1358559056 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1358559056|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In1358559056 |P1Thread1of1ForFork1_#t~ite37_Out1358559056|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1358559056, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1358559056, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1358559056, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1358559056} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1358559056, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1358559056, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1358559056, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1358559056, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1358559056|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 15:49:44,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_24|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 15:49:44,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-502311074 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-502311074 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-502311074 ~z$r_buff0_thd1~0_In-502311074)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-502311074 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-502311074, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-502311074} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-502311074, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-502311074|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-502311074} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:49:44,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1169260677 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1169260677 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1169260677 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1169260677 256)))) (or (and (= ~z$r_buff1_thd1~0_In1169260677 |P0Thread1of1ForFork0_#t~ite8_Out1169260677|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1169260677| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1169260677, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1169260677, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1169260677, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1169260677} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1169260677, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1169260677|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1169260677, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1169260677, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1169260677} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 15:49:44,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 15:49:44,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 15:49:44,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In629811436 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In629811436 256) 0))) (or (and (= ~z~0_In629811436 |ULTIMATE.start_main_#t~ite40_Out629811436|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In629811436 |ULTIMATE.start_main_#t~ite40_Out629811436|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In629811436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In629811436, ~z$w_buff1~0=~z$w_buff1~0_In629811436, ~z~0=~z~0_In629811436} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out629811436|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In629811436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In629811436, ~z$w_buff1~0=~z$w_buff1~0_In629811436, ~z~0=~z~0_In629811436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 15:49:44,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 15:49:44,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-256555333 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-256555333 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-256555333| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-256555333 |ULTIMATE.start_main_#t~ite42_Out-256555333|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-256555333, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-256555333} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-256555333, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-256555333, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-256555333|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 15:49:44,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In249214540 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In249214540 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In249214540 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In249214540 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out249214540|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In249214540 |ULTIMATE.start_main_#t~ite43_Out249214540|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In249214540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In249214540, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In249214540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In249214540} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In249214540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In249214540, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In249214540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In249214540, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out249214540|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 15:49:44,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-266009472 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-266009472 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-266009472|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-266009472 |ULTIMATE.start_main_#t~ite44_Out-266009472|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-266009472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-266009472} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-266009472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-266009472, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-266009472|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 15:49:44,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1033202052 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1033202052 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1033202052 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1033202052 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1033202052 |ULTIMATE.start_main_#t~ite45_Out1033202052|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1033202052|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1033202052, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1033202052, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1033202052, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1033202052} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1033202052, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1033202052, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1033202052, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1033202052, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1033202052|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 15:49:44,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p0_EBX~0_116 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, 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, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:49:44,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:49:44 BasicIcfg [2019-12-27 15:49:44,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:49:44,565 INFO L168 Benchmark]: Toolchain (without parser) took 13276.29 ms. Allocated memory was 145.8 MB in the beginning and 439.4 MB in the end (delta: 293.6 MB). Free memory was 101.7 MB in the beginning and 210.6 MB in the end (delta: -108.9 MB). Peak memory consumption was 184.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:49:44,568 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 15:49:44,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.89 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 155.5 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 15:49:44,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.65 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:49:44,571 INFO L168 Benchmark]: Boogie Preprocessor took 38.09 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:49:44,574 INFO L168 Benchmark]: RCFGBuilder took 706.55 ms. Allocated memory is still 203.4 MB. Free memory was 150.7 MB in the beginning and 105.3 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:49:44,575 INFO L168 Benchmark]: TraceAbstraction took 11682.52 ms. Allocated memory was 203.4 MB in the beginning and 439.4 MB in the end (delta: 235.9 MB). Free memory was 105.3 MB in the beginning and 210.6 MB in the end (delta: -105.2 MB). Peak memory consumption was 130.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:49:44,583 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.89 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 155.5 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.65 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.09 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 706.55 ms. Allocated memory is still 203.4 MB. Free memory was 150.7 MB in the beginning and 105.3 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11682.52 ms. Allocated memory was 203.4 MB in the beginning and 439.4 MB in the end (delta: 235.9 MB). Free memory was 105.3 MB in the beginning and 210.6 MB in the end (delta: -105.2 MB). Peak memory consumption was 130.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 150 ProgramPointsBefore, 77 ProgramPointsAfterwards, 184 TransitionsBefore, 88 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 4687 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 206 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 54623 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L809] FCALL, FORK 0 pthread_create(&t245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1444 SDtfs, 1067 SDslu, 2653 SDs, 0 SdLazy, 1195 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 3205 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 62148 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...