/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:06:35,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:06:35,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:06:35,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:06:35,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:06:35,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:06:35,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:06:35,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:06:35,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:06:35,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:06:35,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:06:35,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:06:35,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:06:35,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:06:35,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:06:35,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:06:35,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:06:35,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:06:35,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:06:35,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:06:35,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:06:35,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:06:35,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:06:35,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:06:35,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:06:35,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:06:35,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:06:35,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:06:35,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:06:35,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:06:35,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:06:35,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:06:35,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:06:35,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:06:35,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:06:35,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:06:35,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:06:35,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:06:35,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:06:35,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:06:35,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:06:35,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:06:35,982 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:06:35,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:06:35,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:06:35,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:06:35,984 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:06:35,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:06:35,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:06:35,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:06:35,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:06:35,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:06:35,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:06:35,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:06:35,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:06:35,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:06:35,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:06:35,987 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:06:35,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:06:35,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:06:35,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:06:35,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:06:35,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:06:35,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:06:35,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:06:35,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:06:35,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:06:35,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:06:35,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:06:35,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:06:35,990 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:06:35,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:06:36,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:06:36,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:06:36,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:06:36,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:06:36,282 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:06:36,283 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i [2019-12-18 12:06:36,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936b6028b/eb16023d10db4d5a9dee428007058a87/FLAGdb797c17d [2019-12-18 12:06:36,976 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:06:36,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i [2019-12-18 12:06:36,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936b6028b/eb16023d10db4d5a9dee428007058a87/FLAGdb797c17d [2019-12-18 12:06:37,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936b6028b/eb16023d10db4d5a9dee428007058a87 [2019-12-18 12:06:37,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:06:37,220 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:06:37,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:06:37,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:06:37,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:06:37,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:06:37" (1/1) ... [2019-12-18 12:06:37,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a11d1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:37, skipping insertion in model container [2019-12-18 12:06:37,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:06:37" (1/1) ... [2019-12-18 12:06:37,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:06:37,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:06:37,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:06:37,851 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:06:37,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:06:38,031 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:06:38,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38 WrapperNode [2019-12-18 12:06:38,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:06:38,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:06:38,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:06:38,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:06:38,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (1/1) ... [2019-12-18 12:06:38,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (1/1) ... [2019-12-18 12:06:38,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:06:38,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:06:38,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:06:38,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:06:38,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (1/1) ... [2019-12-18 12:06:38,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (1/1) ... [2019-12-18 12:06:38,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (1/1) ... [2019-12-18 12:06:38,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (1/1) ... [2019-12-18 12:06:38,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (1/1) ... [2019-12-18 12:06:38,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (1/1) ... [2019-12-18 12:06:38,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (1/1) ... [2019-12-18 12:06:38,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:06:38,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:06:38,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:06:38,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:06:38,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (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 12:06:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:06:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:06:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:06:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:06:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:06:38,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:06:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:06:38,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:06:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:06:38,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:06:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:06:38,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:06:38,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:06:38,219 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 12:06:39,037 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:06:39,038 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:06:39,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:06:39 BoogieIcfgContainer [2019-12-18 12:06:39,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:06:39,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:06:39,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:06:39,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:06:39,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:06:37" (1/3) ... [2019-12-18 12:06:39,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c7516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:06:39, skipping insertion in model container [2019-12-18 12:06:39,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:06:38" (2/3) ... [2019-12-18 12:06:39,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c7516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:06:39, skipping insertion in model container [2019-12-18 12:06:39,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:06:39" (3/3) ... [2019-12-18 12:06:39,051 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_tso.oepc.i [2019-12-18 12:06:39,062 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:06:39,062 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:06:39,073 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:06:39,074 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:06:39,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,154 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,154 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,164 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,164 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,192 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,192 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,202 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,213 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,214 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,214 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:06:39,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:06:39,261 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:06:39,262 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:06:39,262 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:06:39,262 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:06:39,262 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:06:39,262 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:06:39,262 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:06:39,263 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:06:39,285 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-18 12:06:39,287 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 12:06:39,375 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 12:06:39,376 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:06:39,398 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:06:39,434 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 12:06:39,484 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 12:06:39,484 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:06:39,496 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:06:39,524 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:06:39,526 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:06:44,511 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 12:06:44,653 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 12:06:44,831 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-18 12:06:44,832 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 12:06:44,836 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-18 12:07:03,694 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-18 12:07:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-18 12:07:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:07:03,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:03,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:07:03,703 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:03,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-18 12:07:03,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:03,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551620238] [2019-12-18 12:07:03,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:04,015 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 12:07:04,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551620238] [2019-12-18 12:07:04,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:04,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:07:04,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443875688] [2019-12-18 12:07:04,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:04,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:04,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:04,044 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-18 12:07:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:08,208 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-18 12:07:08,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:08,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:07:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:08,930 INFO L225 Difference]: With dead ends: 119349 [2019-12-18 12:07:08,930 INFO L226 Difference]: Without dead ends: 112420 [2019-12-18 12:07:08,932 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 12:07:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-18 12:07:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-18 12:07:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-18 12:07:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-18 12:07:19,633 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-18 12:07:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:19,633 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-18 12:07:19,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-18 12:07:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:07:19,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:19,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:19,638 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:19,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:19,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-18 12:07:19,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:19,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565684989] [2019-12-18 12:07:19,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:19,779 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 12:07:19,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565684989] [2019-12-18 12:07:19,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:19,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:07:19,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181578312] [2019-12-18 12:07:19,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:07:19,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:19,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:07:19,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:07:19,782 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-18 12:07:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:24,897 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-18 12:07:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:07:24,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:07:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:25,592 INFO L225 Difference]: With dead ends: 179210 [2019-12-18 12:07:25,592 INFO L226 Difference]: Without dead ends: 179161 [2019-12-18 12:07:25,593 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 12:07:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-18 12:07:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-18 12:07:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-18 12:07:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-18 12:07:43,094 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-18 12:07:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:43,095 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-18 12:07:43,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:07:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-18 12:07:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:07:43,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:43,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:43,102 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-18 12:07:43,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:43,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000141032] [2019-12-18 12:07:43,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:43,163 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 12:07:43,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000141032] [2019-12-18 12:07:43,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:43,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:07:43,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474109429] [2019-12-18 12:07:43,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:43,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:43,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:43,165 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-18 12:07:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:43,314 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-18 12:07:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:43,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:07:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:43,389 INFO L225 Difference]: With dead ends: 34811 [2019-12-18 12:07:43,389 INFO L226 Difference]: Without dead ends: 34811 [2019-12-18 12:07:43,390 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 12:07:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-18 12:07:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-18 12:07:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-18 12:07:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-18 12:07:44,068 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-18 12:07:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:44,069 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-18 12:07:44,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-18 12:07:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:07:44,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:44,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:44,073 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-18 12:07:44,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:44,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454656746] [2019-12-18 12:07:44,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:44,169 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 12:07:44,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454656746] [2019-12-18 12:07:44,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:44,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:07:44,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650382096] [2019-12-18 12:07:44,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:07:44,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:44,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:07:44,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:07:44,172 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-18 12:07:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:46,977 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-18 12:07:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:07:46,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:07:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:47,056 INFO L225 Difference]: With dead ends: 48236 [2019-12-18 12:07:47,056 INFO L226 Difference]: Without dead ends: 48236 [2019-12-18 12:07:47,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:07:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-18 12:07:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-18 12:07:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-18 12:07:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-18 12:07:47,793 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-18 12:07:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:47,794 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-18 12:07:47,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:07:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-18 12:07:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:07:47,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:47,804 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] [2019-12-18 12:07:47,805 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-18 12:07:47,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:47,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567015544] [2019-12-18 12:07:47,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:47,901 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 12:07:47,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567015544] [2019-12-18 12:07:47,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:47,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:07:47,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186804430] [2019-12-18 12:07:47,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:07:47,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:47,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:07:47,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:07:47,904 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-18 12:07:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:49,150 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-18 12:07:49,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:07:49,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:07:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:49,249 INFO L225 Difference]: With dead ends: 62182 [2019-12-18 12:07:49,249 INFO L226 Difference]: Without dead ends: 62175 [2019-12-18 12:07:49,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:07:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-18 12:07:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-18 12:07:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-18 12:07:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-18 12:07:50,074 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-18 12:07:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:50,075 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-18 12:07:50,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:07:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-18 12:07:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:07:50,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:50,090 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 12:07:50,090 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:50,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-18 12:07:50,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:50,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545571869] [2019-12-18 12:07:50,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:50,153 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 12:07:50,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545571869] [2019-12-18 12:07:50,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:50,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:07:50,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508074882] [2019-12-18 12:07:50,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:07:50,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:50,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:07:50,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:07:50,155 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-18 12:07:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:50,233 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-18 12:07:50,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:07:50,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:07:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:50,255 INFO L225 Difference]: With dead ends: 16196 [2019-12-18 12:07:50,255 INFO L226 Difference]: Without dead ends: 16196 [2019-12-18 12:07:50,256 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 12:07:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-18 12:07:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-18 12:07:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-18 12:07:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-18 12:07:50,485 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-18 12:07:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:50,485 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-18 12:07:50,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:07:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-18 12:07:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:07:50,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:50,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:50,497 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:50,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:50,497 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-18 12:07:50,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:50,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253867492] [2019-12-18 12:07:50,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:50,555 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 12:07:50,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253867492] [2019-12-18 12:07:50,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:50,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:07:50,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228389613] [2019-12-18 12:07:50,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:50,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:50,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:50,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:50,558 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-18 12:07:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:50,792 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-18 12:07:50,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:50,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:07:50,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:50,819 INFO L225 Difference]: With dead ends: 23073 [2019-12-18 12:07:50,819 INFO L226 Difference]: Without dead ends: 23073 [2019-12-18 12:07:50,820 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 12:07:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-18 12:07:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-18 12:07:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-18 12:07:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-18 12:07:51,104 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-18 12:07:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:51,104 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-18 12:07:51,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-18 12:07:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:07:51,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:51,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:51,117 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:51,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:51,118 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-18 12:07:51,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:51,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864499555] [2019-12-18 12:07:51,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:51,198 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 12:07:51,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864499555] [2019-12-18 12:07:51,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:51,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:07:51,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267601141] [2019-12-18 12:07:51,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:07:51,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:51,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:07:51,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:07:51,200 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-18 12:07:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:51,727 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-18 12:07:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:07:51,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:07:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:51,762 INFO L225 Difference]: With dead ends: 24767 [2019-12-18 12:07:51,762 INFO L226 Difference]: Without dead ends: 24767 [2019-12-18 12:07:51,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:07:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-18 12:07:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-18 12:07:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-18 12:07:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-18 12:07:52,084 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-18 12:07:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:52,084 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-18 12:07:52,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:07:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-18 12:07:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:07:52,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:52,106 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] [2019-12-18 12:07:52,106 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:52,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-18 12:07:52,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:52,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094307072] [2019-12-18 12:07:52,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:52,217 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 12:07:52,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094307072] [2019-12-18 12:07:52,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:52,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:07:52,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380387383] [2019-12-18 12:07:52,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:07:52,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:07:52,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:07:52,220 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-18 12:07:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:53,434 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-18 12:07:53,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:07:53,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:07:53,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:53,471 INFO L225 Difference]: With dead ends: 27601 [2019-12-18 12:07:53,471 INFO L226 Difference]: Without dead ends: 27601 [2019-12-18 12:07:53,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:07:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-18 12:07:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-18 12:07:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-18 12:07:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-18 12:07:53,931 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-18 12:07:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:53,932 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-18 12:07:53,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:07:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-18 12:07:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:07:53,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:53,955 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] [2019-12-18 12:07:53,955 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:53,955 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-18 12:07:53,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:53,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220076758] [2019-12-18 12:07:53,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:54,012 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 12:07:54,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220076758] [2019-12-18 12:07:54,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:54,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:07:54,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625515511] [2019-12-18 12:07:54,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:54,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:54,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:54,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:54,014 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-18 12:07:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:54,086 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-18 12:07:54,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:54,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:07:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:54,111 INFO L225 Difference]: With dead ends: 18411 [2019-12-18 12:07:54,111 INFO L226 Difference]: Without dead ends: 18411 [2019-12-18 12:07:54,112 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 12:07:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-18 12:07:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-18 12:07:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-18 12:07:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-18 12:07:54,369 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-18 12:07:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:54,369 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-18 12:07:54,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-18 12:07:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:07:54,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:54,393 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] [2019-12-18 12:07:54,393 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:54,393 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-18 12:07:54,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:54,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233558030] [2019-12-18 12:07:54,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:54,493 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 12:07:54,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233558030] [2019-12-18 12:07:54,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:54,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:07:54,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297543368] [2019-12-18 12:07:54,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:54,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:54,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:54,495 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-18 12:07:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:54,593 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-18 12:07:54,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:54,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:07:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:54,632 INFO L225 Difference]: With dead ends: 18325 [2019-12-18 12:07:54,633 INFO L226 Difference]: Without dead ends: 18325 [2019-12-18 12:07:54,633 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 12:07:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-18 12:07:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-18 12:07:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-18 12:07:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-18 12:07:55,039 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-18 12:07:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:55,040 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-18 12:07:55,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-18 12:07:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:07:55,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:55,069 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] [2019-12-18 12:07:55,069 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:55,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-18 12:07:55,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:55,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458946615] [2019-12-18 12:07:55,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:55,129 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 12:07:55,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458946615] [2019-12-18 12:07:55,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:55,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:07:55,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905303208] [2019-12-18 12:07:55,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:07:55,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:55,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:07:55,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:07:55,131 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 5 states. [2019-12-18 12:07:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:55,224 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-18 12:07:55,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:07:55,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 12:07:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:55,252 INFO L225 Difference]: With dead ends: 15143 [2019-12-18 12:07:55,253 INFO L226 Difference]: Without dead ends: 15143 [2019-12-18 12:07:55,253 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 12:07:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-18 12:07:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-18 12:07:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-18 12:07:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-18 12:07:55,489 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-18 12:07:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:55,490 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-18 12:07:55,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:07:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-18 12:07:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:07:55,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:55,508 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 12:07:55,508 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:55,508 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-18 12:07:55,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:55,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819473169] [2019-12-18 12:07:55,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:55,561 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 12:07:55,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819473169] [2019-12-18 12:07:55,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:55,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:07:55,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249987323] [2019-12-18 12:07:55,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:55,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:55,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:55,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:55,563 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-18 12:07:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:55,806 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-18 12:07:55,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:55,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:07:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:55,840 INFO L225 Difference]: With dead ends: 19655 [2019-12-18 12:07:55,841 INFO L226 Difference]: Without dead ends: 19655 [2019-12-18 12:07:55,841 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 12:07:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-18 12:07:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-18 12:07:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-18 12:07:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-18 12:07:56,129 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-18 12:07:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:56,130 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-18 12:07:56,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-18 12:07:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:07:56,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:56,152 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 12:07:56,152 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-18 12:07:56,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:56,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278276527] [2019-12-18 12:07:56,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:56,249 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 12:07:56,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278276527] [2019-12-18 12:07:56,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:56,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:07:56,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940571726] [2019-12-18 12:07:56,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:07:56,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:56,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:07:56,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:07:56,251 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 7 states. [2019-12-18 12:07:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:56,730 INFO L93 Difference]: Finished difference Result 43069 states and 131367 transitions. [2019-12-18 12:07:56,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:07:56,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:07:56,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:56,778 INFO L225 Difference]: With dead ends: 43069 [2019-12-18 12:07:56,779 INFO L226 Difference]: Without dead ends: 33469 [2019-12-18 12:07:56,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:07:56,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33469 states. [2019-12-18 12:07:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33469 to 18596. [2019-12-18 12:07:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-18 12:07:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-18 12:07:57,176 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-18 12:07:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:57,177 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-18 12:07:57,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:07:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-18 12:07:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:07:57,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:57,201 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 12:07:57,202 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:57,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:57,202 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-18 12:07:57,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:57,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951064587] [2019-12-18 12:07:57,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:57,297 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 12:07:57,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951064587] [2019-12-18 12:07:57,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:57,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:07:57,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251763479] [2019-12-18 12:07:57,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:07:57,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:57,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:07:57,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:07:57,299 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 7 states. [2019-12-18 12:07:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:57,908 INFO L93 Difference]: Finished difference Result 48601 states and 146797 transitions. [2019-12-18 12:07:57,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:07:57,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:07:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:57,992 INFO L225 Difference]: With dead ends: 48601 [2019-12-18 12:07:57,993 INFO L226 Difference]: Without dead ends: 35759 [2019-12-18 12:07:57,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:07:58,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35759 states. [2019-12-18 12:07:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35759 to 21981. [2019-12-18 12:07:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21981 states. [2019-12-18 12:07:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 67224 transitions. [2019-12-18 12:07:58,819 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 67224 transitions. Word has length 65 [2019-12-18 12:07:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:58,819 INFO L462 AbstractCegarLoop]: Abstraction has 21981 states and 67224 transitions. [2019-12-18 12:07:58,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:07:58,819 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 67224 transitions. [2019-12-18 12:07:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:07:58,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:58,844 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 12:07:58,844 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:58,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:58,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-18 12:07:58,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:58,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476869871] [2019-12-18 12:07:58,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:58,961 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 12:07:58,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476869871] [2019-12-18 12:07:58,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:58,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:07:58,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280747903] [2019-12-18 12:07:58,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:07:58,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:58,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:07:58,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:07:58,965 INFO L87 Difference]: Start difference. First operand 21981 states and 67224 transitions. Second operand 9 states. [2019-12-18 12:08:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:00,307 INFO L93 Difference]: Finished difference Result 65932 states and 199427 transitions. [2019-12-18 12:08:00,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:08:00,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:08:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:00,399 INFO L225 Difference]: With dead ends: 65932 [2019-12-18 12:08:00,399 INFO L226 Difference]: Without dead ends: 63310 [2019-12-18 12:08:00,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:08:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-18 12:08:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 22137. [2019-12-18 12:08:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22137 states. [2019-12-18 12:08:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22137 states to 22137 states and 67886 transitions. [2019-12-18 12:08:01,053 INFO L78 Accepts]: Start accepts. Automaton has 22137 states and 67886 transitions. Word has length 65 [2019-12-18 12:08:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:01,053 INFO L462 AbstractCegarLoop]: Abstraction has 22137 states and 67886 transitions. [2019-12-18 12:08:01,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:08:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 22137 states and 67886 transitions. [2019-12-18 12:08:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:08:01,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:01,076 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 12:08:01,076 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2017880016, now seen corresponding path program 4 times [2019-12-18 12:08:01,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:01,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765927199] [2019-12-18 12:08:01,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:01,197 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 12:08:01,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765927199] [2019-12-18 12:08:01,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:01,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:08:01,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007429126] [2019-12-18 12:08:01,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:08:01,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:01,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:08:01,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:08:01,199 INFO L87 Difference]: Start difference. First operand 22137 states and 67886 transitions. Second operand 9 states. [2019-12-18 12:08:01,594 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-18 12:08:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:02,567 INFO L93 Difference]: Finished difference Result 78329 states and 236465 transitions. [2019-12-18 12:08:02,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:08:02,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:08:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:02,685 INFO L225 Difference]: With dead ends: 78329 [2019-12-18 12:08:02,685 INFO L226 Difference]: Without dead ends: 75771 [2019-12-18 12:08:02,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:08:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75771 states. [2019-12-18 12:08:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75771 to 22174. [2019-12-18 12:08:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22174 states. [2019-12-18 12:08:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22174 states to 22174 states and 68084 transitions. [2019-12-18 12:08:03,428 INFO L78 Accepts]: Start accepts. Automaton has 22174 states and 68084 transitions. Word has length 65 [2019-12-18 12:08:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:03,428 INFO L462 AbstractCegarLoop]: Abstraction has 22174 states and 68084 transitions. [2019-12-18 12:08:03,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:08:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 22174 states and 68084 transitions. [2019-12-18 12:08:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:08:03,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:03,452 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 12:08:03,452 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 5 times [2019-12-18 12:08:03,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:03,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416334019] [2019-12-18 12:08:03,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:03,510 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 12:08:03,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416334019] [2019-12-18 12:08:03,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:03,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:03,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760126655] [2019-12-18 12:08:03,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:03,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:03,517 INFO L87 Difference]: Start difference. First operand 22174 states and 68084 transitions. Second operand 3 states. [2019-12-18 12:08:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:03,645 INFO L93 Difference]: Finished difference Result 25241 states and 77567 transitions. [2019-12-18 12:08:03,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:03,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:08:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:03,680 INFO L225 Difference]: With dead ends: 25241 [2019-12-18 12:08:03,680 INFO L226 Difference]: Without dead ends: 25241 [2019-12-18 12:08:03,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 12:08:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25241 states. [2019-12-18 12:08:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25241 to 21050. [2019-12-18 12:08:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21050 states. [2019-12-18 12:08:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21050 states to 21050 states and 65371 transitions. [2019-12-18 12:08:04,252 INFO L78 Accepts]: Start accepts. Automaton has 21050 states and 65371 transitions. Word has length 65 [2019-12-18 12:08:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:04,252 INFO L462 AbstractCegarLoop]: Abstraction has 21050 states and 65371 transitions. [2019-12-18 12:08:04,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 21050 states and 65371 transitions. [2019-12-18 12:08:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:04,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:04,273 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 12:08:04,273 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:04,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:04,274 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-18 12:08:04,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:04,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954346124] [2019-12-18 12:08:04,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:04,366 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 12:08:04,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954346124] [2019-12-18 12:08:04,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:04,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:08:04,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754534919] [2019-12-18 12:08:04,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:08:04,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:04,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:08:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:08:04,368 INFO L87 Difference]: Start difference. First operand 21050 states and 65371 transitions. Second operand 8 states. [2019-12-18 12:08:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:05,258 INFO L93 Difference]: Finished difference Result 52001 states and 158465 transitions. [2019-12-18 12:08:05,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:08:05,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:08:05,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:05,327 INFO L225 Difference]: With dead ends: 52001 [2019-12-18 12:08:05,327 INFO L226 Difference]: Without dead ends: 48845 [2019-12-18 12:08:05,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:08:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48845 states. [2019-12-18 12:08:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48845 to 21134. [2019-12-18 12:08:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21134 states. [2019-12-18 12:08:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21134 states to 21134 states and 65711 transitions. [2019-12-18 12:08:05,836 INFO L78 Accepts]: Start accepts. Automaton has 21134 states and 65711 transitions. Word has length 66 [2019-12-18 12:08:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:05,836 INFO L462 AbstractCegarLoop]: Abstraction has 21134 states and 65711 transitions. [2019-12-18 12:08:05,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:08:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 21134 states and 65711 transitions. [2019-12-18 12:08:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:05,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:05,861 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 12:08:05,861 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-18 12:08:05,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:05,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613696687] [2019-12-18 12:08:05,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:05,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613696687] [2019-12-18 12:08:05,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:05,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:08:05,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883217309] [2019-12-18 12:08:05,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:08:05,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:05,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:08:05,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:08:05,979 INFO L87 Difference]: Start difference. First operand 21134 states and 65711 transitions. Second operand 9 states. [2019-12-18 12:08:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:07,426 INFO L93 Difference]: Finished difference Result 59225 states and 178920 transitions. [2019-12-18 12:08:07,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:08:07,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:08:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:07,565 INFO L225 Difference]: With dead ends: 59225 [2019-12-18 12:08:07,565 INFO L226 Difference]: Without dead ends: 56069 [2019-12-18 12:08:07,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:08:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56069 states. [2019-12-18 12:08:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56069 to 21156. [2019-12-18 12:08:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21156 states. [2019-12-18 12:08:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21156 states to 21156 states and 65782 transitions. [2019-12-18 12:08:08,548 INFO L78 Accepts]: Start accepts. Automaton has 21156 states and 65782 transitions. Word has length 66 [2019-12-18 12:08:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:08,549 INFO L462 AbstractCegarLoop]: Abstraction has 21156 states and 65782 transitions. [2019-12-18 12:08:08,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:08:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 21156 states and 65782 transitions. [2019-12-18 12:08:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:08,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:08,570 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 12:08:08,570 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-18 12:08:08,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:08,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696195391] [2019-12-18 12:08:08,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:08,701 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 12:08:08,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696195391] [2019-12-18 12:08:08,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:08,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:08:08,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000500413] [2019-12-18 12:08:08,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:08:08,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:08:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:08:08,704 INFO L87 Difference]: Start difference. First operand 21156 states and 65782 transitions. Second operand 9 states. [2019-12-18 12:08:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:10,015 INFO L93 Difference]: Finished difference Result 65701 states and 198070 transitions. [2019-12-18 12:08:10,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:08:10,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:08:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:10,101 INFO L225 Difference]: With dead ends: 65701 [2019-12-18 12:08:10,101 INFO L226 Difference]: Without dead ends: 62568 [2019-12-18 12:08:10,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:08:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62568 states. [2019-12-18 12:08:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62568 to 21037. [2019-12-18 12:08:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21037 states. [2019-12-18 12:08:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21037 states to 21037 states and 65199 transitions. [2019-12-18 12:08:10,703 INFO L78 Accepts]: Start accepts. Automaton has 21037 states and 65199 transitions. Word has length 66 [2019-12-18 12:08:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:10,703 INFO L462 AbstractCegarLoop]: Abstraction has 21037 states and 65199 transitions. [2019-12-18 12:08:10,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:08:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 21037 states and 65199 transitions. [2019-12-18 12:08:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:10,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:10,727 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 12:08:10,727 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-18 12:08:10,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:10,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533141036] [2019-12-18 12:08:10,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:10,841 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 12:08:10,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533141036] [2019-12-18 12:08:10,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:10,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:08:10,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981131055] [2019-12-18 12:08:10,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:08:10,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:10,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:08:10,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:10,843 INFO L87 Difference]: Start difference. First operand 21037 states and 65199 transitions. Second operand 7 states. [2019-12-18 12:08:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:11,614 INFO L93 Difference]: Finished difference Result 33222 states and 101569 transitions. [2019-12-18 12:08:11,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:08:11,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 12:08:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:11,859 INFO L225 Difference]: With dead ends: 33222 [2019-12-18 12:08:11,859 INFO L226 Difference]: Without dead ends: 33222 [2019-12-18 12:08:11,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:08:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33222 states. [2019-12-18 12:08:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33222 to 20376. [2019-12-18 12:08:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20376 states. [2019-12-18 12:08:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20376 states to 20376 states and 62283 transitions. [2019-12-18 12:08:12,226 INFO L78 Accepts]: Start accepts. Automaton has 20376 states and 62283 transitions. Word has length 66 [2019-12-18 12:08:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:12,226 INFO L462 AbstractCegarLoop]: Abstraction has 20376 states and 62283 transitions. [2019-12-18 12:08:12,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:08:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 20376 states and 62283 transitions. [2019-12-18 12:08:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:12,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:12,247 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:12,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:12,247 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-18 12:08:12,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:12,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734373287] [2019-12-18 12:08:12,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:12,313 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 12:08:12,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734373287] [2019-12-18 12:08:12,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:12,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:12,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623830901] [2019-12-18 12:08:12,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:08:12,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:08:12,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:08:12,317 INFO L87 Difference]: Start difference. First operand 20376 states and 62283 transitions. Second operand 4 states. [2019-12-18 12:08:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:12,461 INFO L93 Difference]: Finished difference Result 20191 states and 61547 transitions. [2019-12-18 12:08:12,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:08:12,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:08:12,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:12,495 INFO L225 Difference]: With dead ends: 20191 [2019-12-18 12:08:12,496 INFO L226 Difference]: Without dead ends: 20191 [2019-12-18 12:08:12,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 12:08:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2019-12-18 12:08:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 18496. [2019-12-18 12:08:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18496 states. [2019-12-18 12:08:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18496 states to 18496 states and 56455 transitions. [2019-12-18 12:08:12,775 INFO L78 Accepts]: Start accepts. Automaton has 18496 states and 56455 transitions. Word has length 66 [2019-12-18 12:08:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:12,775 INFO L462 AbstractCegarLoop]: Abstraction has 18496 states and 56455 transitions. [2019-12-18 12:08:12,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:08:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 18496 states and 56455 transitions. [2019-12-18 12:08:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:12,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:12,798 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 12:08:12,798 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:12,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:12,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-18 12:08:12,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:12,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468485588] [2019-12-18 12:08:12,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:12,860 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 12:08:12,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468485588] [2019-12-18 12:08:12,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:12,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:12,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362973555] [2019-12-18 12:08:12,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:12,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:12,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:12,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:12,862 INFO L87 Difference]: Start difference. First operand 18496 states and 56455 transitions. Second operand 3 states. [2019-12-18 12:08:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:12,936 INFO L93 Difference]: Finished difference Result 16117 states and 48226 transitions. [2019-12-18 12:08:12,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:12,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:08:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:12,967 INFO L225 Difference]: With dead ends: 16117 [2019-12-18 12:08:12,967 INFO L226 Difference]: Without dead ends: 16117 [2019-12-18 12:08:12,968 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 12:08:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16117 states. [2019-12-18 12:08:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16117 to 14647. [2019-12-18 12:08:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14647 states. [2019-12-18 12:08:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14647 states to 14647 states and 43816 transitions. [2019-12-18 12:08:13,229 INFO L78 Accepts]: Start accepts. Automaton has 14647 states and 43816 transitions. Word has length 66 [2019-12-18 12:08:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:13,229 INFO L462 AbstractCegarLoop]: Abstraction has 14647 states and 43816 transitions. [2019-12-18 12:08:13,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 14647 states and 43816 transitions. [2019-12-18 12:08:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:08:13,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:13,244 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 12:08:13,244 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-18 12:08:13,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:13,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631706735] [2019-12-18 12:08:13,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:13,345 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 12:08:13,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631706735] [2019-12-18 12:08:13,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:13,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:08:13,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478463453] [2019-12-18 12:08:13,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:08:13,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:13,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:08:13,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:08:13,347 INFO L87 Difference]: Start difference. First operand 14647 states and 43816 transitions. Second operand 9 states. [2019-12-18 12:08:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:14,688 INFO L93 Difference]: Finished difference Result 28454 states and 84160 transitions. [2019-12-18 12:08:14,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:08:14,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:08:14,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:14,720 INFO L225 Difference]: With dead ends: 28454 [2019-12-18 12:08:14,720 INFO L226 Difference]: Without dead ends: 23657 [2019-12-18 12:08:14,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:08:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23657 states. [2019-12-18 12:08:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23657 to 15071. [2019-12-18 12:08:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15071 states. [2019-12-18 12:08:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15071 states to 15071 states and 44798 transitions. [2019-12-18 12:08:15,135 INFO L78 Accepts]: Start accepts. Automaton has 15071 states and 44798 transitions. Word has length 67 [2019-12-18 12:08:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:15,135 INFO L462 AbstractCegarLoop]: Abstraction has 15071 states and 44798 transitions. [2019-12-18 12:08:15,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:08:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 15071 states and 44798 transitions. [2019-12-18 12:08:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:08:15,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:15,150 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 12:08:15,150 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-18 12:08:15,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:15,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788639303] [2019-12-18 12:08:15,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:15,297 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 12:08:15,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788639303] [2019-12-18 12:08:15,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:15,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:08:15,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428272698] [2019-12-18 12:08:15,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:08:15,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:08:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:08:15,298 INFO L87 Difference]: Start difference. First operand 15071 states and 44798 transitions. Second operand 11 states. [2019-12-18 12:08:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:16,364 INFO L93 Difference]: Finished difference Result 31554 states and 93034 transitions. [2019-12-18 12:08:16,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:08:16,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:08:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:16,398 INFO L225 Difference]: With dead ends: 31554 [2019-12-18 12:08:16,398 INFO L226 Difference]: Without dead ends: 25553 [2019-12-18 12:08:16,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:08:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25553 states. [2019-12-18 12:08:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25553 to 14407. [2019-12-18 12:08:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14407 states. [2019-12-18 12:08:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14407 states to 14407 states and 42784 transitions. [2019-12-18 12:08:16,683 INFO L78 Accepts]: Start accepts. Automaton has 14407 states and 42784 transitions. Word has length 67 [2019-12-18 12:08:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:16,683 INFO L462 AbstractCegarLoop]: Abstraction has 14407 states and 42784 transitions. [2019-12-18 12:08:16,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:08:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 14407 states and 42784 transitions. [2019-12-18 12:08:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:08:16,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:16,697 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 12:08:16,698 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:16,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 3 times [2019-12-18 12:08:16,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:16,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396682787] [2019-12-18 12:08:16,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:17,006 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 12:08:17,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396682787] [2019-12-18 12:08:17,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:17,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 12:08:17,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083020194] [2019-12-18 12:08:17,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 12:08:17,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 12:08:17,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:08:17,007 INFO L87 Difference]: Start difference. First operand 14407 states and 42784 transitions. Second operand 14 states. [2019-12-18 12:08:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:19,526 INFO L93 Difference]: Finished difference Result 19228 states and 56091 transitions. [2019-12-18 12:08:19,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 12:08:19,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 12:08:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:19,552 INFO L225 Difference]: With dead ends: 19228 [2019-12-18 12:08:19,552 INFO L226 Difference]: Without dead ends: 18693 [2019-12-18 12:08:19,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 12:08:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18693 states. [2019-12-18 12:08:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18693 to 14913. [2019-12-18 12:08:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14913 states. [2019-12-18 12:08:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14913 states to 14913 states and 44240 transitions. [2019-12-18 12:08:19,785 INFO L78 Accepts]: Start accepts. Automaton has 14913 states and 44240 transitions. Word has length 67 [2019-12-18 12:08:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:19,785 INFO L462 AbstractCegarLoop]: Abstraction has 14913 states and 44240 transitions. [2019-12-18 12:08:19,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 12:08:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 14913 states and 44240 transitions. [2019-12-18 12:08:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:08:19,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:19,799 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 12:08:19,799 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:08:19,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:19,799 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 4 times [2019-12-18 12:08:19,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:19,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833055186] [2019-12-18 12:08:19,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:08:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:08:19,920 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:08:19,920 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:08:19,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t56~0.offset_18|) (= v_~__unbuffered_cnt~0_134 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t56~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t56~0.base_23|) |v_ULTIMATE.start_main_~#t56~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t56~0.base_23| 1)) (= 0 v_~__unbuffered_p0_EAX~0_60) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t56~0.base_23| 4) |v_#length_23|) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t56~0.base_23|) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_22 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t56~0.base_23|)) (= v_~z~0_20 0) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_~#t58~0.offset=|v_ULTIMATE.start_main_~#t58~0.offset_15|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ULTIMATE.start_main_~#t57~0.offset=|v_ULTIMATE.start_main_~#t57~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t58~0.base=|v_ULTIMATE.start_main_~#t58~0.base_20|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t56~0.offset=|v_ULTIMATE.start_main_~#t56~0.offset_18|, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ULTIMATE.start_main_~#t57~0.base=|v_ULTIMATE.start_main_~#t57~0.base_23|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t56~0.base=|v_ULTIMATE.start_main_~#t56~0.base_23|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t58~0.offset, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t57~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t58~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t56~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t57~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t56~0.base] because there is no mapped edge [2019-12-18 12:08:19,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out2094441146| P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out2094441146) (= 0 (mod ~a$w_buff1_used~0_Out2094441146 256)) (= |P0Thread1of1ForFork2_#in~arg.base_In2094441146| P0Thread1of1ForFork2_~arg.base_Out2094441146) (= ~a$w_buff0_used~0_In2094441146 ~a$w_buff1_used~0_Out2094441146) (= ~a$w_buff0~0_Out2094441146 1) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out2094441146| 1) (= |P0Thread1of1ForFork2_#in~arg.offset_In2094441146| P0Thread1of1ForFork2_~arg.offset_Out2094441146) (= ~a$w_buff0_used~0_Out2094441146 1) (= ~a$w_buff0~0_In2094441146 ~a$w_buff1~0_Out2094441146)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In2094441146|, ~a$w_buff0~0=~a$w_buff0~0_In2094441146, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2094441146, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In2094441146|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out2094441146, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In2094441146|, ~a$w_buff0~0=~a$w_buff0~0_Out2094441146, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out2094441146, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out2094441146, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out2094441146, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In2094441146|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out2094441146, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out2094441146, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out2094441146|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:08:19,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t57~0.base_13| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t57~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t57~0.base_13|) |v_ULTIMATE.start_main_~#t57~0.offset_11| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t57~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t57~0.offset_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t57~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t57~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t57~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t57~0.offset=|v_ULTIMATE.start_main_~#t57~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t57~0.base=|v_ULTIMATE.start_main_~#t57~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t57~0.offset, ULTIMATE.start_main_~#t57~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:08:19,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In326428216 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite10_Out326428216| |P1Thread1of1ForFork0_#t~ite9_Out326428216|)) (.cse1 (= (mod ~a$w_buff1_used~0_In326428216 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~a~0_In326428216 |P1Thread1of1ForFork0_#t~ite9_Out326428216|)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite9_Out326428216| ~a$w_buff1~0_In326428216) .cse2 (not .cse1)))) InVars {~a~0=~a~0_In326428216, ~a$w_buff1~0=~a$w_buff1~0_In326428216, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In326428216, ~a$w_buff1_used~0=~a$w_buff1_used~0_In326428216} OutVars{~a~0=~a~0_In326428216, ~a$w_buff1~0=~a$w_buff1~0_In326428216, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out326428216|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In326428216, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out326428216|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In326428216} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 12:08:19,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In897581145 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In897581145 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out897581145| ~a$w_buff0_used~0_In897581145)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out897581145| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In897581145, ~a$w_buff0_used~0=~a$w_buff0_used~0_In897581145} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In897581145, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out897581145|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In897581145} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 12:08:19,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1307109536 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1307109536 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In1307109536 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1307109536 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite12_Out1307109536| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite12_Out1307109536| ~a$w_buff1_used~0_In1307109536) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1307109536, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1307109536, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1307109536, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1307109536} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1307109536, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1307109536, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1307109536|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1307109536, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1307109536} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 12:08:19,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1739803900 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1739803900 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1739803900|) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In1739803900 |P1Thread1of1ForFork0_#t~ite13_Out1739803900|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1739803900, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1739803900} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1739803900, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1739803900, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1739803900|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 12:08:19,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In85979247 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In85979247 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In85979247 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In85979247 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out85979247|)) (and (= |P1Thread1of1ForFork0_#t~ite14_Out85979247| ~a$r_buff1_thd2~0_In85979247) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In85979247, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In85979247, ~a$w_buff0_used~0=~a$w_buff0_used~0_In85979247, ~a$w_buff1_used~0=~a$w_buff1_used~0_In85979247} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In85979247, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In85979247, ~a$w_buff0_used~0=~a$w_buff0_used~0_In85979247, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out85979247|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In85979247} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 12:08:19,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_28|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_27|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 12:08:19,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t58~0.base_12| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t58~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t58~0.base_12|) |v_ULTIMATE.start_main_~#t58~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t58~0.base_12|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t58~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t58~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t58~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t58~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t58~0.offset=|v_ULTIMATE.start_main_~#t58~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t58~0.base=|v_ULTIMATE.start_main_~#t58~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t58~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t58~0.base] because there is no mapped edge [2019-12-18 12:08:19,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In847727256 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite21_Out847727256| ~a$w_buff0~0_In847727256) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In847727256| |P2Thread1of1ForFork1_#t~ite20_Out847727256|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In847727256 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In847727256 256) 0)) (= (mod ~a$w_buff0_used~0_In847727256 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In847727256 256))))) (= |P2Thread1of1ForFork1_#t~ite21_Out847727256| |P2Thread1of1ForFork1_#t~ite20_Out847727256|) (= ~a$w_buff0~0_In847727256 |P2Thread1of1ForFork1_#t~ite20_Out847727256|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In847727256|, ~a$w_buff0~0=~a$w_buff0~0_In847727256, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In847727256, ~a$w_buff0_used~0=~a$w_buff0_used~0_In847727256, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In847727256, ~a$w_buff1_used~0=~a$w_buff1_used~0_In847727256, ~weak$$choice2~0=~weak$$choice2~0_In847727256} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out847727256|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out847727256|, ~a$w_buff0~0=~a$w_buff0~0_In847727256, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In847727256, ~a$w_buff0_used~0=~a$w_buff0_used~0_In847727256, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In847727256, ~a$w_buff1_used~0=~a$w_buff1_used~0_In847727256, ~weak$$choice2~0=~weak$$choice2~0_In847727256} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 12:08:19,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1032845856 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out1032845856| ~a$w_buff0_used~0_In1032845856) (= |P2Thread1of1ForFork1_#t~ite26_In1032845856| |P2Thread1of1ForFork1_#t~ite26_Out1032845856|)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out1032845856| |P2Thread1of1ForFork1_#t~ite26_Out1032845856|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1032845856 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In1032845856 256)) (and (= 0 (mod ~a$w_buff1_used~0_In1032845856 256)) .cse1) (and (= 0 (mod ~a$r_buff1_thd3~0_In1032845856 256)) .cse1))) (= ~a$w_buff0_used~0_In1032845856 |P2Thread1of1ForFork1_#t~ite26_Out1032845856|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In1032845856|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1032845856, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1032845856, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1032845856, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1032845856, ~weak$$choice2~0=~weak$$choice2~0_In1032845856} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out1032845856|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out1032845856|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1032845856, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1032845856, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1032845856, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1032845856, ~weak$$choice2~0=~weak$$choice2~0_In1032845856} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-18 12:08:19,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 12:08:19,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:08:19,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-648731769 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-648731769 256)))) (or (and (= ~a~0_In-648731769 |P2Thread1of1ForFork1_#t~ite38_Out-648731769|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-648731769 |P2Thread1of1ForFork1_#t~ite38_Out-648731769|)))) InVars {~a~0=~a~0_In-648731769, ~a$w_buff1~0=~a$w_buff1~0_In-648731769, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-648731769, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-648731769} OutVars{~a~0=~a~0_In-648731769, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-648731769|, ~a$w_buff1~0=~a$w_buff1~0_In-648731769, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-648731769, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-648731769} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-18 12:08:19,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_14|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_14|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_13|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-18 12:08:19,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-495189186 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-495189186 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite40_Out-495189186| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-495189186| ~a$w_buff0_used~0_In-495189186)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-495189186, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-495189186} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-495189186, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-495189186, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-495189186|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-18 12:08:19,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In357408573 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In357408573 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In357408573 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In357408573 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite41_Out357408573| ~a$w_buff1_used~0_In357408573)) (and (= |P2Thread1of1ForFork1_#t~ite41_Out357408573| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In357408573, ~a$w_buff0_used~0=~a$w_buff0_used~0_In357408573, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In357408573, ~a$w_buff1_used~0=~a$w_buff1_used~0_In357408573} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In357408573, ~a$w_buff0_used~0=~a$w_buff0_used~0_In357408573, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In357408573, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out357408573|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In357408573} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-18 12:08:19,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In2138410152 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2138410152 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite42_Out2138410152| ~a$r_buff0_thd3~0_In2138410152) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out2138410152| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2138410152, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2138410152} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out2138410152|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2138410152, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2138410152} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-18 12:08:19,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd3~0_In-172763309 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-172763309 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-172763309 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-172763309 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite43_Out-172763309| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite43_Out-172763309| ~a$r_buff1_thd3~0_In-172763309)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-172763309, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-172763309, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-172763309, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-172763309} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-172763309|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-172763309, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-172763309, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-172763309, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-172763309} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 12:08:19,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_34|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 12:08:19,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1325006035 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1325006035 256) 0))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite5_Out1325006035|) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In1325006035 |P0Thread1of1ForFork2_#t~ite5_Out1325006035|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1325006035, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1325006035} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1325006035|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1325006035, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1325006035} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 12:08:19,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In1677651192 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1677651192 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1677651192 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In1677651192 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite6_Out1677651192| ~a$w_buff1_used~0_In1677651192)) (and (= |P0Thread1of1ForFork2_#t~ite6_Out1677651192| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1677651192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1677651192, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1677651192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1677651192} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1677651192, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1677651192|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1677651192, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1677651192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1677651192} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 12:08:19,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-98746908 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-98746908 256)))) (or (and (= 0 ~a$r_buff0_thd1~0_Out-98746908) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_In-98746908 ~a$r_buff0_thd1~0_Out-98746908)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-98746908, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-98746908} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-98746908|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-98746908, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-98746908} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:08:19,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1540893326 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1540893326 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-1540893326 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1540893326 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out-1540893326| ~a$r_buff1_thd1~0_In-1540893326) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork2_#t~ite8_Out-1540893326| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1540893326, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1540893326, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1540893326, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1540893326} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1540893326|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1540893326, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1540893326, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1540893326, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1540893326} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 12:08:19,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_44| v_~a$r_buff1_thd1~0_72) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_43|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:08:19,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:08:19,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-898283531 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-898283531 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In-898283531 |ULTIMATE.start_main_#t~ite47_Out-898283531|) (not .cse1)) (and (= ~a~0_In-898283531 |ULTIMATE.start_main_#t~ite47_Out-898283531|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-898283531, ~a$w_buff1~0=~a$w_buff1~0_In-898283531, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-898283531, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-898283531} OutVars{~a~0=~a~0_In-898283531, ~a$w_buff1~0=~a$w_buff1~0_In-898283531, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-898283531|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-898283531, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-898283531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:08:19,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:08:19,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-838049762 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-838049762 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-838049762|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-838049762 |ULTIMATE.start_main_#t~ite49_Out-838049762|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-838049762, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-838049762} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-838049762, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-838049762|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-838049762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:08:19,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1161856269 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1161856269 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1161856269 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-1161856269 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1161856269 |ULTIMATE.start_main_#t~ite50_Out-1161856269|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1161856269|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1161856269, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1161856269, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1161856269, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1161856269} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1161856269|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1161856269, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1161856269, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1161856269, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1161856269} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:08:19,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1385947753 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1385947753 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1385947753 |ULTIMATE.start_main_#t~ite51_Out1385947753|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1385947753| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1385947753, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1385947753} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1385947753|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1385947753, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1385947753} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:08:19,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1745613586 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1745613586 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1745613586 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1745613586 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1745613586| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1745613586| ~a$r_buff1_thd0~0_In-1745613586) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1745613586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745613586, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1745613586, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1745613586} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1745613586|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1745613586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745613586, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1745613586, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1745613586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:08:19,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:08:20,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:08:20 BasicIcfg [2019-12-18 12:08:20,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:08:20,215 INFO L168 Benchmark]: Toolchain (without parser) took 102995.41 ms. Allocated memory was 138.9 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 100.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 12:08:20,219 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 12:08:20,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.65 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 156.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:08:20,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.04 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:08:20,223 INFO L168 Benchmark]: Boogie Preprocessor took 46.93 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:08:20,224 INFO L168 Benchmark]: RCFGBuilder took 894.50 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 100.4 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:08:20,225 INFO L168 Benchmark]: TraceAbstraction took 101172.58 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 12:08:20,231 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.65 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 156.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.04 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.93 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 894.50 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 100.4 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101172.58 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t56, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t57, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t58, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 100.6s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 32.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6777 SDtfs, 9819 SDslu, 22336 SDs, 0 SdLazy, 10413 SolverSat, 480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 342553 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1351 NumberOfCodeBlocks, 1351 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1257 ConstructedInterpolants, 0 QuantifiedInterpolants, 254896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...