/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/safe022_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:31:01,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:31:01,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:31:01,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:31:01,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:31:01,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:31:01,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:31:01,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:31:01,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:31:01,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:31:01,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:31:01,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:31:01,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:31:01,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:31:01,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:31:01,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:31:01,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:31:01,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:31:01,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:31:01,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:31:01,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:31:01,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:31:01,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:31:01,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:31:01,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:31:01,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:31:01,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:31:01,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:31:01,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:31:01,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:31:01,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:31:01,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:31:01,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:31:01,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:31:01,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:31:01,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:31:01,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:31:01,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:31:01,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:31:01,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:31:01,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:31:01,949 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 18:31:01,968 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:31:01,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:31:01,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:31:01,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:31:01,970 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:31:01,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:31:01,971 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:31:01,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:31:01,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:31:01,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:31:01,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:31:01,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:31:01,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:31:01,972 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:31:01,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:31:01,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:31:01,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:31:01,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:31:01,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:31:01,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:31:01,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:31:01,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:31:01,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:31:01,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:31:01,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:31:01,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:31:01,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:31:01,975 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:31:01,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:31:01,975 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:31:01,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:31:02,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:31:02,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:31:02,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:31:02,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:31:02,273 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:31:02,274 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc.i [2019-12-27 18:31:02,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a902b0d0/78fccca2a4a745269da443a3c1303e74/FLAG0f403a12f [2019-12-27 18:31:02,921 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:31:02,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc.i [2019-12-27 18:31:02,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a902b0d0/78fccca2a4a745269da443a3c1303e74/FLAG0f403a12f [2019-12-27 18:31:03,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a902b0d0/78fccca2a4a745269da443a3c1303e74 [2019-12-27 18:31:03,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:31:03,170 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:31:03,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:31:03,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:31:03,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:31:03,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:03,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75edc707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03, skipping insertion in model container [2019-12-27 18:31:03,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:03,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:31:03,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:31:03,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:31:03,785 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:31:03,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:31:03,950 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:31:03,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03 WrapperNode [2019-12-27 18:31:03,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:31:03,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:31:03,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:31:03,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:31:03,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:03,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:04,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:31:04,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:31:04,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:31:04,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:31:04,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:04,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:04,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:04,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:04,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:04,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:04,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (1/1) ... [2019-12-27 18:31:04,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:31:04,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:31:04,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:31:04,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:31:04,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (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 18:31:04,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:31:04,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:31:04,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:31:04,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:31:04,121 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:31:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:31:04,121 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:31:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:31:04,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:31:04,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:31:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:31:04,124 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 18:31:04,874 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:31:04,875 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:31:04,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:31:04 BoogieIcfgContainer [2019-12-27 18:31:04,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:31:04,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:31:04,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:31:04,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:31:04,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:31:03" (1/3) ... [2019-12-27 18:31:04,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5e5201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:31:04, skipping insertion in model container [2019-12-27 18:31:04,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:03" (2/3) ... [2019-12-27 18:31:04,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5e5201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:31:04, skipping insertion in model container [2019-12-27 18:31:04,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:31:04" (3/3) ... [2019-12-27 18:31:04,885 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc.i [2019-12-27 18:31:04,896 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:31:04,896 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:31:04,904 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:31:04,905 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:31:04,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,987 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,988 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:04,988 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:05,031 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:31:05,047 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:31:05,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:31:05,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:31:05,048 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:31:05,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:31:05,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:31:05,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:31:05,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:31:05,065 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 18:31:05,067 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 18:31:05,153 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 18:31:05,154 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:31:05,172 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:31:05,192 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 18:31:05,292 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 18:31:05,292 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:31:05,303 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:31:05,324 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 18:31:05,325 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:31:09,884 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 18:31:10,064 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 18:31:10,064 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 18:31:10,067 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 18:31:10,514 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 18:31:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 18:31:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:31:10,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:10,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:31:10,529 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:10,536 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 18:31:10,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:10,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898190844] [2019-12-27 18:31:10,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:10,772 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 18:31:10,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898190844] [2019-12-27 18:31:10,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:10,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:31:10,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417749809] [2019-12-27 18:31:10,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:10,790 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:10,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:31:10,805 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:10,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:10,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:10,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:10,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:10,828 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 18:31:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:11,108 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 18:31:11,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:11,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:31:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:11,186 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 18:31:11,186 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 18:31:11,187 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 18:31:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 18:31:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 18:31:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 18:31:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 18:31:11,673 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 18:31:11,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:11,674 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 18:31:11,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 18:31:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:31:11,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:11,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:11,679 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:11,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:11,680 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 18:31:11,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:11,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747644170] [2019-12-27 18:31:11,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:11,900 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 18:31:11,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747644170] [2019-12-27 18:31:11,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:11,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:31:11,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606147704] [2019-12-27 18:31:11,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:11,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:11,911 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:31:11,911 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:11,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:11,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:31:11,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:11,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:31:11,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:31:11,914 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 18:31:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:12,002 INFO L93 Difference]: Finished difference Result 1760 states and 4447 transitions. [2019-12-27 18:31:12,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:31:12,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:31:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:12,013 INFO L225 Difference]: With dead ends: 1760 [2019-12-27 18:31:12,013 INFO L226 Difference]: Without dead ends: 1292 [2019-12-27 18:31:12,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-27 18:31:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2019-12-27 18:31:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-12-27 18:31:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2938 transitions. [2019-12-27 18:31:12,072 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2938 transitions. Word has length 11 [2019-12-27 18:31:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:12,072 INFO L462 AbstractCegarLoop]: Abstraction has 1292 states and 2938 transitions. [2019-12-27 18:31:12,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:31:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2938 transitions. [2019-12-27 18:31:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:31:12,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:12,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:12,080 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:12,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 18:31:12,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:12,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651938413] [2019-12-27 18:31:12,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:12,221 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 18:31:12,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651938413] [2019-12-27 18:31:12,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:12,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:31:12,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [489891413] [2019-12-27 18:31:12,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:12,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:12,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 18:31:12,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:12,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:12,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:31:12,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:12,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:31:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:12,230 INFO L87 Difference]: Start difference. First operand 1292 states and 2938 transitions. Second operand 5 states. [2019-12-27 18:31:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:12,538 INFO L93 Difference]: Finished difference Result 1855 states and 4087 transitions. [2019-12-27 18:31:12,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:31:12,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:31:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:12,549 INFO L225 Difference]: With dead ends: 1855 [2019-12-27 18:31:12,549 INFO L226 Difference]: Without dead ends: 1854 [2019-12-27 18:31:12,550 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 18:31:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-12-27 18:31:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1547. [2019-12-27 18:31:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-27 18:31:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-27 18:31:12,598 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 14 [2019-12-27 18:31:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:12,599 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-27 18:31:12,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:31:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-27 18:31:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 18:31:12,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:12,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:12,603 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 18:31:12,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:12,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572346455] [2019-12-27 18:31:12,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:12,793 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 18:31:12,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572346455] [2019-12-27 18:31:12,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:12,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:31:12,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1383703720] [2019-12-27 18:31:12,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:12,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:12,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 18:31:12,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:12,808 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:12,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:31:12,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:12,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:31:12,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:31:12,809 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-27 18:31:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:13,318 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-27 18:31:13,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:31:13,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 18:31:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:13,331 INFO L225 Difference]: With dead ends: 2337 [2019-12-27 18:31:13,332 INFO L226 Difference]: Without dead ends: 2285 [2019-12-27 18:31:13,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:31:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-27 18:31:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-27 18:31:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-27 18:31:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-27 18:31:13,372 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-27 18:31:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:13,372 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-27 18:31:13,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:31:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-27 18:31:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 18:31:13,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:13,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:13,375 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-27 18:31:13,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:13,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011464966] [2019-12-27 18:31:13,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:13,440 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 18:31:13,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011464966] [2019-12-27 18:31:13,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:13,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:31:13,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2101788068] [2019-12-27 18:31:13,441 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:13,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:13,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 18:31:13,455 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:13,457 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:13,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:13,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:13,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:13,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:13,458 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 3 states. [2019-12-27 18:31:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:13,478 INFO L93 Difference]: Finished difference Result 1624 states and 3602 transitions. [2019-12-27 18:31:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:13,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 18:31:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:13,488 INFO L225 Difference]: With dead ends: 1624 [2019-12-27 18:31:13,488 INFO L226 Difference]: Without dead ends: 1624 [2019-12-27 18:31:13,489 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 18:31:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-27 18:31:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2019-12-27 18:31:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2019-12-27 18:31:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 3602 transitions. [2019-12-27 18:31:13,532 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 3602 transitions. Word has length 26 [2019-12-27 18:31:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:13,533 INFO L462 AbstractCegarLoop]: Abstraction has 1624 states and 3602 transitions. [2019-12-27 18:31:13,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 3602 transitions. [2019-12-27 18:31:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 18:31:13,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:13,536 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 18:31:13,536 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:13,536 INFO L82 PathProgramCache]: Analyzing trace with hash -929253500, now seen corresponding path program 1 times [2019-12-27 18:31:13,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:13,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729327520] [2019-12-27 18:31:13,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:13,616 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 18:31:13,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729327520] [2019-12-27 18:31:13,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:13,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:13,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1372094715] [2019-12-27 18:31:13,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:13,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:13,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 33 transitions. [2019-12-27 18:31:13,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:13,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:31:13,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:31:13,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:31:13,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:31:13,638 INFO L87 Difference]: Start difference. First operand 1624 states and 3602 transitions. Second operand 4 states. [2019-12-27 18:31:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:13,669 INFO L93 Difference]: Finished difference Result 2605 states and 5852 transitions. [2019-12-27 18:31:13,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:31:13,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 18:31:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:13,675 INFO L225 Difference]: With dead ends: 2605 [2019-12-27 18:31:13,675 INFO L226 Difference]: Without dead ends: 1149 [2019-12-27 18:31:13,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2019-12-27 18:31:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2019-12-27 18:31:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-12-27 18:31:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 2552 transitions. [2019-12-27 18:31:13,701 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 2552 transitions. Word has length 27 [2019-12-27 18:31:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:13,702 INFO L462 AbstractCegarLoop]: Abstraction has 1149 states and 2552 transitions. [2019-12-27 18:31:13,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:31:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2552 transitions. [2019-12-27 18:31:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 18:31:13,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:13,704 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 18:31:13,704 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:13,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:13,704 INFO L82 PathProgramCache]: Analyzing trace with hash -451164714, now seen corresponding path program 2 times [2019-12-27 18:31:13,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:13,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355648747] [2019-12-27 18:31:13,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:13,791 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 18:31:13,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355648747] [2019-12-27 18:31:13,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:13,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:31:13,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1703028931] [2019-12-27 18:31:13,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:13,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:13,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 18:31:13,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:13,919 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:31:13,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:31:13,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:13,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:31:13,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:31:13,920 INFO L87 Difference]: Start difference. First operand 1149 states and 2552 transitions. Second operand 8 states. [2019-12-27 18:31:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:14,662 INFO L93 Difference]: Finished difference Result 1862 states and 4038 transitions. [2019-12-27 18:31:14,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:31:14,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 18:31:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:14,673 INFO L225 Difference]: With dead ends: 1862 [2019-12-27 18:31:14,673 INFO L226 Difference]: Without dead ends: 1862 [2019-12-27 18:31:14,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:31:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-12-27 18:31:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1665. [2019-12-27 18:31:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-12-27 18:31:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 3660 transitions. [2019-12-27 18:31:14,709 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 3660 transitions. Word has length 27 [2019-12-27 18:31:14,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:14,710 INFO L462 AbstractCegarLoop]: Abstraction has 1665 states and 3660 transitions. [2019-12-27 18:31:14,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:31:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3660 transitions. [2019-12-27 18:31:14,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:31:14,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:14,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:14,713 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-27 18:31:14,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:14,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336642156] [2019-12-27 18:31:14,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:14,793 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 18:31:14,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336642156] [2019-12-27 18:31:14,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:14,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:31:14,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1104464764] [2019-12-27 18:31:14,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:14,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:14,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 18:31:14,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:14,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:31:14,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:31:14,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:14,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:31:14,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:31:14,897 INFO L87 Difference]: Start difference. First operand 1665 states and 3660 transitions. Second operand 6 states. [2019-12-27 18:31:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:14,950 INFO L93 Difference]: Finished difference Result 974 states and 2029 transitions. [2019-12-27 18:31:14,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:31:14,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 18:31:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:14,955 INFO L225 Difference]: With dead ends: 974 [2019-12-27 18:31:14,955 INFO L226 Difference]: Without dead ends: 842 [2019-12-27 18:31:14,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:31:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-12-27 18:31:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 800. [2019-12-27 18:31:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 18:31:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-27 18:31:14,971 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 28 [2019-12-27 18:31:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:14,972 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-27 18:31:14,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:31:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-27 18:31:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 18:31:14,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:14,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:14,975 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:14,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:14,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 1 times [2019-12-27 18:31:14,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:14,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105471507] [2019-12-27 18:31:14,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:15,058 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 18:31:15,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105471507] [2019-12-27 18:31:15,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:15,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:31:15,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [440086901] [2019-12-27 18:31:15,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:15,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:15,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 110 transitions. [2019-12-27 18:31:15,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:15,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:31:15,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:31:15,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:31:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:31:15,164 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 9 states. [2019-12-27 18:31:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:15,478 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-27 18:31:15,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:31:15,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-27 18:31:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:15,484 INFO L225 Difference]: With dead ends: 1394 [2019-12-27 18:31:15,484 INFO L226 Difference]: Without dead ends: 931 [2019-12-27 18:31:15,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:31:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-27 18:31:15,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-27 18:31:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-27 18:31:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-27 18:31:15,502 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-27 18:31:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:15,502 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-27 18:31:15,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:31:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-27 18:31:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 18:31:15,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:15,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:15,505 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:15,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:15,506 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 2 times [2019-12-27 18:31:15,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:15,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319493019] [2019-12-27 18:31:15,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:15,586 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 18:31:15,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319493019] [2019-12-27 18:31:15,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:15,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:15,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1303845252] [2019-12-27 18:31:15,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:15,602 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:15,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 112 transitions. [2019-12-27 18:31:15,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:15,725 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:15,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:15,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:15,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:15,726 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-27 18:31:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:15,781 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-27 18:31:15,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:15,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 18:31:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:15,786 INFO L225 Difference]: With dead ends: 1051 [2019-12-27 18:31:15,786 INFO L226 Difference]: Without dead ends: 1051 [2019-12-27 18:31:15,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-27 18:31:15,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-27 18:31:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-27 18:31:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-27 18:31:15,804 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-27 18:31:15,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:15,804 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-27 18:31:15,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:15,804 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-27 18:31:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 18:31:15,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:15,806 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 18:31:15,807 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:15,807 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-27 18:31:15,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:15,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37141114] [2019-12-27 18:31:15,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:15,923 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 18:31:15,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37141114] [2019-12-27 18:31:15,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:15,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:15,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113815334] [2019-12-27 18:31:15,924 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:15,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:15,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 99 transitions. [2019-12-27 18:31:15,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:15,979 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:15,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:15,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:15,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:15,980 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 3 states. [2019-12-27 18:31:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:15,994 INFO L93 Difference]: Finished difference Result 848 states and 1813 transitions. [2019-12-27 18:31:15,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:15,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 18:31:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:15,998 INFO L225 Difference]: With dead ends: 848 [2019-12-27 18:31:15,998 INFO L226 Difference]: Without dead ends: 848 [2019-12-27 18:31:15,999 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 18:31:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-12-27 18:31:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 754. [2019-12-27 18:31:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 18:31:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 18:31:16,014 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 18:31:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:16,014 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 18:31:16,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 18:31:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:31:16,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:16,017 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 18:31:16,017 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:16,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:16,017 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 18:31:16,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:16,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840743479] [2019-12-27 18:31:16,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:31:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:31:16,143 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:31:16,144 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:31:16,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (store .cse0 |v_ULTIMATE.start_main_~#t2305~0.base_48| 1) |v_#valid_73|) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2305~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2305~0.base_48|) |v_ULTIMATE.start_main_~#t2305~0.offset_31| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= v_~y$r_buff1_thd0~0_129 0) (= v_~y$read_delayed~0_6 0) (= |v_ULTIMATE.start_main_~#t2305~0.offset_31| 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2305~0.base_48|)) (= v_~main$tmp_guard1~0_41 0) (= 0 |v_#NULL.base_6|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2305~0.base_48| 4) |v_#length_17|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= v_~y$r_buff1_thd1~0_115 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2305~0.base_48|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2306~0.offset=|v_ULTIMATE.start_main_~#t2306~0.offset_31|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ULTIMATE.start_main_~#t2305~0.base=|v_ULTIMATE.start_main_~#t2305~0.base_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ULTIMATE.start_main_~#t2306~0.base=|v_ULTIMATE.start_main_~#t2306~0.base_49|, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_~#t2305~0.offset=|v_ULTIMATE.start_main_~#t2305~0.offset_31|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2306~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2305~0.base, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2306~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2305~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:31:16,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2306~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2306~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2306~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2306~0.base_13|) |v_ULTIMATE.start_main_~#t2306~0.offset_11| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2306~0.base_13|)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2306~0.base_13| 4) |v_#length_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2306~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t2306~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2306~0.base=|v_ULTIMATE.start_main_~#t2306~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2306~0.offset=|v_ULTIMATE.start_main_~#t2306~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2306~0.base, ULTIMATE.start_main_~#t2306~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 18:31:16,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd2~0_Out160348581 ~y$r_buff0_thd2~0_In160348581) (= ~y$r_buff0_thd1~0_In160348581 ~y$r_buff1_thd1~0_Out160348581) (= ~y$r_buff1_thd0~0_Out160348581 ~y$r_buff0_thd0~0_In160348581) (= ~y$r_buff0_thd1~0_Out160348581 1) (= 1 ~x~0_Out160348581) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In160348581 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In160348581, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In160348581, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In160348581, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In160348581} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out160348581, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out160348581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In160348581, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out160348581, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In160348581, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In160348581, ~x~0=~x~0_Out160348581, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out160348581} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 18:31:16,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In2136305214 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2136305214 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2136305214| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2136305214| ~y$w_buff0_used~0_In2136305214) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2136305214, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2136305214} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2136305214|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2136305214, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2136305214} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:31:16,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1309371250 256) 0))) (or (and (= ~y$w_buff0_used~0_In1309371250 |P1Thread1of1ForFork1_#t~ite20_Out1309371250|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1309371250 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1309371250 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1309371250 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1309371250 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out1309371250| |P1Thread1of1ForFork1_#t~ite20_Out1309371250|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out1309371250| ~y$w_buff0_used~0_In1309371250) (= |P1Thread1of1ForFork1_#t~ite20_In1309371250| |P1Thread1of1ForFork1_#t~ite20_Out1309371250|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1309371250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1309371250, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1309371250|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1309371250, ~weak$$choice2~0=~weak$$choice2~0_In1309371250, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1309371250} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1309371250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1309371250, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1309371250|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1309371250, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1309371250|, ~weak$$choice2~0=~weak$$choice2~0_In1309371250, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1309371250} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 18:31:16,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1460404161 256))) (.cse4 (= |P1Thread1of1ForFork1_#t~ite24_Out1460404161| |P1Thread1of1ForFork1_#t~ite23_Out1460404161|)) (.cse5 (= (mod ~weak$$choice2~0_In1460404161 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1460404161 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1460404161 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1460404161 256)))) (or (and (or (and (or (and .cse0 .cse1) .cse2 (and .cse3 .cse1)) (= ~y$w_buff1_used~0_In1460404161 |P1Thread1of1ForFork1_#t~ite23_Out1460404161|) .cse4 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite24_Out1460404161| ~y$w_buff1_used~0_In1460404161) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_In1460404161| |P1Thread1of1ForFork1_#t~ite23_Out1460404161|))) (= |P1Thread1of1ForFork1_#t~ite22_In1460404161| |P1Thread1of1ForFork1_#t~ite22_Out1460404161|)) (let ((.cse6 (not .cse1))) (and (= 0 |P1Thread1of1ForFork1_#t~ite22_Out1460404161|) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite22_Out1460404161| |P1Thread1of1ForFork1_#t~ite23_Out1460404161|) .cse4 .cse5 (or .cse6 (not .cse3)) (or (not .cse0) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1460404161, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1460404161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1460404161, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1460404161|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1460404161|, ~weak$$choice2~0=~weak$$choice2~0_In1460404161, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1460404161} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1460404161, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1460404161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1460404161, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1460404161|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1460404161|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1460404161|, ~weak$$choice2~0=~weak$$choice2~0_In1460404161, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1460404161} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 18:31:16,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In2121755829 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In2121755829 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2121755829 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In2121755829 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2121755829 |P0Thread1of1ForFork0_#t~ite6_Out2121755829|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out2121755829| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2121755829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2121755829, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2121755829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121755829} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2121755829|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2121755829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2121755829, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2121755829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121755829} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:31:16,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1989322258 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1989322258 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out1989322258 ~y$r_buff0_thd1~0_In1989322258)) (and (= ~y$r_buff0_thd1~0_Out1989322258 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1989322258, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1989322258} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1989322258, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1989322258|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1989322258} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:31:16,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In138960793 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In138960793 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In138960793 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In138960793 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out138960793|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In138960793 |P0Thread1of1ForFork0_#t~ite8_Out138960793|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In138960793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In138960793, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In138960793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In138960793} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In138960793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In138960793, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out138960793|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In138960793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In138960793} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:31:16,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:31:16,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-157580604 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-157580604| |P1Thread1of1ForFork1_#t~ite29_Out-157580604|) (= ~y$r_buff1_thd2~0_In-157580604 |P1Thread1of1ForFork1_#t~ite30_Out-157580604|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out-157580604| |P1Thread1of1ForFork1_#t~ite29_Out-157580604|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-157580604 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-157580604 256) 0)) (= (mod ~y$w_buff0_used~0_In-157580604 256) 0) (and (= (mod ~y$w_buff1_used~0_In-157580604 256) 0) .cse1))) (= ~y$r_buff1_thd2~0_In-157580604 |P1Thread1of1ForFork1_#t~ite29_Out-157580604|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-157580604, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-157580604|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-157580604, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-157580604, ~weak$$choice2~0=~weak$$choice2~0_In-157580604, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-157580604} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-157580604, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-157580604|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-157580604|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-157580604, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-157580604, ~weak$$choice2~0=~weak$$choice2~0_In-157580604, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-157580604} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 18:31:16,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 18:31:16,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In525447308 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In525447308 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In525447308 |P1Thread1of1ForFork1_#t~ite32_Out525447308|)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In525447308 |P1Thread1of1ForFork1_#t~ite32_Out525447308|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In525447308, ~y$w_buff1~0=~y$w_buff1~0_In525447308, ~y~0=~y~0_In525447308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In525447308} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In525447308, ~y$w_buff1~0=~y$w_buff1~0_In525447308, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out525447308|, ~y~0=~y~0_In525447308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In525447308} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:31:16,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 18:31:16,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2135027270 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2135027270 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out2135027270| ~y$w_buff0_used~0_In2135027270) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out2135027270| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2135027270, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2135027270} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2135027270, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2135027270, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2135027270|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:31:16,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-833727650 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-833727650 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-833727650 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-833727650 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-833727650 |P1Thread1of1ForFork1_#t~ite35_Out-833727650|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-833727650| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-833727650, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-833727650, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-833727650, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-833727650} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-833727650, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-833727650, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-833727650, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-833727650|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-833727650} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:31:16,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1102894761 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1102894761 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1102894761| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1102894761| ~y$r_buff0_thd2~0_In1102894761)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1102894761, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1102894761} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1102894761, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1102894761, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1102894761|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:31:16,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1511874369 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1511874369 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1511874369 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1511874369 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1511874369| ~y$r_buff1_thd2~0_In1511874369)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1511874369| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1511874369, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1511874369, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1511874369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1511874369} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1511874369, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1511874369, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1511874369, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1511874369|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1511874369} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:31:16,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:31:16,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:31:16,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:31:16,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In707832372 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In707832372 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out707832372| ~y~0_In707832372)) (and (= |ULTIMATE.start_main_#t~ite40_Out707832372| ~y$w_buff1~0_In707832372) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In707832372, ~y~0=~y~0_In707832372, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In707832372, ~y$w_buff1_used~0=~y$w_buff1_used~0_In707832372} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out707832372|, ~y$w_buff1~0=~y$w_buff1~0_In707832372, ~y~0=~y~0_In707832372, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In707832372, ~y$w_buff1_used~0=~y$w_buff1_used~0_In707832372} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 18:31:16,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 18:31:16,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-637889555 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-637889555 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-637889555| ~y$w_buff0_used~0_In-637889555) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-637889555| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-637889555, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-637889555} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-637889555, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-637889555, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-637889555|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 18:31:16,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1886417782 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1886417782 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1886417782 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1886417782 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1886417782| ~y$w_buff1_used~0_In-1886417782)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite43_Out-1886417782| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1886417782, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1886417782, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1886417782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1886417782} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1886417782, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1886417782, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1886417782|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1886417782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1886417782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:31:16,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1657675646 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1657675646 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1657675646|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-1657675646 |ULTIMATE.start_main_#t~ite44_Out-1657675646|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1657675646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1657675646} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1657675646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1657675646, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1657675646|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:31:16,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In150672537 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In150672537 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In150672537 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In150672537 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In150672537 |ULTIMATE.start_main_#t~ite45_Out150672537|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out150672537|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In150672537, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In150672537, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In150672537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In150672537} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In150672537, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In150672537, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In150672537, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out150672537|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In150672537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:31:16,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:31:16,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:31:16 BasicIcfg [2019-12-27 18:31:16,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:31:16,238 INFO L168 Benchmark]: Toolchain (without parser) took 13069.15 ms. Allocated memory was 145.2 MB in the beginning and 443.0 MB in the end (delta: 297.8 MB). Free memory was 101.2 MB in the beginning and 123.9 MB in the end (delta: -22.7 MB). Peak memory consumption was 275.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:16,239 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 18:31:16,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.10 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 157.6 MB in the end (delta: -56.8 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:16,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.94 ms. Allocated memory is still 202.9 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:16,241 INFO L168 Benchmark]: Boogie Preprocessor took 43.75 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:16,242 INFO L168 Benchmark]: RCFGBuilder took 819.85 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 108.7 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:16,243 INFO L168 Benchmark]: TraceAbstraction took 11359.10 ms. Allocated memory was 202.9 MB in the beginning and 443.0 MB in the end (delta: 240.1 MB). Free memory was 108.0 MB in the beginning and 123.9 MB in the end (delta: -15.9 MB). Peak memory consumption was 224.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:16,247 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.10 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 157.6 MB in the end (delta: -56.8 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.94 ms. Allocated memory is still 202.9 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.75 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.85 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 108.7 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11359.10 ms. Allocated memory was 202.9 MB in the beginning and 443.0 MB in the end (delta: 240.1 MB). Free memory was 108.0 MB in the beginning and 123.9 MB in the end (delta: -15.9 MB). Peak memory consumption was 224.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1217 SDtfs, 1441 SDslu, 2546 SDs, 0 SdLazy, 1277 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8220occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 1641 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 57314 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...