/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/mix026_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:52:41,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:52:41,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:52:41,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:52:41,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:52:41,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:52:41,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:52:41,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:52:41,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:52:41,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:52:41,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:52:41,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:52:41,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:52:41,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:52:41,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:52:41,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:52:41,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:52:41,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:52:41,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:52:41,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:52:41,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:52:41,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:52:41,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:52:41,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:52:41,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:52:41,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:52:41,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:52:41,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:52:41,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:52:41,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:52:41,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:52:41,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:52:41,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:52:41,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:52:41,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:52:41,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:52:41,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:52:41,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:52:41,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:52:41,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:52:41,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:52:41,896 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-18 20:52:41,912 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:52:41,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:52:41,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:52:41,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:52:41,914 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:52:41,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:52:41,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:52:41,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:52:41,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:52:41,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:52:41,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:52:41,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:52:41,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:52:41,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:52:41,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:52:41,916 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:52:41,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:52:41,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:52:41,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:52:41,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:52:41,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:52:41,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:52:41,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:52:41,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:52:41,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:52:41,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:52:41,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:52:41,919 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:52:41,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:52:41,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:52:42,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:52:42,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:52:42,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:52:42,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:52:42,255 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:52:42,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_rmo.opt.i [2019-12-18 20:52:42,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158bd2b1d/27aa857ec63d43c1975a047ce7e97e44/FLAG23fc5e974 [2019-12-18 20:52:42,930 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:52:42,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_rmo.opt.i [2019-12-18 20:52:42,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158bd2b1d/27aa857ec63d43c1975a047ce7e97e44/FLAG23fc5e974 [2019-12-18 20:52:43,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158bd2b1d/27aa857ec63d43c1975a047ce7e97e44 [2019-12-18 20:52:43,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:52:43,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:52:43,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:52:43,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:52:43,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:52:43,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:43,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@500bc0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43, skipping insertion in model container [2019-12-18 20:52:43,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:43,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:52:43,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:52:43,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:52:43,832 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:52:43,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:52:43,990 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:52:43,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43 WrapperNode [2019-12-18 20:52:43,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:52:43,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:52:43,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:52:43,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:52:44,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:44,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:44,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:52:44,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:52:44,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:52:44,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:52:44,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:44,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:44,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:44,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:44,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:44,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:44,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (1/1) ... [2019-12-18 20:52:44,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:52:44,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:52:44,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:52:44,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:52:44,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:52:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:52:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:52:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:52:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:52:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:52:44,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:52:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:52:44,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:52:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:52:44,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:52:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 20:52:44,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 20:52:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:52:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:52:44,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:52:44,183 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:52:44,942 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:52:44,943 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:52:44,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:52:44 BoogieIcfgContainer [2019-12-18 20:52:44,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:52:44,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:52:44,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:52:44,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:52:44,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:52:43" (1/3) ... [2019-12-18 20:52:44,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764471ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:52:44, skipping insertion in model container [2019-12-18 20:52:44,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:43" (2/3) ... [2019-12-18 20:52:44,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764471ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:52:44, skipping insertion in model container [2019-12-18 20:52:44,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:52:44" (3/3) ... [2019-12-18 20:52:44,958 INFO L109 eAbstractionObserver]: Analyzing ICFG mix026_rmo.opt.i [2019-12-18 20:52:44,969 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:52:44,969 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:52:44,976 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:52:44,977 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:52:45,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,018 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,018 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,022 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,045 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,046 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,046 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,046 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,047 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,054 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,054 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,071 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,072 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,074 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,074 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,078 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,083 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,084 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,085 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,099 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,105 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:45,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 20:52:45,137 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:52:45,137 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:52:45,138 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:52:45,138 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:52:45,138 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:52:45,138 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:52:45,138 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:52:45,138 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:52:45,156 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 20:52:45,158 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 20:52:45,244 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 20:52:45,244 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:52:45,263 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:52:45,295 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 20:52:45,389 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 20:52:45,391 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:52:45,400 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:52:45,421 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 20:52:45,422 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:52:49,392 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 20:52:49,550 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 20:52:49,573 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68785 [2019-12-18 20:52:49,573 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 20:52:49,577 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 94 transitions [2019-12-18 20:53:26,882 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171512 states. [2019-12-18 20:53:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 171512 states. [2019-12-18 20:53:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:53:26,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:53:26,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:53:26,892 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:53:26,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:53:26,899 INFO L82 PathProgramCache]: Analyzing trace with hash 411952807, now seen corresponding path program 1 times [2019-12-18 20:53:26,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:53:26,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083850202] [2019-12-18 20:53:26,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:53:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:53:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:53:27,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083850202] [2019-12-18 20:53:27,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:53:27,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:53:27,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325884821] [2019-12-18 20:53:27,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:53:27,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:53:27,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:53:27,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:53:27,186 INFO L87 Difference]: Start difference. First operand 171512 states. Second operand 3 states. [2019-12-18 20:53:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:53:29,611 INFO L93 Difference]: Finished difference Result 168024 states and 799121 transitions. [2019-12-18 20:53:29,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:53:29,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:53:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:53:35,548 INFO L225 Difference]: With dead ends: 168024 [2019-12-18 20:53:35,548 INFO L226 Difference]: Without dead ends: 158222 [2019-12-18 20:53:35,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:53:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158222 states. [2019-12-18 20:53:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158222 to 158222. [2019-12-18 20:53:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158222 states. [2019-12-18 20:53:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158222 states to 158222 states and 751554 transitions. [2019-12-18 20:53:47,694 INFO L78 Accepts]: Start accepts. Automaton has 158222 states and 751554 transitions. Word has length 7 [2019-12-18 20:53:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:53:47,695 INFO L462 AbstractCegarLoop]: Abstraction has 158222 states and 751554 transitions. [2019-12-18 20:53:47,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:53:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 158222 states and 751554 transitions. [2019-12-18 20:53:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:53:47,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:53:47,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:53:47,706 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:53:47,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:53:47,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1837496969, now seen corresponding path program 1 times [2019-12-18 20:53:47,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:53:47,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081530022] [2019-12-18 20:53:47,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:53:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:53:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:53:47,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081530022] [2019-12-18 20:53:47,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:53:47,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:53:47,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536599487] [2019-12-18 20:53:47,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:53:47,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:53:47,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:53:47,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:53:47,842 INFO L87 Difference]: Start difference. First operand 158222 states and 751554 transitions. Second operand 4 states. [2019-12-18 20:53:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:53:55,363 INFO L93 Difference]: Finished difference Result 247350 states and 1127352 transitions. [2019-12-18 20:53:55,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:53:55,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 20:53:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:53:57,493 INFO L225 Difference]: With dead ends: 247350 [2019-12-18 20:53:57,493 INFO L226 Difference]: Without dead ends: 247168 [2019-12-18 20:53:57,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247168 states. [2019-12-18 20:54:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247168 to 227148. [2019-12-18 20:54:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227148 states. [2019-12-18 20:54:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227148 states to 227148 states and 1045761 transitions. [2019-12-18 20:54:18,743 INFO L78 Accepts]: Start accepts. Automaton has 227148 states and 1045761 transitions. Word has length 15 [2019-12-18 20:54:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:18,743 INFO L462 AbstractCegarLoop]: Abstraction has 227148 states and 1045761 transitions. [2019-12-18 20:54:18,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:54:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 227148 states and 1045761 transitions. [2019-12-18 20:54:18,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:54:18,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:18,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:54:18,748 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:18,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:18,749 INFO L82 PathProgramCache]: Analyzing trace with hash -372809848, now seen corresponding path program 1 times [2019-12-18 20:54:18,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:18,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41752674] [2019-12-18 20:54:18,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:18,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41752674] [2019-12-18 20:54:18,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:18,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:54:18,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119638056] [2019-12-18 20:54:18,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:54:18,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:18,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:54:18,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:18,839 INFO L87 Difference]: Start difference. First operand 227148 states and 1045761 transitions. Second operand 3 states. [2019-12-18 20:54:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:27,468 INFO L93 Difference]: Finished difference Result 141425 states and 586615 transitions. [2019-12-18 20:54:27,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:54:27,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 20:54:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:27,902 INFO L225 Difference]: With dead ends: 141425 [2019-12-18 20:54:27,902 INFO L226 Difference]: Without dead ends: 141425 [2019-12-18 20:54:27,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:31,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141425 states. [2019-12-18 20:54:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141425 to 141425. [2019-12-18 20:54:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141425 states. [2019-12-18 20:54:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141425 states to 141425 states and 586615 transitions. [2019-12-18 20:54:34,634 INFO L78 Accepts]: Start accepts. Automaton has 141425 states and 586615 transitions. Word has length 15 [2019-12-18 20:54:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:34,634 INFO L462 AbstractCegarLoop]: Abstraction has 141425 states and 586615 transitions. [2019-12-18 20:54:34,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:54:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 141425 states and 586615 transitions. [2019-12-18 20:54:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:54:34,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:34,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:54:34,639 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:34,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:34,640 INFO L82 PathProgramCache]: Analyzing trace with hash -728396216, now seen corresponding path program 1 times [2019-12-18 20:54:34,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:34,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125393733] [2019-12-18 20:54:34,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:34,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125393733] [2019-12-18 20:54:34,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:34,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:54:34,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789726759] [2019-12-18 20:54:34,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:54:34,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:54:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:54:34,731 INFO L87 Difference]: Start difference. First operand 141425 states and 586615 transitions. Second operand 4 states. [2019-12-18 20:54:34,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:34,925 INFO L93 Difference]: Finished difference Result 38183 states and 134511 transitions. [2019-12-18 20:54:34,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:54:34,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:54:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:34,998 INFO L225 Difference]: With dead ends: 38183 [2019-12-18 20:54:34,998 INFO L226 Difference]: Without dead ends: 38183 [2019-12-18 20:54:34,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:54:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38183 states. [2019-12-18 20:54:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38183 to 38183. [2019-12-18 20:54:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38183 states. [2019-12-18 20:54:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38183 states to 38183 states and 134511 transitions. [2019-12-18 20:54:40,542 INFO L78 Accepts]: Start accepts. Automaton has 38183 states and 134511 transitions. Word has length 16 [2019-12-18 20:54:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:40,542 INFO L462 AbstractCegarLoop]: Abstraction has 38183 states and 134511 transitions. [2019-12-18 20:54:40,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:54:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 38183 states and 134511 transitions. [2019-12-18 20:54:40,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:54:40,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:40,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:54:40,546 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:40,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash 539668976, now seen corresponding path program 1 times [2019-12-18 20:54:40,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:40,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029021259] [2019-12-18 20:54:40,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:40,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029021259] [2019-12-18 20:54:40,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:40,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:54:40,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603060564] [2019-12-18 20:54:40,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:54:40,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:40,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:54:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:40,628 INFO L87 Difference]: Start difference. First operand 38183 states and 134511 transitions. Second operand 5 states. [2019-12-18 20:54:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:41,226 INFO L93 Difference]: Finished difference Result 53681 states and 185843 transitions. [2019-12-18 20:54:41,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:54:41,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 20:54:41,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:41,331 INFO L225 Difference]: With dead ends: 53681 [2019-12-18 20:54:41,331 INFO L226 Difference]: Without dead ends: 53665 [2019-12-18 20:54:41,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53665 states. [2019-12-18 20:54:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53665 to 41924. [2019-12-18 20:54:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41924 states. [2019-12-18 20:54:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41924 states to 41924 states and 147192 transitions. [2019-12-18 20:54:42,636 INFO L78 Accepts]: Start accepts. Automaton has 41924 states and 147192 transitions. Word has length 16 [2019-12-18 20:54:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:42,636 INFO L462 AbstractCegarLoop]: Abstraction has 41924 states and 147192 transitions. [2019-12-18 20:54:42,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:54:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 41924 states and 147192 transitions. [2019-12-18 20:54:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:54:42,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:42,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:54:42,653 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1532269358, now seen corresponding path program 1 times [2019-12-18 20:54:42,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:42,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450132360] [2019-12-18 20:54:42,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:42,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450132360] [2019-12-18 20:54:42,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:42,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:54:42,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260670697] [2019-12-18 20:54:42,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:54:42,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:42,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:54:42,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:54:42,754 INFO L87 Difference]: Start difference. First operand 41924 states and 147192 transitions. Second operand 6 states. [2019-12-18 20:54:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:43,866 INFO L93 Difference]: Finished difference Result 63881 states and 218393 transitions. [2019-12-18 20:54:43,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:54:43,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 20:54:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:43,993 INFO L225 Difference]: With dead ends: 63881 [2019-12-18 20:54:43,993 INFO L226 Difference]: Without dead ends: 63853 [2019-12-18 20:54:43,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:54:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63853 states. [2019-12-18 20:54:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63853 to 43646. [2019-12-18 20:54:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43646 states. [2019-12-18 20:54:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43646 states to 43646 states and 152050 transitions. [2019-12-18 20:54:45,506 INFO L78 Accepts]: Start accepts. Automaton has 43646 states and 152050 transitions. Word has length 24 [2019-12-18 20:54:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:45,506 INFO L462 AbstractCegarLoop]: Abstraction has 43646 states and 152050 transitions. [2019-12-18 20:54:45,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:54:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 43646 states and 152050 transitions. [2019-12-18 20:54:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:54:45,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:45,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:54:45,528 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:45,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1695567288, now seen corresponding path program 1 times [2019-12-18 20:54:45,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:45,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334223446] [2019-12-18 20:54:45,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:45,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334223446] [2019-12-18 20:54:45,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:45,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:54:45,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555951190] [2019-12-18 20:54:45,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:54:45,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:45,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:54:45,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:45,612 INFO L87 Difference]: Start difference. First operand 43646 states and 152050 transitions. Second operand 5 states. [2019-12-18 20:54:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:45,748 INFO L93 Difference]: Finished difference Result 22336 states and 78762 transitions. [2019-12-18 20:54:45,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:54:45,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:54:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:45,794 INFO L225 Difference]: With dead ends: 22336 [2019-12-18 20:54:45,794 INFO L226 Difference]: Without dead ends: 22336 [2019-12-18 20:54:45,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22336 states. [2019-12-18 20:54:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22336 to 22144. [2019-12-18 20:54:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22144 states. [2019-12-18 20:54:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22144 states to 22144 states and 78106 transitions. [2019-12-18 20:54:46,183 INFO L78 Accepts]: Start accepts. Automaton has 22144 states and 78106 transitions. Word has length 28 [2019-12-18 20:54:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:46,183 INFO L462 AbstractCegarLoop]: Abstraction has 22144 states and 78106 transitions. [2019-12-18 20:54:46,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:54:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 22144 states and 78106 transitions. [2019-12-18 20:54:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:54:46,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:46,223 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] [2019-12-18 20:54:46,224 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:46,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1310501217, now seen corresponding path program 1 times [2019-12-18 20:54:46,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:46,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497253030] [2019-12-18 20:54:46,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:46,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497253030] [2019-12-18 20:54:46,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:46,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:54:46,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599307867] [2019-12-18 20:54:46,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:54:46,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:46,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:54:46,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:54:46,307 INFO L87 Difference]: Start difference. First operand 22144 states and 78106 transitions. Second operand 4 states. [2019-12-18 20:54:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:46,442 INFO L93 Difference]: Finished difference Result 32187 states and 108348 transitions. [2019-12-18 20:54:46,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:54:46,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 20:54:46,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:46,486 INFO L225 Difference]: With dead ends: 32187 [2019-12-18 20:54:46,486 INFO L226 Difference]: Without dead ends: 22530 [2019-12-18 20:54:46,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2019-12-18 20:54:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 22434. [2019-12-18 20:54:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22434 states. [2019-12-18 20:54:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22434 states to 22434 states and 78130 transitions. [2019-12-18 20:54:46,854 INFO L78 Accepts]: Start accepts. Automaton has 22434 states and 78130 transitions. Word has length 42 [2019-12-18 20:54:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:46,855 INFO L462 AbstractCegarLoop]: Abstraction has 22434 states and 78130 transitions. [2019-12-18 20:54:46,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:54:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 22434 states and 78130 transitions. [2019-12-18 20:54:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:54:46,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:46,892 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] [2019-12-18 20:54:46,892 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:46,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:46,892 INFO L82 PathProgramCache]: Analyzing trace with hash 475291737, now seen corresponding path program 2 times [2019-12-18 20:54:46,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:46,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683855328] [2019-12-18 20:54:46,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:46,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683855328] [2019-12-18 20:54:46,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:46,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:54:46,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910791669] [2019-12-18 20:54:46,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:54:46,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:54:46,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:54:46,979 INFO L87 Difference]: Start difference. First operand 22434 states and 78130 transitions. Second operand 6 states. [2019-12-18 20:54:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:47,099 INFO L93 Difference]: Finished difference Result 21088 states and 74746 transitions. [2019-12-18 20:54:47,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:54:47,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 20:54:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:47,390 INFO L225 Difference]: With dead ends: 21088 [2019-12-18 20:54:47,390 INFO L226 Difference]: Without dead ends: 19247 [2019-12-18 20:54:47,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:54:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19247 states. [2019-12-18 20:54:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19247 to 18567. [2019-12-18 20:54:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18567 states. [2019-12-18 20:54:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18567 states to 18567 states and 65935 transitions. [2019-12-18 20:54:47,722 INFO L78 Accepts]: Start accepts. Automaton has 18567 states and 65935 transitions. Word has length 42 [2019-12-18 20:54:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:47,722 INFO L462 AbstractCegarLoop]: Abstraction has 18567 states and 65935 transitions. [2019-12-18 20:54:47,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:54:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 18567 states and 65935 transitions. [2019-12-18 20:54:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:47,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:47,748 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, 1, 1, 1, 1] [2019-12-18 20:54:47,748 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:47,748 INFO L82 PathProgramCache]: Analyzing trace with hash 373515264, now seen corresponding path program 1 times [2019-12-18 20:54:47,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:47,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774345019] [2019-12-18 20:54:47,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:47,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774345019] [2019-12-18 20:54:47,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:47,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:54:47,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372629540] [2019-12-18 20:54:47,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:54:47,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:47,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:54:47,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:47,809 INFO L87 Difference]: Start difference. First operand 18567 states and 65935 transitions. Second operand 3 states. [2019-12-18 20:54:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:48,016 INFO L93 Difference]: Finished difference Result 26853 states and 95284 transitions. [2019-12-18 20:54:48,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:54:48,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:54:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:48,093 INFO L225 Difference]: With dead ends: 26853 [2019-12-18 20:54:48,093 INFO L226 Difference]: Without dead ends: 26853 [2019-12-18 20:54:48,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26853 states. [2019-12-18 20:54:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26853 to 21611. [2019-12-18 20:54:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21611 states. [2019-12-18 20:54:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21611 states to 21611 states and 77458 transitions. [2019-12-18 20:54:48,582 INFO L78 Accepts]: Start accepts. Automaton has 21611 states and 77458 transitions. Word has length 57 [2019-12-18 20:54:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:48,582 INFO L462 AbstractCegarLoop]: Abstraction has 21611 states and 77458 transitions. [2019-12-18 20:54:48,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:54:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21611 states and 77458 transitions. [2019-12-18 20:54:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:48,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:48,613 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, 1, 1, 1, 1] [2019-12-18 20:54:48,614 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:48,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash 930260188, now seen corresponding path program 1 times [2019-12-18 20:54:48,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:48,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67370554] [2019-12-18 20:54:48,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:48,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67370554] [2019-12-18 20:54:48,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:48,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:54:48,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318207904] [2019-12-18 20:54:48,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:54:48,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:48,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:54:48,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:54:48,701 INFO L87 Difference]: Start difference. First operand 21611 states and 77458 transitions. Second operand 4 states. [2019-12-18 20:54:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:48,833 INFO L93 Difference]: Finished difference Result 31189 states and 107436 transitions. [2019-12-18 20:54:48,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:54:48,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 20:54:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:48,849 INFO L225 Difference]: With dead ends: 31189 [2019-12-18 20:54:48,849 INFO L226 Difference]: Without dead ends: 10129 [2019-12-18 20:54:48,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10129 states. [2019-12-18 20:54:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10129 to 10129. [2019-12-18 20:54:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10129 states. [2019-12-18 20:54:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10129 states to 10129 states and 31537 transitions. [2019-12-18 20:54:49,000 INFO L78 Accepts]: Start accepts. Automaton has 10129 states and 31537 transitions. Word has length 57 [2019-12-18 20:54:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:49,000 INFO L462 AbstractCegarLoop]: Abstraction has 10129 states and 31537 transitions. [2019-12-18 20:54:49,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:54:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 10129 states and 31537 transitions. [2019-12-18 20:54:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:49,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:49,014 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, 1, 1, 1, 1] [2019-12-18 20:54:49,015 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1206429816, now seen corresponding path program 2 times [2019-12-18 20:54:49,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:49,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583112934] [2019-12-18 20:54:49,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:49,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583112934] [2019-12-18 20:54:49,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:49,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:54:49,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794413883] [2019-12-18 20:54:49,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:54:49,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:49,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:54:49,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:49,116 INFO L87 Difference]: Start difference. First operand 10129 states and 31537 transitions. Second operand 7 states. [2019-12-18 20:54:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:49,788 INFO L93 Difference]: Finished difference Result 27931 states and 86889 transitions. [2019-12-18 20:54:49,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:54:49,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:54:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:49,832 INFO L225 Difference]: With dead ends: 27931 [2019-12-18 20:54:49,832 INFO L226 Difference]: Without dead ends: 21447 [2019-12-18 20:54:49,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:54:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21447 states. [2019-12-18 20:54:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21447 to 12717. [2019-12-18 20:54:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12717 states. [2019-12-18 20:54:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12717 states to 12717 states and 39912 transitions. [2019-12-18 20:54:50,123 INFO L78 Accepts]: Start accepts. Automaton has 12717 states and 39912 transitions. Word has length 57 [2019-12-18 20:54:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:50,123 INFO L462 AbstractCegarLoop]: Abstraction has 12717 states and 39912 transitions. [2019-12-18 20:54:50,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:54:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 12717 states and 39912 transitions. [2019-12-18 20:54:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:50,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:50,137 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, 1, 1, 1, 1] [2019-12-18 20:54:50,138 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash 460584032, now seen corresponding path program 3 times [2019-12-18 20:54:50,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:50,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174883476] [2019-12-18 20:54:50,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:50,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174883476] [2019-12-18 20:54:50,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:50,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:54:50,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195213018] [2019-12-18 20:54:50,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:54:50,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:50,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:54:50,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:50,242 INFO L87 Difference]: Start difference. First operand 12717 states and 39912 transitions. Second operand 7 states. [2019-12-18 20:54:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:50,737 INFO L93 Difference]: Finished difference Result 35659 states and 109974 transitions. [2019-12-18 20:54:50,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 20:54:50,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:54:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:50,792 INFO L225 Difference]: With dead ends: 35659 [2019-12-18 20:54:50,792 INFO L226 Difference]: Without dead ends: 25590 [2019-12-18 20:54:50,793 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-18 20:54:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25590 states. [2019-12-18 20:54:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25590 to 15749. [2019-12-18 20:54:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15749 states. [2019-12-18 20:54:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15749 states to 15749 states and 49454 transitions. [2019-12-18 20:54:51,135 INFO L78 Accepts]: Start accepts. Automaton has 15749 states and 49454 transitions. Word has length 57 [2019-12-18 20:54:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:51,136 INFO L462 AbstractCegarLoop]: Abstraction has 15749 states and 49454 transitions. [2019-12-18 20:54:51,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:54:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 15749 states and 49454 transitions. [2019-12-18 20:54:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:51,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:51,153 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, 1, 1, 1, 1] [2019-12-18 20:54:51,153 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:51,154 INFO L82 PathProgramCache]: Analyzing trace with hash -188593524, now seen corresponding path program 4 times [2019-12-18 20:54:51,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:51,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789033119] [2019-12-18 20:54:51,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:51,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789033119] [2019-12-18 20:54:51,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:51,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:54:51,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337210306] [2019-12-18 20:54:51,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:54:51,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:51,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:54:51,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:51,263 INFO L87 Difference]: Start difference. First operand 15749 states and 49454 transitions. Second operand 7 states. [2019-12-18 20:54:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:51,652 INFO L93 Difference]: Finished difference Result 32420 states and 99279 transitions. [2019-12-18 20:54:51,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:54:51,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:54:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:51,693 INFO L225 Difference]: With dead ends: 32420 [2019-12-18 20:54:51,693 INFO L226 Difference]: Without dead ends: 27334 [2019-12-18 20:54:51,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:54:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27334 states. [2019-12-18 20:54:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27334 to 15959. [2019-12-18 20:54:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15959 states. [2019-12-18 20:54:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15959 states to 15959 states and 50041 transitions. [2019-12-18 20:54:52,028 INFO L78 Accepts]: Start accepts. Automaton has 15959 states and 50041 transitions. Word has length 57 [2019-12-18 20:54:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:52,028 INFO L462 AbstractCegarLoop]: Abstraction has 15959 states and 50041 transitions. [2019-12-18 20:54:52,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:54:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 15959 states and 50041 transitions. [2019-12-18 20:54:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:52,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:52,046 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, 1, 1, 1, 1] [2019-12-18 20:54:52,046 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1662940808, now seen corresponding path program 5 times [2019-12-18 20:54:52,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:52,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335295743] [2019-12-18 20:54:52,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:52,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335295743] [2019-12-18 20:54:52,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:52,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:54:52,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759810929] [2019-12-18 20:54:52,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:54:52,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:52,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:54:52,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:52,172 INFO L87 Difference]: Start difference. First operand 15959 states and 50041 transitions. Second operand 7 states. [2019-12-18 20:54:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:53,498 INFO L93 Difference]: Finished difference Result 26759 states and 80444 transitions. [2019-12-18 20:54:53,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:54:53,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:54:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:53,537 INFO L225 Difference]: With dead ends: 26759 [2019-12-18 20:54:53,537 INFO L226 Difference]: Without dead ends: 26633 [2019-12-18 20:54:53,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:54:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26633 states. [2019-12-18 20:54:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26633 to 18049. [2019-12-18 20:54:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18049 states. [2019-12-18 20:54:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18049 states to 18049 states and 56035 transitions. [2019-12-18 20:54:53,877 INFO L78 Accepts]: Start accepts. Automaton has 18049 states and 56035 transitions. Word has length 57 [2019-12-18 20:54:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:53,877 INFO L462 AbstractCegarLoop]: Abstraction has 18049 states and 56035 transitions. [2019-12-18 20:54:53,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:54:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 18049 states and 56035 transitions. [2019-12-18 20:54:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:53,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:53,898 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, 1, 1, 1, 1] [2019-12-18 20:54:53,898 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1460335274, now seen corresponding path program 6 times [2019-12-18 20:54:53,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:53,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127920395] [2019-12-18 20:54:53,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:53,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127920395] [2019-12-18 20:54:53,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:53,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:54:53,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445894851] [2019-12-18 20:54:53,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:54:53,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:53,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:54:53,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:53,975 INFO L87 Difference]: Start difference. First operand 18049 states and 56035 transitions. Second operand 3 states. [2019-12-18 20:54:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:54,041 INFO L93 Difference]: Finished difference Result 14032 states and 42714 transitions. [2019-12-18 20:54:54,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:54:54,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:54:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:54,067 INFO L225 Difference]: With dead ends: 14032 [2019-12-18 20:54:54,067 INFO L226 Difference]: Without dead ends: 14032 [2019-12-18 20:54:54,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14032 states. [2019-12-18 20:54:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14032 to 13553. [2019-12-18 20:54:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13553 states. [2019-12-18 20:54:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13553 states to 13553 states and 41152 transitions. [2019-12-18 20:54:54,379 INFO L78 Accepts]: Start accepts. Automaton has 13553 states and 41152 transitions. Word has length 57 [2019-12-18 20:54:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:54,379 INFO L462 AbstractCegarLoop]: Abstraction has 13553 states and 41152 transitions. [2019-12-18 20:54:54,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:54:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 13553 states and 41152 transitions. [2019-12-18 20:54:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:54:54,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:54,402 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, 1, 1, 1, 1, 1] [2019-12-18 20:54:54,402 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2015871185, now seen corresponding path program 1 times [2019-12-18 20:54:54,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:54,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432047240] [2019-12-18 20:54:54,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:54,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432047240] [2019-12-18 20:54:54,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:54,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:54:54,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373135773] [2019-12-18 20:54:54,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:54:54,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:54,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:54:54,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:54,484 INFO L87 Difference]: Start difference. First operand 13553 states and 41152 transitions. Second operand 5 states. [2019-12-18 20:54:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:54,930 INFO L93 Difference]: Finished difference Result 19247 states and 57533 transitions. [2019-12-18 20:54:54,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:54:54,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 20:54:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:54,955 INFO L225 Difference]: With dead ends: 19247 [2019-12-18 20:54:54,955 INFO L226 Difference]: Without dead ends: 19082 [2019-12-18 20:54:54,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:54:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19082 states. [2019-12-18 20:54:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19082 to 17139. [2019-12-18 20:54:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17139 states. [2019-12-18 20:54:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17139 states to 17139 states and 51696 transitions. [2019-12-18 20:54:55,214 INFO L78 Accepts]: Start accepts. Automaton has 17139 states and 51696 transitions. Word has length 58 [2019-12-18 20:54:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:55,215 INFO L462 AbstractCegarLoop]: Abstraction has 17139 states and 51696 transitions. [2019-12-18 20:54:55,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:54:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 17139 states and 51696 transitions. [2019-12-18 20:54:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:54:55,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:55,232 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, 1, 1, 1, 1, 1] [2019-12-18 20:54:55,232 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash 95293299, now seen corresponding path program 2 times [2019-12-18 20:54:55,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:55,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382833431] [2019-12-18 20:54:55,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:55,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382833431] [2019-12-18 20:54:55,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:55,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:54:55,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284849881] [2019-12-18 20:54:55,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:54:55,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:55,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:54:55,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:54:55,435 INFO L87 Difference]: Start difference. First operand 17139 states and 51696 transitions. Second operand 10 states. [2019-12-18 20:54:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:58,809 INFO L93 Difference]: Finished difference Result 41226 states and 121517 transitions. [2019-12-18 20:54:58,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 20:54:58,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-18 20:54:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:58,867 INFO L225 Difference]: With dead ends: 41226 [2019-12-18 20:54:58,867 INFO L226 Difference]: Without dead ends: 41058 [2019-12-18 20:54:58,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=379, Invalid=1601, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 20:54:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41058 states. [2019-12-18 20:54:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41058 to 21897. [2019-12-18 20:54:59,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21897 states. [2019-12-18 20:54:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21897 states to 21897 states and 65959 transitions. [2019-12-18 20:54:59,335 INFO L78 Accepts]: Start accepts. Automaton has 21897 states and 65959 transitions. Word has length 58 [2019-12-18 20:54:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:59,335 INFO L462 AbstractCegarLoop]: Abstraction has 21897 states and 65959 transitions. [2019-12-18 20:54:59,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:54:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 21897 states and 65959 transitions. [2019-12-18 20:54:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:54:59,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:59,355 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, 1, 1, 1, 1, 1] [2019-12-18 20:54:59,355 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:59,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1555970763, now seen corresponding path program 3 times [2019-12-18 20:54:59,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:59,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927237722] [2019-12-18 20:54:59,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:59,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927237722] [2019-12-18 20:54:59,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:59,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:54:59,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981430644] [2019-12-18 20:54:59,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:54:59,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:59,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:54:59,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:59,429 INFO L87 Difference]: Start difference. First operand 21897 states and 65959 transitions. Second operand 3 states. [2019-12-18 20:54:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:59,508 INFO L93 Difference]: Finished difference Result 21895 states and 65954 transitions. [2019-12-18 20:54:59,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:54:59,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 20:54:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:59,544 INFO L225 Difference]: With dead ends: 21895 [2019-12-18 20:54:59,545 INFO L226 Difference]: Without dead ends: 21895 [2019-12-18 20:54:59,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21895 states. [2019-12-18 20:54:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21895 to 19922. [2019-12-18 20:54:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19922 states. [2019-12-18 20:54:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19922 states to 19922 states and 60632 transitions. [2019-12-18 20:54:59,853 INFO L78 Accepts]: Start accepts. Automaton has 19922 states and 60632 transitions. Word has length 58 [2019-12-18 20:54:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:59,854 INFO L462 AbstractCegarLoop]: Abstraction has 19922 states and 60632 transitions. [2019-12-18 20:54:59,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:54:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 19922 states and 60632 transitions. [2019-12-18 20:54:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:54:59,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:59,873 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, 1, 1, 1, 1, 1, 1] [2019-12-18 20:54:59,873 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:59,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1074141970, now seen corresponding path program 1 times [2019-12-18 20:54:59,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:59,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502857237] [2019-12-18 20:54:59,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:54:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:54:59,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:54:59,989 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:54:59,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_77| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= v_~x~0_11 0) (= 0 v_~weak$$choice0~0_8) (= |v_#valid_75| (store .cse0 |v_ULTIMATE.start_main_~#t701~0.base_24| 1)) (= 0 v_~y$read_delayed_var~0.base_4) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~y$r_buff0_thd1~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= v_~a~0_11 0) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p3_EAX~0_14) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t701~0.base_24|)) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_34) (= 0 v_~y$r_buff1_thd4~0_19) (= v_~y$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~y$r_buff0_thd3~0_28 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t701~0.base_24|) (= v_~y$r_buff0_thd2~0_68 0) (= 0 v_~y$flush_delayed~0_13) (= v_~y$r_buff0_thd4~0_21 0) (= v_~y$r_buff1_thd1~0_9 0) (= v_~y$r_buff0_thd0~0_19 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t701~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t701~0.base_24|) |v_ULTIMATE.start_main_~#t701~0.offset_19| 0)) |v_#memory_int_25|) (= v_~z~0_16 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd0~0_21) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t701~0.base_24| 4)) (= 0 v_~__unbuffered_cnt~0_27) (= v_~main$tmp_guard1~0_14 0) (= |v_ULTIMATE.start_main_~#t701~0.offset_19| 0) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~y$w_buff1_used~0_67 0) (= v_~y$mem_tmp~0_10 0) (= 0 v_~y$r_buff1_thd3~0_19) (= 0 v_~y$r_buff1_thd2~0_43))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t702~0.base=|v_ULTIMATE.start_main_~#t702~0.base_26|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_21|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ULTIMATE.start_main_~#t701~0.base=|v_ULTIMATE.start_main_~#t701~0.base_24|, ULTIMATE.start_main_~#t701~0.offset=|v_ULTIMATE.start_main_~#t701~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_21, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ULTIMATE.start_main_~#t704~0.base=|v_ULTIMATE.start_main_~#t704~0.base_19|, ~y~0=v_~y~0_24, ULTIMATE.start_main_~#t702~0.offset=|v_ULTIMATE.start_main_~#t702~0.offset_20|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t703~0.offset=|v_ULTIMATE.start_main_~#t703~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t704~0.offset=|v_ULTIMATE.start_main_~#t704~0.offset_16|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t703~0.base=|v_ULTIMATE.start_main_~#t703~0.base_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t702~0.base, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t701~0.base, ULTIMATE.start_main_~#t701~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t704~0.base, ~y~0, ULTIMATE.start_main_~#t702~0.offset, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_~#t703~0.offset, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t704~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t703~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:54:59,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L843-1-->L845: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t702~0.base_13| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t702~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t702~0.base_13|) |v_ULTIMATE.start_main_~#t702~0.offset_11| 1)) |v_#memory_int_17|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t702~0.base_13| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t702~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t702~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t702~0.base_13|)) (= |v_ULTIMATE.start_main_~#t702~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t702~0.base=|v_ULTIMATE.start_main_~#t702~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t702~0.offset=|v_ULTIMATE.start_main_~#t702~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t702~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t702~0.offset] because there is no mapped edge [2019-12-18 20:54:59,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t703~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t703~0.base_11|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t703~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t703~0.offset_9|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t703~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t703~0.base_11|) |v_ULTIMATE.start_main_~#t703~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t703~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t703~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t703~0.base=|v_ULTIMATE.start_main_~#t703~0.base_11|, ULTIMATE.start_main_~#t703~0.offset=|v_ULTIMATE.start_main_~#t703~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t703~0.base, ULTIMATE.start_main_~#t703~0.offset] because there is no mapped edge [2019-12-18 20:54:59,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= 1 v_~z~0_6) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff1_thd2~0_28) (= v_~y$r_buff0_thd0~0_14 v_~y$r_buff1_thd0~0_11) (= v_~y$r_buff0_thd3~0_16 1) (= v_~y$r_buff0_thd3~0_17 v_~y$r_buff1_thd3~0_13) (= v_~y$r_buff0_thd4~0_15 v_~y$r_buff1_thd4~0_12) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_12, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:54:59,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t704~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t704~0.base_9|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t704~0.base_9| 4) |v_#length_17|) (= 0 |v_ULTIMATE.start_main_~#t704~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t704~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t704~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t704~0.base_9|) |v_ULTIMATE.start_main_~#t704~0.offset_8| 3)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t704~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t704~0.base=|v_ULTIMATE.start_main_~#t704~0.base_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t704~0.offset=|v_ULTIMATE.start_main_~#t704~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t704~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t704~0.offset, #length] because there is no mapped edge [2019-12-18 20:54:59,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] P0ENTRY-->P0EXIT: Formula: (and (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_7) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{~a~0=v_~a~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:55:00,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-361582378 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-361582378| |P1Thread1of1ForFork2_#t~ite12_Out-361582378|) .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out-361582378| ~y$w_buff1~0_In-361582378) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-361582378 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-361582378 256))) (= (mod ~y$w_buff0_used~0_In-361582378 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-361582378 256) 0))))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-361582378| ~y$w_buff1~0_In-361582378) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_In-361582378| |P1Thread1of1ForFork2_#t~ite11_Out-361582378|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-361582378, ~y$w_buff1~0=~y$w_buff1~0_In-361582378, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-361582378, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-361582378, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-361582378|, ~weak$$choice2~0=~weak$$choice2~0_In-361582378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-361582378} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-361582378, ~y$w_buff1~0=~y$w_buff1~0_In-361582378, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-361582378, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-361582378, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-361582378|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-361582378|, ~weak$$choice2~0=~weak$$choice2~0_In-361582378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-361582378} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:55:00,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-96027914 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out-96027914| |P1Thread1of1ForFork2_#t~ite14_Out-96027914|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-96027914 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-96027914 256)) (and (= (mod ~y$r_buff1_thd2~0_In-96027914 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-96027914 256))))) (= ~y$w_buff0_used~0_In-96027914 |P1Thread1of1ForFork2_#t~ite14_Out-96027914|) .cse1) (and (= |P1Thread1of1ForFork2_#t~ite14_In-96027914| |P1Thread1of1ForFork2_#t~ite14_Out-96027914|) (= ~y$w_buff0_used~0_In-96027914 |P1Thread1of1ForFork2_#t~ite15_Out-96027914|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-96027914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-96027914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-96027914, ~weak$$choice2~0=~weak$$choice2~0_In-96027914, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-96027914|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96027914} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-96027914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-96027914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-96027914, ~weak$$choice2~0=~weak$$choice2~0_In-96027914, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-96027914|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-96027914|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96027914} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 20:55:00,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L764-->L764-8: Formula: (let ((.cse5 (= 0 (mod ~y$w_buff1_used~0_In-1540183235 256))) (.cse1 (= |P1Thread1of1ForFork2_#t~ite18_Out-1540183235| |P1Thread1of1ForFork2_#t~ite17_Out-1540183235|)) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-1540183235 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1540183235 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1540183235 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1540183235 256)))) (or (and (or (and (= |P1Thread1of1ForFork2_#t~ite17_In-1540183235| |P1Thread1of1ForFork2_#t~ite17_Out-1540183235|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite18_Out-1540183235| ~y$w_buff1_used~0_In-1540183235)) (and .cse1 .cse0 (or .cse2 (and .cse3 .cse4) (and .cse3 .cse5)) (= |P1Thread1of1ForFork2_#t~ite17_Out-1540183235| ~y$w_buff1_used~0_In-1540183235))) (= |P1Thread1of1ForFork2_#t~ite16_In-1540183235| |P1Thread1of1ForFork2_#t~ite16_Out-1540183235|)) (let ((.cse6 (not .cse3))) (and (= |P1Thread1of1ForFork2_#t~ite16_Out-1540183235| 0) (or .cse6 (not .cse5)) .cse1 (or (not .cse4) .cse6) (not .cse2) (= |P1Thread1of1ForFork2_#t~ite17_Out-1540183235| |P1Thread1of1ForFork2_#t~ite16_Out-1540183235|) .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1540183235, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In-1540183235|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1540183235, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1540183235, ~weak$$choice2~0=~weak$$choice2~0_In-1540183235, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In-1540183235|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1540183235} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out-1540183235|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1540183235, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out-1540183235|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1540183235, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1540183235, ~weak$$choice2~0=~weak$$choice2~0_In-1540183235, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out-1540183235|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1540183235} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 20:55:00,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L765-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff0_thd2~0_36) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_36, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:55:00,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1930993194 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out1930993194| ~y$r_buff1_thd2~0_In1930993194) (= |P1Thread1of1ForFork2_#t~ite23_In1930993194| |P1Thread1of1ForFork2_#t~ite23_Out1930993194|)) (and (= ~y$r_buff1_thd2~0_In1930993194 |P1Thread1of1ForFork2_#t~ite23_Out1930993194|) (= |P1Thread1of1ForFork2_#t~ite24_Out1930993194| |P1Thread1of1ForFork2_#t~ite23_Out1930993194|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1930993194 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1930993194 256))) (and (= (mod ~y$r_buff1_thd2~0_In1930993194 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1930993194 256)))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1930993194, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1930993194, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1930993194, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In1930993194|, ~weak$$choice2~0=~weak$$choice2~0_In1930993194, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1930993194} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1930993194, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1930993194, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1930993194, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out1930993194|, ~weak$$choice2~0=~weak$$choice2~0_In1930993194, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out1930993194|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1930993194} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 20:55:00,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:55:00,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1716868186 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In1716868186 256) 0)) (.cse2 (= |P3Thread1of1ForFork0_#t~ite32_Out1716868186| |P3Thread1of1ForFork0_#t~ite33_Out1716868186|))) (or (and (= ~y~0_In1716868186 |P3Thread1of1ForFork0_#t~ite32_Out1716868186|) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= |P3Thread1of1ForFork0_#t~ite32_Out1716868186| ~y$w_buff1~0_In1716868186)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1716868186, ~y$w_buff1~0=~y$w_buff1~0_In1716868186, ~y~0=~y~0_In1716868186, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1716868186} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1716868186, ~y$w_buff1~0=~y$w_buff1~0_In1716868186, ~y~0=~y~0_In1716868186, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1716868186|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1716868186|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1716868186} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:55:00,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-892751920 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-892751920 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out-892751920| ~y$w_buff0_used~0_In-892751920)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out-892751920| 0) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-892751920, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-892751920} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-892751920, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-892751920, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-892751920|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 20:55:00,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In13400650 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In13400650 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In13400650 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In13400650 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite35_Out13400650| ~y$w_buff1_used~0_In13400650) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out13400650|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In13400650, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In13400650, ~y$w_buff0_used~0=~y$w_buff0_used~0_In13400650, ~y$w_buff1_used~0=~y$w_buff1_used~0_In13400650} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In13400650, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In13400650, ~y$w_buff0_used~0=~y$w_buff0_used~0_In13400650, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out13400650|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In13400650} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 20:55:00,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-904756859 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-904756859 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-904756859| 0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite36_Out-904756859| ~y$r_buff0_thd4~0_In-904756859) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-904756859, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-904756859} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-904756859, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-904756859, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-904756859|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 20:55:00,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In1791468111 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1791468111 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In1791468111 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1791468111 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out1791468111|)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite37_Out1791468111| ~y$r_buff1_thd4~0_In1791468111) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1791468111, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1791468111, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1791468111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1791468111} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1791468111, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1791468111, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1791468111, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1791468111|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1791468111} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 20:55:00,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_16) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_16, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:55:00,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2024517900 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In2024517900 256) 0))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite28_Out2024517900|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In2024517900 |P2Thread1of1ForFork3_#t~ite28_Out2024517900|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2024517900, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2024517900} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2024517900, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2024517900, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out2024517900|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 20:55:00,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In1291102526 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1291102526 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1291102526 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1291102526 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out1291102526| ~y$w_buff1_used~0_In1291102526)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out1291102526| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1291102526, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1291102526, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1291102526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1291102526} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1291102526, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1291102526, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1291102526, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1291102526|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1291102526} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 20:55:00,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In358840411 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In358840411 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In358840411 ~y$r_buff0_thd3~0_Out358840411)) (and (= ~y$r_buff0_thd3~0_Out358840411 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In358840411, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In358840411} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out358840411|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In358840411, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out358840411} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 20:55:00,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1622657658 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1622657658 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1622657658 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1622657658 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite31_Out1622657658| ~y$r_buff1_thd3~0_In1622657658)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out1622657658| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1622657658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1622657658, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1622657658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1622657658} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1622657658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1622657658, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1622657658, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1622657658|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1622657658} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 20:55:00,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_15) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 20:55:00,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:55:00,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-622394070 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-622394070 256) 0))) (or (and (= ~y~0_In-622394070 |ULTIMATE.start_main_#t~ite42_Out-622394070|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In-622394070 |ULTIMATE.start_main_#t~ite42_Out-622394070|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-622394070, ~y~0=~y~0_In-622394070, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-622394070, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622394070} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-622394070, ~y~0=~y~0_In-622394070, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-622394070|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-622394070, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622394070} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:55:00,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite42_8|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_7|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:55:00,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In5964106 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In5964106 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In5964106 |ULTIMATE.start_main_#t~ite44_Out5964106|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out5964106|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In5964106, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In5964106} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In5964106, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In5964106, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out5964106|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:55:00,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-2115281005 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-2115281005 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2115281005 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2115281005 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-2115281005|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-2115281005 |ULTIMATE.start_main_#t~ite45_Out-2115281005|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2115281005, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2115281005, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2115281005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2115281005} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2115281005, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2115281005, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2115281005, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2115281005|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2115281005} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:55:00,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-828267191 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-828267191 256)))) (or (and (= ~y$r_buff0_thd0~0_In-828267191 |ULTIMATE.start_main_#t~ite46_Out-828267191|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-828267191|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-828267191, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-828267191} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-828267191, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-828267191, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-828267191|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:55:00,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2126510107 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2126510107 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-2126510107 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2126510107 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-2126510107| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-2126510107| ~y$r_buff1_thd0~0_In-2126510107) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2126510107, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2126510107, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2126510107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2126510107} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2126510107, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2126510107, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2126510107|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2126510107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2126510107} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:55:00,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_12 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite47_15| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~__unbuffered_p0_EAX~0_11) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 2 v_~__unbuffered_p3_EAX~0_10) (= 0 v_~__unbuffered_p3_EBX~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, ~z~0=v_~z~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:55:00,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:55:00 BasicIcfg [2019-12-18 20:55:00,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:55:00,143 INFO L168 Benchmark]: Toolchain (without parser) took 136970.91 ms. Allocated memory was 134.2 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 97.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 20:55:00,144 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 134.2 MB. Free memory was 117.4 MB in the beginning and 117.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:55:00,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.97 ms. Allocated memory was 134.2 MB in the beginning and 198.7 MB in the end (delta: 64.5 MB). Free memory was 96.8 MB in the beginning and 149.8 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:55:00,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.56 ms. Allocated memory is still 198.7 MB. Free memory was 149.8 MB in the beginning and 146.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:55:00,147 INFO L168 Benchmark]: Boogie Preprocessor took 60.98 ms. Allocated memory is still 198.7 MB. Free memory was 146.9 MB in the beginning and 144.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:55:00,147 INFO L168 Benchmark]: RCFGBuilder took 829.24 ms. Allocated memory is still 198.7 MB. Free memory was 144.7 MB in the beginning and 95.1 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:55:00,149 INFO L168 Benchmark]: TraceAbstraction took 135190.54 ms. Allocated memory was 198.7 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 94.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 20:55:00,157 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.56 ms. Allocated memory is still 134.2 MB. Free memory was 117.4 MB in the beginning and 117.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.97 ms. Allocated memory was 134.2 MB in the beginning and 198.7 MB in the end (delta: 64.5 MB). Free memory was 96.8 MB in the beginning and 149.8 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.56 ms. Allocated memory is still 198.7 MB. Free memory was 149.8 MB in the beginning and 146.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.98 ms. Allocated memory is still 198.7 MB. Free memory was 146.9 MB in the beginning and 144.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.24 ms. Allocated memory is still 198.7 MB. Free memory was 144.7 MB in the beginning and 95.1 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 135190.54 ms. Allocated memory was 198.7 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 94.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 181 ProgramPointsBefore, 89 ProgramPointsAfterwards, 209 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 7757 VarBasedMoverChecksPositive, 195 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68785 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t701, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L845] FCALL, FORK 0 pthread_create(&t702, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L847] FCALL, FORK 0 pthread_create(&t703, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L781] 3 y$w_buff1 = y$w_buff0 [L782] 3 y$w_buff0 = 1 [L783] 3 y$w_buff1_used = y$w_buff0_used [L784] 3 y$w_buff0_used = (_Bool)1 [L849] FCALL, FORK 0 pthread_create(&t704, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L811] 4 z = 2 [L814] 4 __unbuffered_p3_EAX = z [L817] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L753] 2 x = 1 [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L760] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L760] 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) [L761] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L761] 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)) [L762] 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)) [L763] 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)) [L764] 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)) [L766] 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)) [L767] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L820] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 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 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 134.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 37.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3435 SDtfs, 4115 SDslu, 8450 SDs, 0 SdLazy, 5118 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227148occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 120264 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 837 NumberOfCodeBlocks, 837 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 759 ConstructedInterpolants, 0 QuantifiedInterpolants, 101731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...