/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:41:13,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:41:13,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:41:13,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:41:13,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:41:13,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:41:13,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:41:13,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:41:13,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:41:13,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:41:13,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:41:13,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:41:13,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:41:13,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:41:13,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:41:13,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:41:13,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:41:13,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:41:13,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:41:13,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:41:13,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:41:13,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:41:13,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:41:13,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:41:13,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:41:13,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:41:13,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:41:13,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:41:13,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:41:13,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:41:13,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:41:13,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:41:13,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:41:13,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:41:13,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:41:13,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:41:13,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:41:13,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:41:13,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:41:13,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:41:13,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:41:13,910 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-VariableLbe.epf [2019-12-27 06:41:13,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:41:13,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:41:13,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:41:13,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:41:13,934 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:41:13,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:41:13,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:41:13,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:41:13,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:41:13,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:41:13,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:41:13,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:41:13,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:41:13,937 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:41:13,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:41:13,938 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:41:13,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:41:13,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:41:13,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:41:13,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:41:13,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:41:13,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:41:13,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:41:13,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:41:13,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:41:13,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:41:13,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:41:13,940 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:41:13,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:41:13,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:41:14,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:41:14,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:41:14,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:41:14,261 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:41:14,262 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:41:14,262 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i [2019-12-27 06:41:14,327 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8ffcb306/6cddef390c404d50bfd67355ccb7d711/FLAGeb884802d [2019-12-27 06:41:14,889 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:41:14,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i [2019-12-27 06:41:14,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8ffcb306/6cddef390c404d50bfd67355ccb7d711/FLAGeb884802d [2019-12-27 06:41:15,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8ffcb306/6cddef390c404d50bfd67355ccb7d711 [2019-12-27 06:41:15,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:41:15,149 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:41:15,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:41:15,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:41:15,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:41:15,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:41:15" (1/1) ... [2019-12-27 06:41:15,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c331778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15, skipping insertion in model container [2019-12-27 06:41:15,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:41:15" (1/1) ... [2019-12-27 06:41:15,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:41:15,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:41:15,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:41:15,782 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:41:15,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:41:15,930 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:41:15,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15 WrapperNode [2019-12-27 06:41:15,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:41:15,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:41:15,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:41:15,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:41:15,940 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:41:15" (1/1) ... [2019-12-27 06:41:15,959 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:41:15" (1/1) ... [2019-12-27 06:41:15,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:41:15,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:41:15,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:41:15,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:41:15,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15" (1/1) ... [2019-12-27 06:41:16,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15" (1/1) ... [2019-12-27 06:41:16,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15" (1/1) ... [2019-12-27 06:41:16,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15" (1/1) ... [2019-12-27 06:41:16,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15" (1/1) ... [2019-12-27 06:41:16,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15" (1/1) ... [2019-12-27 06:41:16,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15" (1/1) ... [2019-12-27 06:41:16,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:41:16,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:41:16,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:41:16,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:41:16,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15" (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 06:41:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:41:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:41:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:41:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:41:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:41:16,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:41:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:41:16,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:41:16,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:41:16,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:41:16,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:41:16,099 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 06:41:16,805 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:41:16,805 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:41:16,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:41:16 BoogieIcfgContainer [2019-12-27 06:41:16,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:41:16,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:41:16,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:41:16,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:41:16,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:41:15" (1/3) ... [2019-12-27 06:41:16,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7ad805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:41:16, skipping insertion in model container [2019-12-27 06:41:16,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:15" (2/3) ... [2019-12-27 06:41:16,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7ad805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:41:16, skipping insertion in model container [2019-12-27 06:41:16,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:41:16" (3/3) ... [2019-12-27 06:41:16,817 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_rmo.oepc.i [2019-12-27 06:41:16,826 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:41:16,826 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:41:16,833 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:41:16,834 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:41:16,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,872 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,872 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,882 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,882 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:16,980 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:41:17,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:41:17,001 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:41:17,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:41:17,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:41:17,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:41:17,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:41:17,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:41:17,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:41:17,022 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 06:41:17,024 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 06:41:17,110 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 06:41:17,111 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:41:17,128 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 06:41:17,152 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 06:41:17,197 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 06:41:17,198 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:41:17,203 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 06:41:17,218 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 06:41:17,219 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:41:18,999 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-27 06:41:20,693 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 06:41:20,802 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 06:41:20,832 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-27 06:41:20,832 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 06:41:20,835 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 06:41:21,317 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 06:41:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 06:41:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:41:21,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:21,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:41:21,327 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:21,334 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-27 06:41:21,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:21,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725066552] [2019-12-27 06:41:21,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:21,547 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 06:41:21,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725066552] [2019-12-27 06:41:21,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:21,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:41:21,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194393859] [2019-12-27 06:41:21,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:41:21,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:41:21,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:41:21,573 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 06:41:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:21,836 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-27 06:41:21,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:41:21,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:41:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:21,954 INFO L225 Difference]: With dead ends: 7864 [2019-12-27 06:41:21,963 INFO L226 Difference]: Without dead ends: 7408 [2019-12-27 06:41:21,965 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 06:41:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-27 06:41:22,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-27 06:41:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-27 06:41:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-27 06:41:22,348 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-27 06:41:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:22,349 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-27 06:41:22,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:41:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-27 06:41:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:41:22,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:22,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:41:22,353 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-27 06:41:22,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:22,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894214669] [2019-12-27 06:41:22,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:22,444 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 06:41:22,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894214669] [2019-12-27 06:41:22,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:22,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:41:22,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134771877] [2019-12-27 06:41:22,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:41:22,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:41:22,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:41:22,449 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-27 06:41:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:23,006 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-27 06:41:23,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:41:23,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:41:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:23,083 INFO L225 Difference]: With dead ends: 11318 [2019-12-27 06:41:23,083 INFO L226 Difference]: Without dead ends: 11311 [2019-12-27 06:41:23,084 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 06:41:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-27 06:41:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-27 06:41:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-27 06:41:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-27 06:41:23,527 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-27 06:41:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:23,527 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-27 06:41:23,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:41:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-27 06:41:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:41:23,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:23,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:41:23,537 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:23,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-27 06:41:23,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:23,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102285647] [2019-12-27 06:41:23,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:23,670 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 06:41:23,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102285647] [2019-12-27 06:41:23,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:23,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:41:23,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926392284] [2019-12-27 06:41:23,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:41:23,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:41:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:41:23,673 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-27 06:41:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:24,154 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-27 06:41:24,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:41:24,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 06:41:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:24,207 INFO L225 Difference]: With dead ends: 14191 [2019-12-27 06:41:24,207 INFO L226 Difference]: Without dead ends: 14191 [2019-12-27 06:41:24,207 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 06:41:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-27 06:41:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-27 06:41:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-27 06:41:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-27 06:41:24,613 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-27 06:41:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:24,617 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-27 06:41:24,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:41:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-27 06:41:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:41:24,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:24,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:41:24,621 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:24,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:24,622 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-27 06:41:24,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:24,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846287006] [2019-12-27 06:41:24,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:41:24,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846287006] [2019-12-27 06:41:24,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:24,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:41:24,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834713790] [2019-12-27 06:41:24,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:41:24,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:24,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:41:24,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:41:24,768 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 4 states. [2019-12-27 06:41:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:24,813 INFO L93 Difference]: Finished difference Result 2163 states and 5380 transitions. [2019-12-27 06:41:24,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:41:24,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:41:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:24,817 INFO L225 Difference]: With dead ends: 2163 [2019-12-27 06:41:24,817 INFO L226 Difference]: Without dead ends: 1539 [2019-12-27 06:41:24,818 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 06:41:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-12-27 06:41:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1523. [2019-12-27 06:41:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-12-27 06:41:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 3383 transitions. [2019-12-27 06:41:24,941 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 3383 transitions. Word has length 16 [2019-12-27 06:41:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:24,941 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 3383 transitions. [2019-12-27 06:41:24,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:41:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 3383 transitions. [2019-12-27 06:41:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:41:24,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:24,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:41:24,943 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-27 06:41:24,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:24,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355433560] [2019-12-27 06:41:24,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:25,088 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 06:41:25,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355433560] [2019-12-27 06:41:25,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:25,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:41:25,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953126518] [2019-12-27 06:41:25,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:41:25,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:25,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:41:25,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:41:25,090 INFO L87 Difference]: Start difference. First operand 1523 states and 3383 transitions. Second operand 6 states. [2019-12-27 06:41:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:25,539 INFO L93 Difference]: Finished difference Result 2313 states and 4927 transitions. [2019-12-27 06:41:25,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:41:25,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 06:41:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:25,545 INFO L225 Difference]: With dead ends: 2313 [2019-12-27 06:41:25,546 INFO L226 Difference]: Without dead ends: 2260 [2019-12-27 06:41:25,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:41:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-12-27 06:41:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1600. [2019-12-27 06:41:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-27 06:41:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3528 transitions. [2019-12-27 06:41:25,584 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3528 transitions. Word has length 25 [2019-12-27 06:41:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:25,585 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 3528 transitions. [2019-12-27 06:41:25,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:41:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3528 transitions. [2019-12-27 06:41:25,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:41:25,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:25,588 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 06:41:25,588 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:25,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:25,589 INFO L82 PathProgramCache]: Analyzing trace with hash 607421545, now seen corresponding path program 1 times [2019-12-27 06:41:25,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:25,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079959091] [2019-12-27 06:41:25,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:25,725 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 06:41:25,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079959091] [2019-12-27 06:41:25,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:25,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:41:25,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654505781] [2019-12-27 06:41:25,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:41:25,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:25,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:41:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:41:25,727 INFO L87 Difference]: Start difference. First operand 1600 states and 3528 transitions. Second operand 5 states. [2019-12-27 06:41:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:26,166 INFO L93 Difference]: Finished difference Result 2343 states and 5072 transitions. [2019-12-27 06:41:26,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:41:26,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:41:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:26,173 INFO L225 Difference]: With dead ends: 2343 [2019-12-27 06:41:26,173 INFO L226 Difference]: Without dead ends: 2343 [2019-12-27 06:41:26,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:41:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-12-27 06:41:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2045. [2019-12-27 06:41:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-27 06:41:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4487 transitions. [2019-12-27 06:41:26,212 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4487 transitions. Word has length 26 [2019-12-27 06:41:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:26,213 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4487 transitions. [2019-12-27 06:41:26,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:41:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4487 transitions. [2019-12-27 06:41:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:41:26,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:26,216 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 06:41:26,216 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:26,217 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-27 06:41:26,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:26,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240462741] [2019-12-27 06:41:26,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:26,343 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 06:41:26,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240462741] [2019-12-27 06:41:26,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:26,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:41:26,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5121075] [2019-12-27 06:41:26,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:41:26,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:26,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:41:26,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:41:26,346 INFO L87 Difference]: Start difference. First operand 2045 states and 4487 transitions. Second operand 5 states. [2019-12-27 06:41:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:26,396 INFO L93 Difference]: Finished difference Result 1263 states and 2646 transitions. [2019-12-27 06:41:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:41:26,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 06:41:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:26,400 INFO L225 Difference]: With dead ends: 1263 [2019-12-27 06:41:26,400 INFO L226 Difference]: Without dead ends: 1144 [2019-12-27 06:41:26,400 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 06:41:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-27 06:41:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1055. [2019-12-27 06:41:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-12-27 06:41:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2231 transitions. [2019-12-27 06:41:26,419 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2231 transitions. Word has length 27 [2019-12-27 06:41:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:26,420 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 2231 transitions. [2019-12-27 06:41:26,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:41:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2231 transitions. [2019-12-27 06:41:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:41:26,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:26,429 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 06:41:26,429 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1622987432, now seen corresponding path program 1 times [2019-12-27 06:41:26,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:26,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520645590] [2019-12-27 06:41:26,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:26,550 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 06:41:26,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520645590] [2019-12-27 06:41:26,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:26,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:41:26,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132592870] [2019-12-27 06:41:26,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:41:26,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:26,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:41:26,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:41:26,552 INFO L87 Difference]: Start difference. First operand 1055 states and 2231 transitions. Second operand 7 states. [2019-12-27 06:41:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:26,893 INFO L93 Difference]: Finished difference Result 3013 states and 6181 transitions. [2019-12-27 06:41:26,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:41:26,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 06:41:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:26,899 INFO L225 Difference]: With dead ends: 3013 [2019-12-27 06:41:26,899 INFO L226 Difference]: Without dead ends: 2064 [2019-12-27 06:41:26,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:41:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-12-27 06:41:26,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1102. [2019-12-27 06:41:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-27 06:41:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2323 transitions. [2019-12-27 06:41:26,924 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2323 transitions. Word has length 51 [2019-12-27 06:41:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:26,925 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 2323 transitions. [2019-12-27 06:41:26,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:41:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2323 transitions. [2019-12-27 06:41:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:41:26,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:26,928 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 06:41:26,928 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:26,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:26,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2012209130, now seen corresponding path program 2 times [2019-12-27 06:41:26,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:26,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714064290] [2019-12-27 06:41:26,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:26,994 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 06:41:26,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714064290] [2019-12-27 06:41:26,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:26,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:41:26,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471724291] [2019-12-27 06:41:26,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:41:26,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:26,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:41:26,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:41:26,996 INFO L87 Difference]: Start difference. First operand 1102 states and 2323 transitions. Second operand 4 states. [2019-12-27 06:41:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:27,016 INFO L93 Difference]: Finished difference Result 1851 states and 3924 transitions. [2019-12-27 06:41:27,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:41:27,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-27 06:41:27,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:27,019 INFO L225 Difference]: With dead ends: 1851 [2019-12-27 06:41:27,019 INFO L226 Difference]: Without dead ends: 818 [2019-12-27 06:41:27,020 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 06:41:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-27 06:41:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2019-12-27 06:41:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-12-27 06:41:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1731 transitions. [2019-12-27 06:41:27,032 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1731 transitions. Word has length 51 [2019-12-27 06:41:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:27,033 INFO L462 AbstractCegarLoop]: Abstraction has 818 states and 1731 transitions. [2019-12-27 06:41:27,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:41:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1731 transitions. [2019-12-27 06:41:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:41:27,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:27,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:41:27,036 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:27,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:27,036 INFO L82 PathProgramCache]: Analyzing trace with hash -391470674, now seen corresponding path program 3 times [2019-12-27 06:41:27,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:27,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998062623] [2019-12-27 06:41:27,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:27,133 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 06:41:27,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998062623] [2019-12-27 06:41:27,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:27,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:41:27,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177588947] [2019-12-27 06:41:27,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:41:27,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:27,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:41:27,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:41:27,135 INFO L87 Difference]: Start difference. First operand 818 states and 1731 transitions. Second operand 7 states. [2019-12-27 06:41:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:27,323 INFO L93 Difference]: Finished difference Result 1396 states and 2860 transitions. [2019-12-27 06:41:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:41:27,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 06:41:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:27,327 INFO L225 Difference]: With dead ends: 1396 [2019-12-27 06:41:27,327 INFO L226 Difference]: Without dead ends: 948 [2019-12-27 06:41:27,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:41:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-27 06:41:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 794. [2019-12-27 06:41:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-12-27 06:41:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1681 transitions. [2019-12-27 06:41:27,341 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1681 transitions. Word has length 51 [2019-12-27 06:41:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:27,341 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1681 transitions. [2019-12-27 06:41:27,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:41:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1681 transitions. [2019-12-27 06:41:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:41:27,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:27,344 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 06:41:27,344 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:27,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash -167213104, now seen corresponding path program 4 times [2019-12-27 06:41:27,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:27,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600923669] [2019-12-27 06:41:27,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:27,413 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 06:41:27,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600923669] [2019-12-27 06:41:27,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:27,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:41:27,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870686844] [2019-12-27 06:41:27,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:41:27,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:27,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:41:27,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:41:27,415 INFO L87 Difference]: Start difference. First operand 794 states and 1681 transitions. Second operand 3 states. [2019-12-27 06:41:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:27,462 INFO L93 Difference]: Finished difference Result 1036 states and 2174 transitions. [2019-12-27 06:41:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:41:27,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 06:41:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:27,465 INFO L225 Difference]: With dead ends: 1036 [2019-12-27 06:41:27,465 INFO L226 Difference]: Without dead ends: 1036 [2019-12-27 06:41:27,465 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 06:41:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-12-27 06:41:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 840. [2019-12-27 06:41:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-27 06:41:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1784 transitions. [2019-12-27 06:41:27,480 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1784 transitions. Word has length 51 [2019-12-27 06:41:27,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:27,480 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1784 transitions. [2019-12-27 06:41:27,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:41:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1784 transitions. [2019-12-27 06:41:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:41:27,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:27,483 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 06:41:27,483 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1521738657, now seen corresponding path program 1 times [2019-12-27 06:41:27,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:27,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983777190] [2019-12-27 06:41:27,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:27,593 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 06:41:27,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983777190] [2019-12-27 06:41:27,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:27,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:41:27,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751879284] [2019-12-27 06:41:27,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:41:27,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:27,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:41:27,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:41:27,596 INFO L87 Difference]: Start difference. First operand 840 states and 1784 transitions. Second operand 6 states. [2019-12-27 06:41:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:28,073 INFO L93 Difference]: Finished difference Result 993 states and 2070 transitions. [2019-12-27 06:41:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:41:28,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 06:41:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:28,077 INFO L225 Difference]: With dead ends: 993 [2019-12-27 06:41:28,077 INFO L226 Difference]: Without dead ends: 993 [2019-12-27 06:41:28,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:41:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-12-27 06:41:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 900. [2019-12-27 06:41:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-27 06:41:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1900 transitions. [2019-12-27 06:41:28,092 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1900 transitions. Word has length 52 [2019-12-27 06:41:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:28,093 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1900 transitions. [2019-12-27 06:41:28,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:41:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1900 transitions. [2019-12-27 06:41:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:41:28,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:28,095 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 06:41:28,095 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:28,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1375799289, now seen corresponding path program 2 times [2019-12-27 06:41:28,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:28,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956915799] [2019-12-27 06:41:28,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:41:28,219 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 06:41:28,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956915799] [2019-12-27 06:41:28,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:41:28,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:41:28,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456956183] [2019-12-27 06:41:28,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:41:28,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:41:28,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:41:28,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:41:28,224 INFO L87 Difference]: Start difference. First operand 900 states and 1900 transitions. Second operand 3 states. [2019-12-27 06:41:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:41:28,239 INFO L93 Difference]: Finished difference Result 899 states and 1898 transitions. [2019-12-27 06:41:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:41:28,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:41:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:41:28,242 INFO L225 Difference]: With dead ends: 899 [2019-12-27 06:41:28,242 INFO L226 Difference]: Without dead ends: 899 [2019-12-27 06:41:28,242 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 06:41:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-12-27 06:41:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 743. [2019-12-27 06:41:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-12-27 06:41:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1605 transitions. [2019-12-27 06:41:28,255 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1605 transitions. Word has length 52 [2019-12-27 06:41:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:41:28,255 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1605 transitions. [2019-12-27 06:41:28,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:41:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1605 transitions. [2019-12-27 06:41:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:41:28,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:41:28,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:41:28,258 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:41:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:41:28,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-27 06:41:28,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:41:28,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370654338] [2019-12-27 06:41:28,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:41:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:41:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:41:28,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:41:28,445 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:41:28,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1289~0.base_24| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1289~0.base_24|)) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~y$mem_tmp~0_9) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1289~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1289~0.base_24|) |v_ULTIMATE.start_main_~#t1289~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd2~0_83 0) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= 0 |v_ULTIMATE.start_main_~#t1289~0.offset_19|) (= v_~y$w_buff0_used~0_106 0) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~y$r_buff1_thd2~0_52) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1289~0.base_24|) (= 0 v_~__unbuffered_p1_EAX~0_16) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1289~0.base_24| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~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_106, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ULTIMATE.start_main_~#t1289~0.offset=|v_ULTIMATE.start_main_~#t1289~0.offset_19|, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ULTIMATE.start_main_~#t1289~0.base=|v_ULTIMATE.start_main_~#t1289~0.base_24|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t1290~0.base=|v_ULTIMATE.start_main_~#t1290~0.base_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1290~0.offset=|v_ULTIMATE.start_main_~#t1290~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~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, ULTIMATE.start_main_~#t1289~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1289~0.base, ~y~0, ULTIMATE.start_main_~#t1290~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~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, ULTIMATE.start_main_~#t1290~0.offset, ~__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 06:41:28,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1290~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1290~0.base_13|) |v_ULTIMATE.start_main_~#t1290~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1290~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1290~0.base_13|) (= |v_ULTIMATE.start_main_~#t1290~0.offset_11| 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1290~0.base_13| 4)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1290~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1290~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1290~0.base=|v_ULTIMATE.start_main_~#t1290~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1290~0.offset=|v_ULTIMATE.start_main_~#t1290~0.offset_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1290~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1290~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 06:41:28,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-82093615 0)) (= ~y$r_buff1_thd0~0_Out-82093615 ~y$r_buff0_thd0~0_In-82093615) (= ~y$r_buff1_thd2~0_Out-82093615 ~y$r_buff0_thd2~0_In-82093615) (= ~y$r_buff0_thd1~0_In-82093615 ~y$r_buff1_thd1~0_Out-82093615) (= ~y$r_buff0_thd1~0_Out-82093615 1) (= ~x~0_In-82093615 ~__unbuffered_p0_EAX~0_Out-82093615)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-82093615, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-82093615, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-82093615, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-82093615, ~x~0=~x~0_In-82093615} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-82093615, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-82093615, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-82093615, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-82093615, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-82093615, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-82093615, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-82093615, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-82093615, ~x~0=~x~0_In-82093615} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:41:28,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1237712934 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1237712934 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1237712934| ~y$w_buff0_used~0_In1237712934) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1237712934| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1237712934, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1237712934} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1237712934|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1237712934, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1237712934} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:41:28,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In927166891 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out927166891| |P1Thread1of1ForFork1_#t~ite20_Out927166891|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In927166891 256)))) (or (= (mod ~y$w_buff0_used~0_In927166891 256) 0) (and .cse0 (= (mod ~y$w_buff1_used~0_In927166891 256) 0)) (and (= 0 (mod ~y$r_buff1_thd2~0_In927166891 256)) .cse0))) (= |P1Thread1of1ForFork1_#t~ite20_Out927166891| ~y$w_buff0_used~0_In927166891) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite21_Out927166891| ~y$w_buff0_used~0_In927166891) (= |P1Thread1of1ForFork1_#t~ite20_In927166891| |P1Thread1of1ForFork1_#t~ite20_Out927166891|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In927166891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In927166891, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In927166891|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In927166891, ~weak$$choice2~0=~weak$$choice2~0_In927166891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In927166891} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In927166891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In927166891, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out927166891|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In927166891, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out927166891|, ~weak$$choice2~0=~weak$$choice2~0_In927166891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In927166891} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 06:41:28,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1726486106 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1726486106 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1726486106 256))) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-1726486106 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-1726486106 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1726486106| |P1Thread1of1ForFork1_#t~ite24_Out-1726486106|))) (or (let ((.cse2 (not .cse6))) (and .cse0 (not .cse1) (or .cse2 (not .cse3)) (or (not .cse4) .cse2) (= |P1Thread1of1ForFork1_#t~ite22_Out-1726486106| 0) (= |P1Thread1of1ForFork1_#t~ite23_Out-1726486106| |P1Thread1of1ForFork1_#t~ite22_Out-1726486106|) .cse5)) (and (= |P1Thread1of1ForFork1_#t~ite22_In-1726486106| |P1Thread1of1ForFork1_#t~ite22_Out-1726486106|) (or (and (= ~y$w_buff1_used~0_In-1726486106 |P1Thread1of1ForFork1_#t~ite24_Out-1726486106|) (= |P1Thread1of1ForFork1_#t~ite23_Out-1726486106| |P1Thread1of1ForFork1_#t~ite23_In-1726486106|) (not .cse0)) (and .cse0 (or (and .cse6 .cse3) .cse1 (and .cse4 .cse6)) (= |P1Thread1of1ForFork1_#t~ite23_Out-1726486106| ~y$w_buff1_used~0_In-1726486106) .cse5))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1726486106, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1726486106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1726486106, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1726486106|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1726486106|, ~weak$$choice2~0=~weak$$choice2~0_In-1726486106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1726486106} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1726486106, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1726486106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1726486106, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1726486106|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1726486106|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1726486106|, ~weak$$choice2~0=~weak$$choice2~0_In-1726486106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1726486106} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 06:41:28,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 06:41:28,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In539797626 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In539797626 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In539797626 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In539797626 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out539797626|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In539797626 |P0Thread1of1ForFork0_#t~ite6_Out539797626|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In539797626, ~y$w_buff0_used~0=~y$w_buff0_used~0_In539797626, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In539797626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In539797626} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out539797626|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In539797626, ~y$w_buff0_used~0=~y$w_buff0_used~0_In539797626, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In539797626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In539797626} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:41:28,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In65996921 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In65996921 256)))) (or (and (= ~y$r_buff0_thd1~0_Out65996921 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out65996921 ~y$r_buff0_thd1~0_In65996921)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In65996921, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In65996921} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In65996921, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out65996921|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out65996921} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:41:28,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1314369236 256))) (.cse0 (= (mod ~weak$$choice2~0_In1314369236 256) 0)) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In1314369236 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite30_Out1314369236| |P1Thread1of1ForFork1_#t~ite29_Out1314369236|)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1314369236 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1314369236 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In1314369236| |P1Thread1of1ForFork1_#t~ite28_Out1314369236|) (or (and .cse0 (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse5 (= |P1Thread1of1ForFork1_#t~ite29_Out1314369236| ~y$r_buff1_thd2~0_In1314369236)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out1314369236| ~y$r_buff1_thd2~0_In1314369236) (= |P1Thread1of1ForFork1_#t~ite29_Out1314369236| |P1Thread1of1ForFork1_#t~ite29_In1314369236|) (not .cse0)))) (let ((.cse6 (not .cse2))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1314369236| |P1Thread1of1ForFork1_#t~ite28_Out1314369236|) (or .cse6 (not .cse1)) .cse0 (or (not .cse4) .cse6) .cse5 (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1314369236|) (not .cse3))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1314369236, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1314369236|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1314369236, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1314369236, ~weak$$choice2~0=~weak$$choice2~0_In1314369236, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1314369236|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1314369236} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1314369236, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1314369236|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1314369236|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1314369236, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1314369236, ~weak$$choice2~0=~weak$$choice2~0_In1314369236, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1314369236|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1314369236} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 06:41:28,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In816756047 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In816756047 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In816756047 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In816756047 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In816756047 |P0Thread1of1ForFork0_#t~ite8_Out816756047|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out816756047|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In816756047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In816756047, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In816756047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In816756047} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In816756047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In816756047, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out816756047|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In816756047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In816756047} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:41:28,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 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_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 06:41:28,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In263962351 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In263962351 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In263962351 |P1Thread1of1ForFork1_#t~ite32_Out263962351|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out263962351| ~y~0_In263962351)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In263962351, ~y$w_buff1~0=~y$w_buff1~0_In263962351, ~y~0=~y~0_In263962351, ~y$w_buff1_used~0=~y$w_buff1_used~0_In263962351} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In263962351, ~y$w_buff1~0=~y$w_buff1~0_In263962351, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out263962351|, ~y~0=~y~0_In263962351, ~y$w_buff1_used~0=~y$w_buff1_used~0_In263962351} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 06:41:28,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 06:41:28,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2052932237 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2052932237 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2052932237|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2052932237 |P1Thread1of1ForFork1_#t~ite34_Out-2052932237|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2052932237, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2052932237} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2052932237, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2052932237, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2052932237|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 06:41:28,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-846187184 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-846187184 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-846187184 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-846187184 256) 0))) (or (and (= ~y$w_buff1_used~0_In-846187184 |P1Thread1of1ForFork1_#t~ite35_Out-846187184|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-846187184| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-846187184, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-846187184, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-846187184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-846187184} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-846187184, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-846187184, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-846187184, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-846187184|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-846187184} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 06:41:28,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2088314378 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2088314378 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out2088314378| ~y$r_buff0_thd2~0_In2088314378)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out2088314378| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2088314378, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2088314378} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2088314378, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2088314378, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2088314378|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 06:41:28,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-178459319 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-178459319 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-178459319 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-178459319 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-178459319 |P1Thread1of1ForFork1_#t~ite37_Out-178459319|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-178459319|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-178459319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-178459319, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-178459319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-178459319} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-178459319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-178459319, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-178459319, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-178459319|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-178459319} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:41:28,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} 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 06:41:28,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} 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 06:41:28,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:41:28,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In2147230897 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2147230897 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out2147230897| ~y$w_buff1~0_In2147230897) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2147230897| ~y~0_In2147230897)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2147230897, ~y~0=~y~0_In2147230897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2147230897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2147230897} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2147230897|, ~y$w_buff1~0=~y$w_buff1~0_In2147230897, ~y~0=~y~0_In2147230897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2147230897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2147230897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:41:28,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 06:41:28,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In947085904 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In947085904 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In947085904 |ULTIMATE.start_main_#t~ite42_Out947085904|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out947085904|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In947085904, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In947085904} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In947085904, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In947085904, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out947085904|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:41:28,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1110053219 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1110053219 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1110053219 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1110053219 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1110053219 |ULTIMATE.start_main_#t~ite43_Out-1110053219|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1110053219|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110053219, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1110053219, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1110053219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110053219} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110053219, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1110053219, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1110053219|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1110053219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110053219} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 06:41:28,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1122650421 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1122650421 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1122650421|)) (and (= ~y$r_buff0_thd0~0_In-1122650421 |ULTIMATE.start_main_#t~ite44_Out-1122650421|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1122650421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1122650421} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1122650421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1122650421, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1122650421|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:41:28,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1154166624 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1154166624 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1154166624 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1154166624 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1154166624| ~y$r_buff1_thd0~0_In-1154166624) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1154166624| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154166624, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1154166624, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1154166624, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1154166624} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154166624, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1154166624, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1154166624, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1154166624|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1154166624} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:41:28,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EAX~0_8) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 06:41:28,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:41:28 BasicIcfg [2019-12-27 06:41:28,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:41:28,534 INFO L168 Benchmark]: Toolchain (without parser) took 13386.06 ms. Allocated memory was 144.2 MB in the beginning and 486.5 MB in the end (delta: 342.4 MB). Free memory was 98.9 MB in the beginning and 363.9 MB in the end (delta: -265.0 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:41:28,535 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:41:28,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.74 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.7 MB in the beginning and 155.5 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:41:28,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.02 ms. Allocated memory is still 201.3 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:41:28,537 INFO L168 Benchmark]: Boogie Preprocessor took 52.29 ms. Allocated memory is still 201.3 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:41:28,537 INFO L168 Benchmark]: RCFGBuilder took 765.47 ms. Allocated memory is still 201.3 MB. Free memory was 150.7 MB in the beginning and 106.3 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:41:28,538 INFO L168 Benchmark]: TraceAbstraction took 11724.37 ms. Allocated memory was 201.3 MB in the beginning and 486.5 MB in the end (delta: 285.2 MB). Free memory was 106.3 MB in the beginning and 363.9 MB in the end (delta: -257.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:41:28,542 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.15 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.74 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.7 MB in the beginning and 155.5 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.02 ms. Allocated memory is still 201.3 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.29 ms. Allocated memory is still 201.3 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 765.47 ms. Allocated memory is still 201.3 MB. Free memory was 150.7 MB in the beginning and 106.3 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11724.37 ms. Allocated memory was 201.3 MB in the beginning and 486.5 MB in the end (delta: 285.2 MB). Free memory was 106.3 MB in the beginning and 363.9 MB in the end (delta: -257.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 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(&t1289, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t1290, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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=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 x = 1 [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_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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)) [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [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_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1676 SDtfs, 1855 SDslu, 3506 SDs, 0 SdLazy, 1852 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11080occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 6943 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 50459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...