/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/safe001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:14:25,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:14:25,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:14:25,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:14:25,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:14:25,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:14:25,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:14:25,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:14:25,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:14:25,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:14:25,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:14:25,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:14:25,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:14:25,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:14:25,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:14:25,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:14:25,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:14:25,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:14:25,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:14:25,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:14:25,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:14:25,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:14:25,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:14:25,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:14:25,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:14:25,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:14:25,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:14:25,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:14:25,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:14:25,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:14:25,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:14:25,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:14:25,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:14:25,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:14:25,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:14:25,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:14:25,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:14:25,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:14:25,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:14:25,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:14:25,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:14:25,945 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 22:14:25,960 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:14:25,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:14:25,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:14:25,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:14:25,962 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:14:25,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:14:25,962 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:14:25,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:14:25,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:14:25,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:14:25,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:14:25,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:14:25,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:14:25,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:14:25,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:14:25,964 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:14:25,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:14:25,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:14:25,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:14:25,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:14:25,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:14:25,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:14:25,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:14:25,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:14:25,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:14:25,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:14:25,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:14:25,966 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:14:25,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:14:25,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:14:26,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:14:26,256 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:14:26,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:14:26,262 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:14:26,262 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:14:26,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2019-12-18 22:14:26,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db44b7163/77d6a374cef24b8889c238f1359fe006/FLAG4373fcac1 [2019-12-18 22:14:26,933 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:14:26,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2019-12-18 22:14:26,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db44b7163/77d6a374cef24b8889c238f1359fe006/FLAG4373fcac1 [2019-12-18 22:14:27,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db44b7163/77d6a374cef24b8889c238f1359fe006 [2019-12-18 22:14:27,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:14:27,153 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:14:27,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:14:27,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:14:27,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:14:27,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:27,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd22070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27, skipping insertion in model container [2019-12-18 22:14:27,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:27,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:14:27,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:14:27,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:14:27,809 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:14:27,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:14:27,985 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:14:27,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27 WrapperNode [2019-12-18 22:14:27,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:14:27,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:14:27,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:14:27,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:14:27,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:14:28,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:14:28,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:14:28,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:14:28,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:14:28,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:14:28,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:14:28,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:14:28,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (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 22:14:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:14:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:14:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:14:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:14:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:14:28,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:14:28,176 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:14:28,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:14:28,176 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:14:28,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:14:28,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:14:28,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:14:28,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:14:28,179 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 22:14:28,941 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:14:28,941 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:14:28,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:14:28 BoogieIcfgContainer [2019-12-18 22:14:28,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:14:28,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:14:28,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:14:28,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:14:28,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:14:27" (1/3) ... [2019-12-18 22:14:28,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37858ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:14:28, skipping insertion in model container [2019-12-18 22:14:28,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (2/3) ... [2019-12-18 22:14:28,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37858ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:14:28, skipping insertion in model container [2019-12-18 22:14:28,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:14:28" (3/3) ... [2019-12-18 22:14:28,951 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_pso.oepc.i [2019-12-18 22:14:28,962 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:14:28,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:14:28,970 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:14:28,971 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:14:29,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,047 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,047 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,067 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,067 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,071 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,072 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,084 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,084 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,098 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:14:29,115 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:14:29,115 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:14:29,116 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:14:29,116 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:14:29,116 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:14:29,116 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:14:29,116 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:14:29,116 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:14:29,133 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 22:14:29,135 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:14:29,233 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:14:29,234 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:14:29,255 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:14:29,282 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:14:29,363 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:14:29,364 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:14:29,372 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:14:29,392 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 22:14:29,393 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:14:32,425 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 22:14:32,693 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:14:32,813 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:14:32,840 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82010 [2019-12-18 22:14:32,840 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 22:14:32,844 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-18 22:14:52,196 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117808 states. [2019-12-18 22:14:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 117808 states. [2019-12-18 22:14:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:14:52,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:14:52,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:14:52,206 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:14:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:14:52,212 INFO L82 PathProgramCache]: Analyzing trace with hash 806008766, now seen corresponding path program 1 times [2019-12-18 22:14:52,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:14:52,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061845817] [2019-12-18 22:14:52,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:14:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:14:52,451 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 22:14:52,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061845817] [2019-12-18 22:14:52,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:14:52,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:14:52,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334747153] [2019-12-18 22:14:52,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:14:52,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:14:52,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:14:52,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:14:52,477 INFO L87 Difference]: Start difference. First operand 117808 states. Second operand 3 states. [2019-12-18 22:14:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:14:55,929 INFO L93 Difference]: Finished difference Result 117244 states and 506404 transitions. [2019-12-18 22:14:55,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:14:55,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:14:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:14:56,761 INFO L225 Difference]: With dead ends: 117244 [2019-12-18 22:14:56,761 INFO L226 Difference]: Without dead ends: 114878 [2019-12-18 22:14:56,766 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 22:15:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114878 states. [2019-12-18 22:15:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114878 to 114878. [2019-12-18 22:15:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114878 states. [2019-12-18 22:15:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114878 states to 114878 states and 496758 transitions. [2019-12-18 22:15:06,727 INFO L78 Accepts]: Start accepts. Automaton has 114878 states and 496758 transitions. Word has length 5 [2019-12-18 22:15:06,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:06,727 INFO L462 AbstractCegarLoop]: Abstraction has 114878 states and 496758 transitions. [2019-12-18 22:15:06,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 114878 states and 496758 transitions. [2019-12-18 22:15:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:15:06,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:06,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:06,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 702926397, now seen corresponding path program 1 times [2019-12-18 22:15:06,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:06,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65526185] [2019-12-18 22:15:06,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:06,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 22:15:06,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65526185] [2019-12-18 22:15:06,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:06,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:15:06,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215495236] [2019-12-18 22:15:06,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:15:06,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:15:06,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:15:06,843 INFO L87 Difference]: Start difference. First operand 114878 states and 496758 transitions. Second operand 4 states. [2019-12-18 22:15:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:12,503 INFO L93 Difference]: Finished difference Result 184188 states and 760222 transitions. [2019-12-18 22:15:12,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:15:12,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:15:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:13,343 INFO L225 Difference]: With dead ends: 184188 [2019-12-18 22:15:13,343 INFO L226 Difference]: Without dead ends: 184139 [2019-12-18 22:15:13,344 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 22:15:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184139 states. [2019-12-18 22:15:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184139 to 169203. [2019-12-18 22:15:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169203 states. [2019-12-18 22:15:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169203 states to 169203 states and 707190 transitions. [2019-12-18 22:15:26,601 INFO L78 Accepts]: Start accepts. Automaton has 169203 states and 707190 transitions. Word has length 11 [2019-12-18 22:15:26,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:26,601 INFO L462 AbstractCegarLoop]: Abstraction has 169203 states and 707190 transitions. [2019-12-18 22:15:26,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:15:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 169203 states and 707190 transitions. [2019-12-18 22:15:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:15:26,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:26,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:26,610 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:26,610 INFO L82 PathProgramCache]: Analyzing trace with hash 702866747, now seen corresponding path program 1 times [2019-12-18 22:15:26,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:26,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436705867] [2019-12-18 22:15:26,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:26,695 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 22:15:26,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436705867] [2019-12-18 22:15:26,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:26,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:15:26,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358311043] [2019-12-18 22:15:26,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:15:26,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:15:26,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:15:26,699 INFO L87 Difference]: Start difference. First operand 169203 states and 707190 transitions. Second operand 4 states. [2019-12-18 22:15:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:34,361 INFO L93 Difference]: Finished difference Result 240014 states and 977713 transitions. [2019-12-18 22:15:34,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:15:34,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:15:34,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:35,157 INFO L225 Difference]: With dead ends: 240014 [2019-12-18 22:15:35,158 INFO L226 Difference]: Without dead ends: 239951 [2019-12-18 22:15:35,158 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 22:15:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239951 states. [2019-12-18 22:15:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239951 to 203645. [2019-12-18 22:15:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203645 states. [2019-12-18 22:15:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203645 states to 203645 states and 844323 transitions. [2019-12-18 22:15:46,188 INFO L78 Accepts]: Start accepts. Automaton has 203645 states and 844323 transitions. Word has length 13 [2019-12-18 22:15:46,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:46,190 INFO L462 AbstractCegarLoop]: Abstraction has 203645 states and 844323 transitions. [2019-12-18 22:15:46,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:15:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 203645 states and 844323 transitions. [2019-12-18 22:15:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:15:46,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:46,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:46,194 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:46,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:46,194 INFO L82 PathProgramCache]: Analyzing trace with hash 464803757, now seen corresponding path program 1 times [2019-12-18 22:15:46,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:46,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473115750] [2019-12-18 22:15:46,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:46,298 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 22:15:46,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473115750] [2019-12-18 22:15:46,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:46,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:15:46,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219160456] [2019-12-18 22:15:46,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:15:46,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:46,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:15:46,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:46,304 INFO L87 Difference]: Start difference. First operand 203645 states and 844323 transitions. Second operand 3 states. [2019-12-18 22:15:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:46,478 INFO L93 Difference]: Finished difference Result 39928 states and 130360 transitions. [2019-12-18 22:15:46,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:15:46,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:15:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:46,568 INFO L225 Difference]: With dead ends: 39928 [2019-12-18 22:15:46,569 INFO L226 Difference]: Without dead ends: 39928 [2019-12-18 22:15:46,569 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 22:15:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2019-12-18 22:15:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 39928. [2019-12-18 22:15:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39928 states. [2019-12-18 22:15:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39928 states to 39928 states and 130360 transitions. [2019-12-18 22:15:53,241 INFO L78 Accepts]: Start accepts. Automaton has 39928 states and 130360 transitions. Word has length 13 [2019-12-18 22:15:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:53,242 INFO L462 AbstractCegarLoop]: Abstraction has 39928 states and 130360 transitions. [2019-12-18 22:15:53,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 39928 states and 130360 transitions. [2019-12-18 22:15:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:15:53,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:53,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:53,247 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:53,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2009264966, now seen corresponding path program 1 times [2019-12-18 22:15:53,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:53,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204484479] [2019-12-18 22:15:53,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:53,415 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 22:15:53,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204484479] [2019-12-18 22:15:53,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:53,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:15:53,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314765952] [2019-12-18 22:15:53,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:15:53,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:15:53,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:15:53,417 INFO L87 Difference]: Start difference. First operand 39928 states and 130360 transitions. Second operand 6 states. [2019-12-18 22:15:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:54,536 INFO L93 Difference]: Finished difference Result 54473 states and 172334 transitions. [2019-12-18 22:15:54,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:15:54,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-18 22:15:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:54,629 INFO L225 Difference]: With dead ends: 54473 [2019-12-18 22:15:54,630 INFO L226 Difference]: Without dead ends: 54466 [2019-12-18 22:15:54,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:15:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54466 states. [2019-12-18 22:15:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54466 to 40256. [2019-12-18 22:15:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40256 states. [2019-12-18 22:15:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40256 states to 40256 states and 131316 transitions. [2019-12-18 22:15:55,711 INFO L78 Accepts]: Start accepts. Automaton has 40256 states and 131316 transitions. Word has length 19 [2019-12-18 22:15:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:55,711 INFO L462 AbstractCegarLoop]: Abstraction has 40256 states and 131316 transitions. [2019-12-18 22:15:55,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:15:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 40256 states and 131316 transitions. [2019-12-18 22:15:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:15:55,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:55,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:55,716 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:55,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash -782714310, now seen corresponding path program 2 times [2019-12-18 22:15:55,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:55,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894945621] [2019-12-18 22:15:55,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:55,812 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 22:15:55,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894945621] [2019-12-18 22:15:55,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:55,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:15:55,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992459246] [2019-12-18 22:15:55,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:15:55,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:15:55,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:15:55,814 INFO L87 Difference]: Start difference. First operand 40256 states and 131316 transitions. Second operand 5 states. [2019-12-18 22:15:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:56,660 INFO L93 Difference]: Finished difference Result 50188 states and 160318 transitions. [2019-12-18 22:15:56,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:15:56,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:15:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:56,752 INFO L225 Difference]: With dead ends: 50188 [2019-12-18 22:15:56,752 INFO L226 Difference]: Without dead ends: 50181 [2019-12-18 22:15:56,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:15:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50181 states. [2019-12-18 22:15:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50181 to 40157. [2019-12-18 22:15:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-18 22:15:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 130977 transitions. [2019-12-18 22:15:57,987 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 130977 transitions. Word has length 19 [2019-12-18 22:15:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:57,988 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 130977 transitions. [2019-12-18 22:15:57,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:15:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 130977 transitions. [2019-12-18 22:15:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:15:57,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:57,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:57,996 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1059595659, now seen corresponding path program 1 times [2019-12-18 22:15:57,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:57,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684758883] [2019-12-18 22:15:57,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:58,064 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 22:15:58,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684758883] [2019-12-18 22:15:58,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:58,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:15:58,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549489950] [2019-12-18 22:15:58,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:15:58,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:58,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:15:58,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:15:58,066 INFO L87 Difference]: Start difference. First operand 40157 states and 130977 transitions. Second operand 4 states. [2019-12-18 22:15:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:58,106 INFO L93 Difference]: Finished difference Result 7224 states and 19739 transitions. [2019-12-18 22:15:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:15:58,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:15:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:58,117 INFO L225 Difference]: With dead ends: 7224 [2019-12-18 22:15:58,117 INFO L226 Difference]: Without dead ends: 7224 [2019-12-18 22:15:58,118 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 22:15:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-18 22:15:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7112. [2019-12-18 22:15:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2019-12-18 22:15:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 19419 transitions. [2019-12-18 22:15:58,204 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 19419 transitions. Word has length 25 [2019-12-18 22:15:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:58,205 INFO L462 AbstractCegarLoop]: Abstraction has 7112 states and 19419 transitions. [2019-12-18 22:15:58,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:15:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 19419 transitions. [2019-12-18 22:15:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:15:58,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:58,215 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] [2019-12-18 22:15:58,215 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash -81356198, now seen corresponding path program 1 times [2019-12-18 22:15:58,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:58,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050098352] [2019-12-18 22:15:58,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:58,283 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 22:15:58,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050098352] [2019-12-18 22:15:58,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:58,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:15:58,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056885768] [2019-12-18 22:15:58,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:15:58,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:58,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:15:58,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:15:58,286 INFO L87 Difference]: Start difference. First operand 7112 states and 19419 transitions. Second operand 5 states. [2019-12-18 22:15:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:58,329 INFO L93 Difference]: Finished difference Result 5025 states and 14423 transitions. [2019-12-18 22:15:58,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:15:58,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:15:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:58,338 INFO L225 Difference]: With dead ends: 5025 [2019-12-18 22:15:58,338 INFO L226 Difference]: Without dead ends: 5025 [2019-12-18 22:15:58,339 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 22:15:58,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-18 22:15:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-18 22:15:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-18 22:15:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13439 transitions. [2019-12-18 22:15:58,453 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13439 transitions. Word has length 37 [2019-12-18 22:15:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:58,455 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13439 transitions. [2019-12-18 22:15:58,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:15:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13439 transitions. [2019-12-18 22:15:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:15:58,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:58,469 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, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:58,470 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2136434843, now seen corresponding path program 1 times [2019-12-18 22:15:58,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:58,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510218178] [2019-12-18 22:15:58,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:58,575 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 22:15:58,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510218178] [2019-12-18 22:15:58,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:58,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:15:58,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474150967] [2019-12-18 22:15:58,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:15:58,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:58,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:15:58,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:58,579 INFO L87 Difference]: Start difference. First operand 4661 states and 13439 transitions. Second operand 3 states. [2019-12-18 22:15:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:58,639 INFO L93 Difference]: Finished difference Result 4670 states and 13453 transitions. [2019-12-18 22:15:58,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:15:58,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:15:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:58,647 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:15:58,648 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:15:58,648 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 22:15:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:15:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:15:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:15:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13449 transitions. [2019-12-18 22:15:58,744 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13449 transitions. Word has length 65 [2019-12-18 22:15:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:58,745 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13449 transitions. [2019-12-18 22:15:58,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13449 transitions. [2019-12-18 22:15:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:15:58,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:58,758 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, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:58,758 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:58,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:58,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1287100776, now seen corresponding path program 1 times [2019-12-18 22:15:58,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:58,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232201699] [2019-12-18 22:15:58,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:58,849 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 22:15:58,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232201699] [2019-12-18 22:15:58,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:58,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:15:58,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134839730] [2019-12-18 22:15:58,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:15:58,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:58,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:15:58,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:58,851 INFO L87 Difference]: Start difference. First operand 4666 states and 13449 transitions. Second operand 3 states. [2019-12-18 22:15:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:58,904 INFO L93 Difference]: Finished difference Result 4670 states and 13443 transitions. [2019-12-18 22:15:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:15:58,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:15:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:58,911 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:15:58,911 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:15:58,911 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 22:15:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:15:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:15:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:15:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13439 transitions. [2019-12-18 22:15:58,971 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13439 transitions. Word has length 65 [2019-12-18 22:15:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:58,971 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13439 transitions. [2019-12-18 22:15:58,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13439 transitions. [2019-12-18 22:15:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:15:58,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:58,978 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, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:58,978 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:58,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1294757063, now seen corresponding path program 1 times [2019-12-18 22:15:58,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:58,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532003124] [2019-12-18 22:15:58,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:59,074 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 22:15:59,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532003124] [2019-12-18 22:15:59,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:59,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:15:59,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130952826] [2019-12-18 22:15:59,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:15:59,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:59,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:15:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:59,076 INFO L87 Difference]: Start difference. First operand 4666 states and 13439 transitions. Second operand 3 states. [2019-12-18 22:15:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:59,105 INFO L93 Difference]: Finished difference Result 4414 states and 12534 transitions. [2019-12-18 22:15:59,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:15:59,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:15:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:59,112 INFO L225 Difference]: With dead ends: 4414 [2019-12-18 22:15:59,113 INFO L226 Difference]: Without dead ends: 4414 [2019-12-18 22:15:59,113 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 22:15:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2019-12-18 22:15:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 4414. [2019-12-18 22:15:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4414 states. [2019-12-18 22:15:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 12534 transitions. [2019-12-18 22:15:59,176 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 12534 transitions. Word has length 65 [2019-12-18 22:15:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:59,177 INFO L462 AbstractCegarLoop]: Abstraction has 4414 states and 12534 transitions. [2019-12-18 22:15:59,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 12534 transitions. [2019-12-18 22:15:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:15:59,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:59,183 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:59,183 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1361414887, now seen corresponding path program 1 times [2019-12-18 22:15:59,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:59,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062664431] [2019-12-18 22:15:59,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:15:59,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062664431] [2019-12-18 22:15:59,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:59,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:15:59,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079738330] [2019-12-18 22:15:59,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:15:59,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:59,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:15:59,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:15:59,278 INFO L87 Difference]: Start difference. First operand 4414 states and 12534 transitions. Second operand 5 states. [2019-12-18 22:15:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:59,596 INFO L93 Difference]: Finished difference Result 7038 states and 19759 transitions. [2019-12-18 22:15:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:15:59,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 22:15:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:59,606 INFO L225 Difference]: With dead ends: 7038 [2019-12-18 22:15:59,606 INFO L226 Difference]: Without dead ends: 7038 [2019-12-18 22:15:59,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:15:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2019-12-18 22:15:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 4840. [2019-12-18 22:15:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4840 states. [2019-12-18 22:15:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 13808 transitions. [2019-12-18 22:15:59,679 INFO L78 Accepts]: Start accepts. Automaton has 4840 states and 13808 transitions. Word has length 66 [2019-12-18 22:15:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:59,679 INFO L462 AbstractCegarLoop]: Abstraction has 4840 states and 13808 transitions. [2019-12-18 22:15:59,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:15:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4840 states and 13808 transitions. [2019-12-18 22:15:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:15:59,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:59,686 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:59,686 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:59,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1912682329, now seen corresponding path program 2 times [2019-12-18 22:15:59,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:59,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125222217] [2019-12-18 22:15:59,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:59,792 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 22:15:59,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125222217] [2019-12-18 22:15:59,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:59,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:15:59,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529399079] [2019-12-18 22:15:59,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:15:59,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:59,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:15:59,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:59,794 INFO L87 Difference]: Start difference. First operand 4840 states and 13808 transitions. Second operand 3 states. [2019-12-18 22:15:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:59,864 INFO L93 Difference]: Finished difference Result 4840 states and 13807 transitions. [2019-12-18 22:15:59,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:15:59,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:15:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:59,872 INFO L225 Difference]: With dead ends: 4840 [2019-12-18 22:15:59,872 INFO L226 Difference]: Without dead ends: 4840 [2019-12-18 22:15:59,872 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 22:15:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4840 states. [2019-12-18 22:15:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4840 to 3325. [2019-12-18 22:15:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3325 states. [2019-12-18 22:15:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 9638 transitions. [2019-12-18 22:15:59,932 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 9638 transitions. Word has length 66 [2019-12-18 22:15:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:59,933 INFO L462 AbstractCegarLoop]: Abstraction has 3325 states and 9638 transitions. [2019-12-18 22:15:59,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 9638 transitions. [2019-12-18 22:15:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:15:59,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:59,937 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:59,937 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1093252188, now seen corresponding path program 1 times [2019-12-18 22:15:59,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:59,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173569524] [2019-12-18 22:15:59,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:16:00,087 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 22:16:00,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173569524] [2019-12-18 22:16:00,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:16:00,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:16:00,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34004515] [2019-12-18 22:16:00,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:16:00,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:16:00,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:16:00,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:16:00,089 INFO L87 Difference]: Start difference. First operand 3325 states and 9638 transitions. Second operand 7 states. [2019-12-18 22:16:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:16:00,205 INFO L93 Difference]: Finished difference Result 7291 states and 21445 transitions. [2019-12-18 22:16:00,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:16:00,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 22:16:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:16:00,213 INFO L225 Difference]: With dead ends: 7291 [2019-12-18 22:16:00,213 INFO L226 Difference]: Without dead ends: 4262 [2019-12-18 22:16:00,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:16:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2019-12-18 22:16:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 3151. [2019-12-18 22:16:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3151 states. [2019-12-18 22:16:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 3151 states and 9143 transitions. [2019-12-18 22:16:00,446 INFO L78 Accepts]: Start accepts. Automaton has 3151 states and 9143 transitions. Word has length 67 [2019-12-18 22:16:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:16:00,446 INFO L462 AbstractCegarLoop]: Abstraction has 3151 states and 9143 transitions. [2019-12-18 22:16:00,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:16:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3151 states and 9143 transitions. [2019-12-18 22:16:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:16:00,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:16:00,451 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:16:00,451 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:16:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:16:00,452 INFO L82 PathProgramCache]: Analyzing trace with hash 471698454, now seen corresponding path program 2 times [2019-12-18 22:16:00,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:16:00,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624792777] [2019-12-18 22:16:00,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:16:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:16:00,559 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 22:16:00,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624792777] [2019-12-18 22:16:00,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:16:00,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:16:00,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473871451] [2019-12-18 22:16:00,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:16:00,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:16:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:16:00,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:16:00,562 INFO L87 Difference]: Start difference. First operand 3151 states and 9143 transitions. Second operand 3 states. [2019-12-18 22:16:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:16:00,583 INFO L93 Difference]: Finished difference Result 3005 states and 8492 transitions. [2019-12-18 22:16:00,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:16:00,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:16:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:16:00,588 INFO L225 Difference]: With dead ends: 3005 [2019-12-18 22:16:00,588 INFO L226 Difference]: Without dead ends: 3005 [2019-12-18 22:16:00,590 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 22:16:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2019-12-18 22:16:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2845. [2019-12-18 22:16:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2845 states. [2019-12-18 22:16:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 8048 transitions. [2019-12-18 22:16:00,646 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 8048 transitions. Word has length 67 [2019-12-18 22:16:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:16:00,647 INFO L462 AbstractCegarLoop]: Abstraction has 2845 states and 8048 transitions. [2019-12-18 22:16:00,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:16:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 8048 transitions. [2019-12-18 22:16:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:16:00,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:16:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:16:00,653 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:16:00,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:16:00,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1986071826, now seen corresponding path program 1 times [2019-12-18 22:16:00,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:16:00,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292014299] [2019-12-18 22:16:00,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:16:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:16:00,823 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 22:16:00,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292014299] [2019-12-18 22:16:00,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:16:00,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:16:00,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035281856] [2019-12-18 22:16:00,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:16:00,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:16:00,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:16:00,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:16:00,827 INFO L87 Difference]: Start difference. First operand 2845 states and 8048 transitions. Second operand 7 states. [2019-12-18 22:16:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:16:00,926 INFO L93 Difference]: Finished difference Result 5002 states and 14130 transitions. [2019-12-18 22:16:00,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:16:00,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-18 22:16:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:16:00,930 INFO L225 Difference]: With dead ends: 5002 [2019-12-18 22:16:00,931 INFO L226 Difference]: Without dead ends: 2597 [2019-12-18 22:16:00,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:16:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2019-12-18 22:16:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2201. [2019-12-18 22:16:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2201 states. [2019-12-18 22:16:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 6196 transitions. [2019-12-18 22:16:00,977 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 6196 transitions. Word has length 68 [2019-12-18 22:16:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:16:00,977 INFO L462 AbstractCegarLoop]: Abstraction has 2201 states and 6196 transitions. [2019-12-18 22:16:00,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:16:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 6196 transitions. [2019-12-18 22:16:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:16:00,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:16:00,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:16:00,982 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:16:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:16:00,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1952420056, now seen corresponding path program 2 times [2019-12-18 22:16:00,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:16:00,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863926555] [2019-12-18 22:16:00,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:16:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:16:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:16:01,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:16:01,105 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:16:01,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff0_used~0_117) (= v_~x$w_buff1_used~0_74 0) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x~0_30 0) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~y~0_14 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1807~0.base_20|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1807~0.base_20| 4) |v_#length_25|) (= 0 |v_ULTIMATE.start_main_~#t1807~0.offset_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1807~0.base_20|)) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1807~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1807~0.base_20|) |v_ULTIMATE.start_main_~#t1807~0.offset_17| 0)) |v_#memory_int_21|) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1807~0.base_20| 1)) (= v_~x$r_buff1_thd0~0_47 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 |v_#NULL.base_4|) (= 0 v_~x$w_buff1~0_29) (= 0 v_~__unbuffered_cnt~0_19) (= v_~x$r_buff1_thd2~0_19 0) (= |v_#NULL.offset_4| 0) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_30) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_~#t1808~0.offset=|v_ULTIMATE.start_main_~#t1808~0.offset_17|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_29, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_30, ULTIMATE.start_main_~#t1807~0.offset=|v_ULTIMATE.start_main_~#t1807~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_~#t1809~0.base=|v_ULTIMATE.start_main_~#t1809~0.base_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ULTIMATE.start_main_~#t1809~0.offset=|v_ULTIMATE.start_main_~#t1809~0.offset_16|, ~y~0=v_~y~0_14, ULTIMATE.start_main_~#t1808~0.base=|v_ULTIMATE.start_main_~#t1808~0.base_21|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t1807~0.base=|v_ULTIMATE.start_main_~#t1807~0.base_20|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1808~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1807~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1809~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1809~0.offset, ~y~0, ULTIMATE.start_main_~#t1808~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1807~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:16:01,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L805-1-->L807: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1808~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1808~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1808~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1808~0.base_11|) |v_ULTIMATE.start_main_~#t1808~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1808~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1808~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1808~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1808~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1808~0.base=|v_ULTIMATE.start_main_~#t1808~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1808~0.offset=|v_ULTIMATE.start_main_~#t1808~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1808~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1808~0.offset] because there is no mapped edge [2019-12-18 22:16:01,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_ULTIMATE.start_main_~#t1809~0.offset_8| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1809~0.base_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1809~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1809~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1809~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1809~0.base_9|) |v_ULTIMATE.start_main_~#t1809~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1809~0.base_9| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1809~0.base_9| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1809~0.offset=|v_ULTIMATE.start_main_~#t1809~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1809~0.base=|v_ULTIMATE.start_main_~#t1809~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1809~0.offset, #length, ULTIMATE.start_main_~#t1809~0.base] because there is no mapped edge [2019-12-18 22:16:01,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_17) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~x$w_buff0_used~0_80) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_18 v_~x$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_49 v_~x$w_buff0_used~0_81) (= (mod v_~x$w_buff1_used~0_49 256) 0)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:16:01,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1785301099 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1785301099 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1785301099| ~x$w_buff1~0_In1785301099)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1785301099| ~x~0_In1785301099)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1785301099, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1785301099, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1785301099, ~x~0=~x~0_In1785301099} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1785301099|, ~x$w_buff1~0=~x$w_buff1~0_In1785301099, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1785301099, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1785301099, ~x~0=~x~0_In1785301099} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:16:01,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 22:16:01,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-106004663 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-106004663 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-106004663|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-106004663 |P2Thread1of1ForFork2_#t~ite17_Out-106004663|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-106004663, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-106004663} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-106004663, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-106004663|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-106004663} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:16:01,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In2041073950 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In2041073950 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2041073950 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2041073950 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2041073950 |P2Thread1of1ForFork2_#t~ite18_Out2041073950|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out2041073950|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2041073950, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2041073950, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2041073950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2041073950} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2041073950, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2041073950, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2041073950, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out2041073950|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2041073950} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:16:01,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1084866299 256) 0)) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out1084866299| |P0Thread1of1ForFork0_#t~ite3_Out1084866299|)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1084866299 256)))) (or (and .cse0 (= ~x~0_In1084866299 |P0Thread1of1ForFork0_#t~ite3_Out1084866299|) (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= ~x$w_buff1~0_In1084866299 |P0Thread1of1ForFork0_#t~ite3_Out1084866299|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1084866299, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1084866299, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1084866299, ~x~0=~x~0_In1084866299} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1084866299|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1084866299|, ~x$w_buff1~0=~x$w_buff1~0_In1084866299, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1084866299, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1084866299, ~x~0=~x~0_In1084866299} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 22:16:01,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-946615648 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-946615648 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-946615648|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-946615648 |P0Thread1of1ForFork0_#t~ite5_Out-946615648|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-946615648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-946615648} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-946615648|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-946615648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-946615648} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:16:01,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-1697365351 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1697365351 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1697365351 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1697365351 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1697365351 |P0Thread1of1ForFork0_#t~ite6_Out-1697365351|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1697365351|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1697365351, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1697365351, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1697365351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1697365351} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1697365351|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1697365351, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1697365351, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1697365351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1697365351} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:16:01,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-497064030 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-497064030 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-497064030| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-497064030| ~x$r_buff0_thd3~0_In-497064030) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-497064030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497064030} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-497064030, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-497064030|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497064030} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:16:01,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In-1169114789 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1169114789 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1169114789 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1169114789 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-1169114789|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1169114789| ~x$r_buff1_thd3~0_In-1169114789) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1169114789, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1169114789, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1169114789, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1169114789} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1169114789|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1169114789, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1169114789, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1169114789, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1169114789} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:16:01,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_13)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:16:01,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1287091474 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1287091474 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-1287091474 |P0Thread1of1ForFork0_#t~ite7_Out-1287091474|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1287091474|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1287091474, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1287091474} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1287091474, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1287091474|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1287091474} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 22:16:01,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-799476023 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-799476023 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-799476023 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-799476023 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-799476023| ~x$r_buff1_thd1~0_In-799476023) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-799476023| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-799476023, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-799476023, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-799476023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-799476023} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-799476023, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-799476023|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-799476023, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-799476023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-799476023} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:16:01,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 22:16:01,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1589021952 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1589021952 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1589021952| ~x$w_buff0_used~0_In-1589021952)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1589021952|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1589021952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1589021952} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1589021952|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1589021952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1589021952} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:16:01,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In89700333 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In89700333 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In89700333 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In89700333 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out89700333| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out89700333| ~x$w_buff1_used~0_In89700333) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In89700333, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In89700333, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In89700333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In89700333} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In89700333, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In89700333, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out89700333|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In89700333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In89700333} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:16:01,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1452727224 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1452727224 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1452727224 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out-1452727224 ~x$r_buff0_thd2~0_In-1452727224) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1452727224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1452727224} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1452727224|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1452727224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1452727224} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:16:01,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In1665331234 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1665331234 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1665331234 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1665331234 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1665331234| ~x$r_buff1_thd2~0_In1665331234)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1665331234|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1665331234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1665331234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1665331234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1665331234} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1665331234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1665331234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1665331234, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1665331234|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1665331234} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:16:01,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:16:01,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:16:01,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In663504215 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In663504215 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out663504215| |ULTIMATE.start_main_#t~ite24_Out663504215|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~x$w_buff1~0_In663504215 |ULTIMATE.start_main_#t~ite24_Out663504215|)) (and (or .cse1 .cse0) .cse2 (= ~x~0_In663504215 |ULTIMATE.start_main_#t~ite24_Out663504215|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In663504215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In663504215, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In663504215, ~x~0=~x~0_In663504215} OutVars{~x$w_buff1~0=~x$w_buff1~0_In663504215, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out663504215|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out663504215|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In663504215, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In663504215, ~x~0=~x~0_In663504215} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 22:16:01,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1972895549 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1972895549 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1972895549 |ULTIMATE.start_main_#t~ite26_Out1972895549|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out1972895549|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1972895549, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1972895549} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1972895549, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1972895549|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1972895549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:16:01,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-608868650 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-608868650 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-608868650 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-608868650 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out-608868650| 0)) (and (= |ULTIMATE.start_main_#t~ite27_Out-608868650| ~x$w_buff1_used~0_In-608868650) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-608868650, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-608868650, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-608868650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-608868650} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-608868650, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-608868650, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-608868650|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-608868650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-608868650} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:16:01,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1293529099 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1293529099 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out1293529099|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1293529099 |ULTIMATE.start_main_#t~ite28_Out1293529099|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1293529099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1293529099} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1293529099, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1293529099|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1293529099} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:16:01,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1361964351 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1361964351 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1361964351 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1361964351 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1361964351 |ULTIMATE.start_main_#t~ite29_Out1361964351|)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out1361964351|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1361964351, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1361964351, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1361964351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1361964351} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1361964351, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1361964351|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1361964351, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1361964351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1361964351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:16:01,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:16:01,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:16:01,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:16:01,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:16:01 BasicIcfg [2019-12-18 22:16:01,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:16:01,236 INFO L168 Benchmark]: Toolchain (without parser) took 94083.68 ms. Allocated memory was 145.8 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 100.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 22:16:01,236 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:16:01,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.19 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.4 MB in the beginning and 157.0 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:16:01,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.00 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 153.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:16:01,238 INFO L168 Benchmark]: Boogie Preprocessor took 39.34 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:16:01,239 INFO L168 Benchmark]: RCFGBuilder took 847.72 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 101.5 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:16:01,240 INFO L168 Benchmark]: TraceAbstraction took 92290.22 ms. Allocated memory was 203.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 22:16:01,246 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.79 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.19 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.4 MB in the beginning and 157.0 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.00 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 153.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.34 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.72 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 101.5 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92290.22 ms. Allocated memory was 203.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5983 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82010 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1807, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1808, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1809, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 91.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2488 SDtfs, 1871 SDslu, 3788 SDs, 0 SdLazy, 2068 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203645occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 81340 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 136724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...