/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:10:31,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:10:31,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:10:31,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:10:31,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:10:31,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:10:31,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:10:31,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:10:31,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:10:31,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:10:31,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:10:31,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:10:31,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:10:31,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:10:31,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:10:31,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:10:31,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:10:31,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:10:31,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:10:31,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:10:31,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:10:31,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:10:31,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:10:31,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:10:31,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:10:31,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:10:31,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:10:31,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:10:31,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:10:31,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:10:31,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:10:31,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:10:31,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:10:31,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:10:31,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:10:31,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:10:31,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:10:31,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:10:31,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:10:31,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:10:31,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:10:31,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:10:31,986 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:10:31,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:10:31,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:10:31,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:10:31,988 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:10:31,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:10:31,988 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:10:31,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:10:31,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:10:31,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:10:31,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:10:31,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:10:31,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:10:31,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:10:31,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:10:31,990 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:10:31,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:10:31,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:10:31,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:10:31,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:10:31,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:10:31,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:10:31,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:10:31,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:10:31,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:10:31,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:10:31,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:10:31,993 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:10:31,993 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:10:31,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:10:31,993 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:10:31,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:10:32,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:10:32,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:10:32,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:10:32,306 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:10:32,307 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:10:32,307 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i [2019-12-27 20:10:32,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69ed1aef/bffe9e62a6a84bd5adc49895aab3a096/FLAG68b2cd1f0 [2019-12-27 20:10:32,933 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:10:32,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i [2019-12-27 20:10:32,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69ed1aef/bffe9e62a6a84bd5adc49895aab3a096/FLAG68b2cd1f0 [2019-12-27 20:10:33,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69ed1aef/bffe9e62a6a84bd5adc49895aab3a096 [2019-12-27 20:10:33,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:10:33,220 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:10:33,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:10:33,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:10:33,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:10:33,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:10:33" (1/1) ... [2019-12-27 20:10:33,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef2d690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:33, skipping insertion in model container [2019-12-27 20:10:33,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:10:33" (1/1) ... [2019-12-27 20:10:33,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:10:33,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:10:33,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:10:33,862 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:10:33,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:10:34,103 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:10:34,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34 WrapperNode [2019-12-27 20:10:34,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:10:34,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:10:34,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:10:34,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:10:34,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (1/1) ... [2019-12-27 20:10:34,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (1/1) ... [2019-12-27 20:10:34,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:10:34,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:10:34,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:10:34,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:10:34,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (1/1) ... [2019-12-27 20:10:34,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (1/1) ... [2019-12-27 20:10:34,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (1/1) ... [2019-12-27 20:10:34,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (1/1) ... [2019-12-27 20:10:34,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (1/1) ... [2019-12-27 20:10:34,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (1/1) ... [2019-12-27 20:10:34,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (1/1) ... [2019-12-27 20:10:34,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:10:34,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:10:34,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:10:34,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:10:34,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:10:34,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:10:34,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:10:34,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:10:34,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:10:34,370 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:10:34,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:10:34,371 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:10:34,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:10:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:10:34,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:10:34,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:10:34,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:10:34,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:10:34,375 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:10:35,223 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:10:35,224 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:10:35,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:10:35 BoogieIcfgContainer [2019-12-27 20:10:35,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:10:35,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:10:35,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:10:35,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:10:35,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:10:33" (1/3) ... [2019-12-27 20:10:35,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f84e04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:10:35, skipping insertion in model container [2019-12-27 20:10:35,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:34" (2/3) ... [2019-12-27 20:10:35,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f84e04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:10:35, skipping insertion in model container [2019-12-27 20:10:35,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:10:35" (3/3) ... [2019-12-27 20:10:35,236 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_power.opt.i [2019-12-27 20:10:35,247 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:10:35,247 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:10:35,256 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:10:35,257 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:10:35,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,299 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,340 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,348 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,348 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,362 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,363 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,366 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:10:35,388 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:10:35,409 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:10:35,409 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:10:35,409 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:10:35,409 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:10:35,409 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:10:35,409 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:10:35,410 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:10:35,410 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:10:35,435 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 20:10:35,438 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 20:10:35,544 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 20:10:35,545 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:10:35,561 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:10:35,584 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 20:10:35,637 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 20:10:35,637 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:10:35,645 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:10:35,665 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 20:10:35,666 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:10:39,330 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 20:10:39,468 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 20:10:39,562 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79642 [2019-12-27 20:10:39,562 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 20:10:39,565 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 94 transitions [2019-12-27 20:10:54,121 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 95102 states. [2019-12-27 20:10:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 95102 states. [2019-12-27 20:10:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:10:54,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:10:54,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:10:54,130 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:10:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:10:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash 797531429, now seen corresponding path program 1 times [2019-12-27 20:10:54,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:10:54,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104512596] [2019-12-27 20:10:54,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:10:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:10:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:10:54,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104512596] [2019-12-27 20:10:54,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:10:54,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:10:54,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1699020230] [2019-12-27 20:10:54,451 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:10:54,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:10:54,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:10:54,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:10:54,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:10:54,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:10:54,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:10:54,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:10:54,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:10:54,481 INFO L87 Difference]: Start difference. First operand 95102 states. Second operand 3 states. [2019-12-27 20:10:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:10:58,250 INFO L93 Difference]: Finished difference Result 93264 states and 402387 transitions. [2019-12-27 20:10:58,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:10:58,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:10:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:10:58,985 INFO L225 Difference]: With dead ends: 93264 [2019-12-27 20:10:58,985 INFO L226 Difference]: Without dead ends: 87384 [2019-12-27 20:10:58,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:11:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87384 states. [2019-12-27 20:11:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87384 to 87384. [2019-12-27 20:11:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87384 states. [2019-12-27 20:11:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87384 states to 87384 states and 376487 transitions. [2019-12-27 20:11:05,540 INFO L78 Accepts]: Start accepts. Automaton has 87384 states and 376487 transitions. Word has length 5 [2019-12-27 20:11:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:05,541 INFO L462 AbstractCegarLoop]: Abstraction has 87384 states and 376487 transitions. [2019-12-27 20:11:05,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:11:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 87384 states and 376487 transitions. [2019-12-27 20:11:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:11:05,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:05,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:05,550 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:05,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:05,550 INFO L82 PathProgramCache]: Analyzing trace with hash 429489199, now seen corresponding path program 1 times [2019-12-27 20:11:05,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:05,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468751670] [2019-12-27 20:11:05,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:05,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468751670] [2019-12-27 20:11:05,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:05,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:11:05,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [78380460] [2019-12-27 20:11:05,642 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:05,643 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:05,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:11:05,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:05,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:05,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:11:05,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:05,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:11:05,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:11:05,651 INFO L87 Difference]: Start difference. First operand 87384 states and 376487 transitions. Second operand 3 states. [2019-12-27 20:11:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:08,951 INFO L93 Difference]: Finished difference Result 22591 states and 78202 transitions. [2019-12-27 20:11:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:11:08,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:11:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:09,069 INFO L225 Difference]: With dead ends: 22591 [2019-12-27 20:11:09,070 INFO L226 Difference]: Without dead ends: 22591 [2019-12-27 20:11:09,070 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-27 20:11:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22591 states. [2019-12-27 20:11:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22591 to 22591. [2019-12-27 20:11:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22591 states. [2019-12-27 20:11:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22591 states to 22591 states and 78202 transitions. [2019-12-27 20:11:09,613 INFO L78 Accepts]: Start accepts. Automaton has 22591 states and 78202 transitions. Word has length 13 [2019-12-27 20:11:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:09,613 INFO L462 AbstractCegarLoop]: Abstraction has 22591 states and 78202 transitions. [2019-12-27 20:11:09,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:11:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 22591 states and 78202 transitions. [2019-12-27 20:11:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:11:09,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:09,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:09,616 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:09,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:09,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1420519725, now seen corresponding path program 1 times [2019-12-27 20:11:09,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:09,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287009451] [2019-12-27 20:11:09,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:09,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287009451] [2019-12-27 20:11:09,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:09,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:11:09,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [377161667] [2019-12-27 20:11:09,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:09,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:09,736 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:11:09,737 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:09,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:09,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:11:09,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:09,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:11:09,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:11:09,738 INFO L87 Difference]: Start difference. First operand 22591 states and 78202 transitions. Second operand 4 states. [2019-12-27 20:11:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:10,135 INFO L93 Difference]: Finished difference Result 33180 states and 110963 transitions. [2019-12-27 20:11:10,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:11:10,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:11:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:10,313 INFO L225 Difference]: With dead ends: 33180 [2019-12-27 20:11:10,314 INFO L226 Difference]: Without dead ends: 33166 [2019-12-27 20:11:10,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:11:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33166 states. [2019-12-27 20:11:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33166 to 29831. [2019-12-27 20:11:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29831 states. [2019-12-27 20:11:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29831 states to 29831 states and 100864 transitions. [2019-12-27 20:11:11,448 INFO L78 Accepts]: Start accepts. Automaton has 29831 states and 100864 transitions. Word has length 13 [2019-12-27 20:11:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:11,450 INFO L462 AbstractCegarLoop]: Abstraction has 29831 states and 100864 transitions. [2019-12-27 20:11:11,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:11:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 29831 states and 100864 transitions. [2019-12-27 20:11:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:11:11,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:11,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:11,455 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash 839242224, now seen corresponding path program 1 times [2019-12-27 20:11:11,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:11,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211867666] [2019-12-27 20:11:11,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:11,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211867666] [2019-12-27 20:11:11,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:11,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:11,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [684592591] [2019-12-27 20:11:11,583 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:11,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:11,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:11:11,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:11,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:11:11,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:11:11,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:11,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:11:11,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:11:11,668 INFO L87 Difference]: Start difference. First operand 29831 states and 100864 transitions. Second operand 7 states. [2019-12-27 20:11:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:12,356 INFO L93 Difference]: Finished difference Result 42454 states and 141193 transitions. [2019-12-27 20:11:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:11:12,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 20:11:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:12,425 INFO L225 Difference]: With dead ends: 42454 [2019-12-27 20:11:12,425 INFO L226 Difference]: Without dead ends: 42438 [2019-12-27 20:11:12,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:11:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42438 states. [2019-12-27 20:11:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42438 to 34354. [2019-12-27 20:11:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34354 states. [2019-12-27 20:11:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34354 states to 34354 states and 115309 transitions. [2019-12-27 20:11:13,387 INFO L78 Accepts]: Start accepts. Automaton has 34354 states and 115309 transitions. Word has length 14 [2019-12-27 20:11:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:13,388 INFO L462 AbstractCegarLoop]: Abstraction has 34354 states and 115309 transitions. [2019-12-27 20:11:13,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:11:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 34354 states and 115309 transitions. [2019-12-27 20:11:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:11:13,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:13,400 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-27 20:11:13,400 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1523113448, now seen corresponding path program 1 times [2019-12-27 20:11:13,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:13,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840154447] [2019-12-27 20:11:13,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:13,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840154447] [2019-12-27 20:11:13,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:13,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:11:13,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1388829745] [2019-12-27 20:11:13,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:13,532 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:13,541 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 74 transitions. [2019-12-27 20:11:13,541 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:13,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:13,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:13,598 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:11:13,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:11:13,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:11:13,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:11:13,599 INFO L87 Difference]: Start difference. First operand 34354 states and 115309 transitions. Second operand 8 states. [2019-12-27 20:11:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:14,965 INFO L93 Difference]: Finished difference Result 54694 states and 179145 transitions. [2019-12-27 20:11:14,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:11:14,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 20:11:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:15,068 INFO L225 Difference]: With dead ends: 54694 [2019-12-27 20:11:15,068 INFO L226 Difference]: Without dead ends: 54654 [2019-12-27 20:11:15,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:11:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54654 states. [2019-12-27 20:11:15,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54654 to 34641. [2019-12-27 20:11:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-27 20:11:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 115518 transitions. [2019-12-27 20:11:15,935 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 115518 transitions. Word has length 22 [2019-12-27 20:11:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:15,935 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 115518 transitions. [2019-12-27 20:11:15,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:11:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 115518 transitions. [2019-12-27 20:11:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:11:15,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:15,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:11:15,953 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:15,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash 142007166, now seen corresponding path program 1 times [2019-12-27 20:11:15,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:15,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435621357] [2019-12-27 20:11:15,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:16,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435621357] [2019-12-27 20:11:16,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:16,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:16,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725870720] [2019-12-27 20:11:16,033 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:16,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:16,042 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:11:16,042 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:16,043 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:16,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:11:16,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:16,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:11:16,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:11:16,044 INFO L87 Difference]: Start difference. First operand 34641 states and 115518 transitions. Second operand 4 states. [2019-12-27 20:11:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:16,121 INFO L93 Difference]: Finished difference Result 13809 states and 42789 transitions. [2019-12-27 20:11:16,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:11:16,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 20:11:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:16,148 INFO L225 Difference]: With dead ends: 13809 [2019-12-27 20:11:16,148 INFO L226 Difference]: Without dead ends: 13809 [2019-12-27 20:11:16,149 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-27 20:11:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-27 20:11:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13589. [2019-12-27 20:11:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13589 states. [2019-12-27 20:11:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13589 states to 13589 states and 42149 transitions. [2019-12-27 20:11:16,599 INFO L78 Accepts]: Start accepts. Automaton has 13589 states and 42149 transitions. Word has length 25 [2019-12-27 20:11:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:16,600 INFO L462 AbstractCegarLoop]: Abstraction has 13589 states and 42149 transitions. [2019-12-27 20:11:16,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:11:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 13589 states and 42149 transitions. [2019-12-27 20:11:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:11:16,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:16,621 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-27 20:11:16,621 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:16,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1724321301, now seen corresponding path program 1 times [2019-12-27 20:11:16,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:16,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794787777] [2019-12-27 20:11:16,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:16,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794787777] [2019-12-27 20:11:16,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:16,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:11:16,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [996825623] [2019-12-27 20:11:16,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:16,752 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:16,777 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 96 transitions. [2019-12-27 20:11:16,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:16,788 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:11:16,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:11:16,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:16,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:11:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:11:16,790 INFO L87 Difference]: Start difference. First operand 13589 states and 42149 transitions. Second operand 4 states. [2019-12-27 20:11:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:17,095 INFO L93 Difference]: Finished difference Result 18800 states and 56998 transitions. [2019-12-27 20:11:17,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:11:17,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 20:11:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:17,132 INFO L225 Difference]: With dead ends: 18800 [2019-12-27 20:11:17,132 INFO L226 Difference]: Without dead ends: 18800 [2019-12-27 20:11:17,133 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-27 20:11:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18800 states. [2019-12-27 20:11:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18800 to 12988. [2019-12-27 20:11:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12988 states. [2019-12-27 20:11:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12988 states to 12988 states and 39792 transitions. [2019-12-27 20:11:17,480 INFO L78 Accepts]: Start accepts. Automaton has 12988 states and 39792 transitions. Word has length 39 [2019-12-27 20:11:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:17,481 INFO L462 AbstractCegarLoop]: Abstraction has 12988 states and 39792 transitions. [2019-12-27 20:11:17,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:11:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 12988 states and 39792 transitions. [2019-12-27 20:11:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:11:17,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:17,511 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-27 20:11:17,511 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash 32452997, now seen corresponding path program 1 times [2019-12-27 20:11:17,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:17,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895009437] [2019-12-27 20:11:17,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:17,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895009437] [2019-12-27 20:11:17,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:17,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:11:17,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323394229] [2019-12-27 20:11:17,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:17,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:17,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 167 transitions. [2019-12-27 20:11:17,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:17,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:17,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:11:17,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:17,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:11:17,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:11:17,680 INFO L87 Difference]: Start difference. First operand 12988 states and 39792 transitions. Second operand 5 states. [2019-12-27 20:11:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:17,750 INFO L93 Difference]: Finished difference Result 11754 states and 36628 transitions. [2019-12-27 20:11:17,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:11:17,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 20:11:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:17,769 INFO L225 Difference]: With dead ends: 11754 [2019-12-27 20:11:17,769 INFO L226 Difference]: Without dead ends: 11754 [2019-12-27 20:11:17,769 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-27 20:11:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11754 states. [2019-12-27 20:11:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11754 to 11245. [2019-12-27 20:11:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11245 states. [2019-12-27 20:11:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11245 states to 11245 states and 35204 transitions. [2019-12-27 20:11:17,955 INFO L78 Accepts]: Start accepts. Automaton has 11245 states and 35204 transitions. Word has length 40 [2019-12-27 20:11:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:17,955 INFO L462 AbstractCegarLoop]: Abstraction has 11245 states and 35204 transitions. [2019-12-27 20:11:17,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:11:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 11245 states and 35204 transitions. [2019-12-27 20:11:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:17,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:17,974 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] [2019-12-27 20:11:17,974 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:17,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1496416331, now seen corresponding path program 1 times [2019-12-27 20:11:17,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:17,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887801104] [2019-12-27 20:11:17,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:18,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887801104] [2019-12-27 20:11:18,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:18,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:18,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1232336544] [2019-12-27 20:11:18,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:18,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:18,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 332 states and 670 transitions. [2019-12-27 20:11:18,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:18,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 20:11:18,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:11:18,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:11:18,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:11:18,645 INFO L87 Difference]: Start difference. First operand 11245 states and 35204 transitions. Second operand 3 states. [2019-12-27 20:11:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:18,725 INFO L93 Difference]: Finished difference Result 14991 states and 46059 transitions. [2019-12-27 20:11:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:11:18,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 20:11:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:18,745 INFO L225 Difference]: With dead ends: 14991 [2019-12-27 20:11:18,745 INFO L226 Difference]: Without dead ends: 14991 [2019-12-27 20:11:18,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:11:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14991 states. [2019-12-27 20:11:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14991 to 12870. [2019-12-27 20:11:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12870 states. [2019-12-27 20:11:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12870 states to 12870 states and 39991 transitions. [2019-12-27 20:11:18,947 INFO L78 Accepts]: Start accepts. Automaton has 12870 states and 39991 transitions. Word has length 55 [2019-12-27 20:11:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:18,947 INFO L462 AbstractCegarLoop]: Abstraction has 12870 states and 39991 transitions. [2019-12-27 20:11:18,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:11:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 12870 states and 39991 transitions. [2019-12-27 20:11:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:18,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:18,967 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] [2019-12-27 20:11:18,967 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 460816343, now seen corresponding path program 1 times [2019-12-27 20:11:18,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:18,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007976444] [2019-12-27 20:11:18,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:19,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007976444] [2019-12-27 20:11:19,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:19,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:19,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1940381467] [2019-12-27 20:11:19,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:19,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:19,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 332 states and 670 transitions. [2019-12-27 20:11:19,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:19,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:11:19,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:11:19,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:11:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:11:19,288 INFO L87 Difference]: Start difference. First operand 12870 states and 39991 transitions. Second operand 6 states. [2019-12-27 20:11:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:19,607 INFO L93 Difference]: Finished difference Result 29217 states and 90047 transitions. [2019-12-27 20:11:19,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:11:19,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 20:11:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:19,630 INFO L225 Difference]: With dead ends: 29217 [2019-12-27 20:11:19,630 INFO L226 Difference]: Without dead ends: 15869 [2019-12-27 20:11:19,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:11:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15869 states. [2019-12-27 20:11:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15869 to 10663. [2019-12-27 20:11:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10663 states. [2019-12-27 20:11:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10663 states to 10663 states and 32939 transitions. [2019-12-27 20:11:19,821 INFO L78 Accepts]: Start accepts. Automaton has 10663 states and 32939 transitions. Word has length 55 [2019-12-27 20:11:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:19,822 INFO L462 AbstractCegarLoop]: Abstraction has 10663 states and 32939 transitions. [2019-12-27 20:11:19,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:11:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 10663 states and 32939 transitions. [2019-12-27 20:11:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:19,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:19,834 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] [2019-12-27 20:11:19,834 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:19,834 INFO L82 PathProgramCache]: Analyzing trace with hash 809241269, now seen corresponding path program 2 times [2019-12-27 20:11:19,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:19,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653244928] [2019-12-27 20:11:19,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:19,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653244928] [2019-12-27 20:11:19,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:19,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:11:19,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1068819856] [2019-12-27 20:11:19,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:19,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:20,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 547 transitions. [2019-12-27 20:11:20,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:20,359 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:11:20,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:11:20,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:20,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:11:20,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:11:20,361 INFO L87 Difference]: Start difference. First operand 10663 states and 32939 transitions. Second operand 7 states. [2019-12-27 20:11:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:20,762 INFO L93 Difference]: Finished difference Result 30375 states and 92342 transitions. [2019-12-27 20:11:20,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:11:20,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 20:11:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:20,791 INFO L225 Difference]: With dead ends: 30375 [2019-12-27 20:11:20,792 INFO L226 Difference]: Without dead ends: 21467 [2019-12-27 20:11:20,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:11:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21467 states. [2019-12-27 20:11:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21467 to 12991. [2019-12-27 20:11:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12991 states. [2019-12-27 20:11:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12991 states to 12991 states and 39995 transitions. [2019-12-27 20:11:21,044 INFO L78 Accepts]: Start accepts. Automaton has 12991 states and 39995 transitions. Word has length 55 [2019-12-27 20:11:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:21,045 INFO L462 AbstractCegarLoop]: Abstraction has 12991 states and 39995 transitions. [2019-12-27 20:11:21,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:11:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 12991 states and 39995 transitions. [2019-12-27 20:11:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:21,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:21,058 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] [2019-12-27 20:11:21,058 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1445433601, now seen corresponding path program 3 times [2019-12-27 20:11:21,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:21,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622166292] [2019-12-27 20:11:21,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:21,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622166292] [2019-12-27 20:11:21,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:21,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:11:21,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1936008537] [2019-12-27 20:11:21,206 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:21,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:21,460 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 463 transitions. [2019-12-27 20:11:21,460 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:21,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 20:11:21,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:11:21,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:21,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:11:21,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:11:21,591 INFO L87 Difference]: Start difference. First operand 12991 states and 39995 transitions. Second operand 9 states. [2019-12-27 20:11:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:23,683 INFO L93 Difference]: Finished difference Result 36991 states and 114024 transitions. [2019-12-27 20:11:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 20:11:23,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 20:11:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:23,724 INFO L225 Difference]: With dead ends: 36991 [2019-12-27 20:11:23,724 INFO L226 Difference]: Without dead ends: 29064 [2019-12-27 20:11:23,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 20:11:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29064 states. [2019-12-27 20:11:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29064 to 18822. [2019-12-27 20:11:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18822 states. [2019-12-27 20:11:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18822 states to 18822 states and 57630 transitions. [2019-12-27 20:11:24,230 INFO L78 Accepts]: Start accepts. Automaton has 18822 states and 57630 transitions. Word has length 55 [2019-12-27 20:11:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:24,230 INFO L462 AbstractCegarLoop]: Abstraction has 18822 states and 57630 transitions. [2019-12-27 20:11:24,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:11:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18822 states and 57630 transitions. [2019-12-27 20:11:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:24,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:24,254 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] [2019-12-27 20:11:24,254 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:24,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash -473354833, now seen corresponding path program 4 times [2019-12-27 20:11:24,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:24,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315310323] [2019-12-27 20:11:24,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:24,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315310323] [2019-12-27 20:11:24,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:24,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:11:24,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [35968590] [2019-12-27 20:11:24,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:24,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:24,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 354 transitions. [2019-12-27 20:11:24,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:24,664 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:11:24,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:11:24,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:24,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:11:24,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:11:24,665 INFO L87 Difference]: Start difference. First operand 18822 states and 57630 transitions. Second operand 9 states. [2019-12-27 20:11:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:25,709 INFO L93 Difference]: Finished difference Result 30431 states and 92713 transitions. [2019-12-27 20:11:25,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 20:11:25,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 20:11:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:25,746 INFO L225 Difference]: With dead ends: 30431 [2019-12-27 20:11:25,746 INFO L226 Difference]: Without dead ends: 26729 [2019-12-27 20:11:25,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:11:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26729 states. [2019-12-27 20:11:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26729 to 18710. [2019-12-27 20:11:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18710 states. [2019-12-27 20:11:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18710 states to 18710 states and 57254 transitions. [2019-12-27 20:11:26,076 INFO L78 Accepts]: Start accepts. Automaton has 18710 states and 57254 transitions. Word has length 55 [2019-12-27 20:11:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:26,076 INFO L462 AbstractCegarLoop]: Abstraction has 18710 states and 57254 transitions. [2019-12-27 20:11:26,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:11:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 18710 states and 57254 transitions. [2019-12-27 20:11:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:26,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:26,099 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] [2019-12-27 20:11:26,100 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:26,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:26,100 INFO L82 PathProgramCache]: Analyzing trace with hash -301087463, now seen corresponding path program 5 times [2019-12-27 20:11:26,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:26,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160682682] [2019-12-27 20:11:26,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:26,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160682682] [2019-12-27 20:11:26,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:26,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:11:26,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785715176] [2019-12-27 20:11:26,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:26,315 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:26,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 395 transitions. [2019-12-27 20:11:26,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:26,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:26,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 20:11:26,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:11:26,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:11:26,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:11:26,939 INFO L87 Difference]: Start difference. First operand 18710 states and 57254 transitions. Second operand 16 states. [2019-12-27 20:11:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:38,051 INFO L93 Difference]: Finished difference Result 77285 states and 230097 transitions. [2019-12-27 20:11:38,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-12-27 20:11:38,052 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 20:11:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:38,161 INFO L225 Difference]: With dead ends: 77285 [2019-12-27 20:11:38,161 INFO L226 Difference]: Without dead ends: 77069 [2019-12-27 20:11:38,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3717 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1573, Invalid=9139, Unknown=0, NotChecked=0, Total=10712 [2019-12-27 20:11:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77069 states. [2019-12-27 20:11:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77069 to 29507. [2019-12-27 20:11:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29507 states. [2019-12-27 20:11:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29507 states to 29507 states and 90600 transitions. [2019-12-27 20:11:39,110 INFO L78 Accepts]: Start accepts. Automaton has 29507 states and 90600 transitions. Word has length 55 [2019-12-27 20:11:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:39,110 INFO L462 AbstractCegarLoop]: Abstraction has 29507 states and 90600 transitions. [2019-12-27 20:11:39,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:11:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 29507 states and 90600 transitions. [2019-12-27 20:11:39,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:39,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:39,143 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] [2019-12-27 20:11:39,143 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:39,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:39,144 INFO L82 PathProgramCache]: Analyzing trace with hash -559913207, now seen corresponding path program 6 times [2019-12-27 20:11:39,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:39,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506383495] [2019-12-27 20:11:39,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:39,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506383495] [2019-12-27 20:11:39,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:39,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:11:39,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779041646] [2019-12-27 20:11:39,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:39,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:39,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 330 transitions. [2019-12-27 20:11:39,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:39,438 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:11:39,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:11:39,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:39,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:11:39,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:11:39,439 INFO L87 Difference]: Start difference. First operand 29507 states and 90600 transitions. Second operand 7 states. [2019-12-27 20:11:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:40,736 INFO L93 Difference]: Finished difference Result 42659 states and 127449 transitions. [2019-12-27 20:11:40,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:11:40,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 20:11:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:40,799 INFO L225 Difference]: With dead ends: 42659 [2019-12-27 20:11:40,799 INFO L226 Difference]: Without dead ends: 42561 [2019-12-27 20:11:40,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:11:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42561 states. [2019-12-27 20:11:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42561 to 30831. [2019-12-27 20:11:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30831 states. [2019-12-27 20:11:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30831 states to 30831 states and 94005 transitions. [2019-12-27 20:11:41,390 INFO L78 Accepts]: Start accepts. Automaton has 30831 states and 94005 transitions. Word has length 55 [2019-12-27 20:11:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:41,390 INFO L462 AbstractCegarLoop]: Abstraction has 30831 states and 94005 transitions. [2019-12-27 20:11:41,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:11:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 30831 states and 94005 transitions. [2019-12-27 20:11:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:41,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:41,426 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] [2019-12-27 20:11:41,427 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:41,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash -586394009, now seen corresponding path program 7 times [2019-12-27 20:11:41,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:41,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246975082] [2019-12-27 20:11:41,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:41,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246975082] [2019-12-27 20:11:41,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:41,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:11:41,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054093129] [2019-12-27 20:11:41,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:41,628 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:41,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 352 transitions. [2019-12-27 20:11:41,742 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:41,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:41,987 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 20:11:41,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:11:41,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:41,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:11:41,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:11:41,989 INFO L87 Difference]: Start difference. First operand 30831 states and 94005 transitions. Second operand 15 states. [2019-12-27 20:11:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:48,611 INFO L93 Difference]: Finished difference Result 93349 states and 275483 transitions. [2019-12-27 20:11:48,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-27 20:11:48,612 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 20:11:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:48,739 INFO L225 Difference]: With dead ends: 93349 [2019-12-27 20:11:48,740 INFO L226 Difference]: Without dead ends: 93349 [2019-12-27 20:11:48,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=889, Invalid=5273, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 20:11:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93349 states. [2019-12-27 20:11:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93349 to 30424. [2019-12-27 20:11:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30424 states. [2019-12-27 20:11:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30424 states to 30424 states and 93045 transitions. [2019-12-27 20:11:49,723 INFO L78 Accepts]: Start accepts. Automaton has 30424 states and 93045 transitions. Word has length 55 [2019-12-27 20:11:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:49,724 INFO L462 AbstractCegarLoop]: Abstraction has 30424 states and 93045 transitions. [2019-12-27 20:11:49,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:11:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 30424 states and 93045 transitions. [2019-12-27 20:11:49,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:49,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:49,755 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] [2019-12-27 20:11:49,755 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:49,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:49,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1810872584, now seen corresponding path program 1 times [2019-12-27 20:11:49,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:49,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407605065] [2019-12-27 20:11:49,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:49,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407605065] [2019-12-27 20:11:49,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:49,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:11:49,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [174307427] [2019-12-27 20:11:49,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:49,819 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:49,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 316 transitions. [2019-12-27 20:11:49,934 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:49,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:11:49,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:11:49,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:11:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:11:49,948 INFO L87 Difference]: Start difference. First operand 30424 states and 93045 transitions. Second operand 3 states. [2019-12-27 20:11:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:50,056 INFO L93 Difference]: Finished difference Result 29808 states and 88270 transitions. [2019-12-27 20:11:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:11:50,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 20:11:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:50,094 INFO L225 Difference]: With dead ends: 29808 [2019-12-27 20:11:50,094 INFO L226 Difference]: Without dead ends: 29808 [2019-12-27 20:11:50,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:11:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29808 states. [2019-12-27 20:11:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29808 to 19866. [2019-12-27 20:11:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19866 states. [2019-12-27 20:11:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19866 states to 19866 states and 58240 transitions. [2019-12-27 20:11:50,628 INFO L78 Accepts]: Start accepts. Automaton has 19866 states and 58240 transitions. Word has length 55 [2019-12-27 20:11:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:50,628 INFO L462 AbstractCegarLoop]: Abstraction has 19866 states and 58240 transitions. [2019-12-27 20:11:50,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:11:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 19866 states and 58240 transitions. [2019-12-27 20:11:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:50,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:50,646 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] [2019-12-27 20:11:50,646 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:50,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:50,646 INFO L82 PathProgramCache]: Analyzing trace with hash 272951757, now seen corresponding path program 8 times [2019-12-27 20:11:50,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:50,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219106028] [2019-12-27 20:11:50,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:50,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219106028] [2019-12-27 20:11:50,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:50,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:11:50,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1343137242] [2019-12-27 20:11:50,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:50,818 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:50,966 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 339 transitions. [2019-12-27 20:11:50,967 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:50,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:50,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:11:51,149 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 20:11:51,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:11:51,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:51,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:11:51,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:11:51,151 INFO L87 Difference]: Start difference. First operand 19866 states and 58240 transitions. Second operand 12 states. [2019-12-27 20:11:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:55,157 INFO L93 Difference]: Finished difference Result 38906 states and 111893 transitions. [2019-12-27 20:11:55,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 20:11:55,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 20:11:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:55,213 INFO L225 Difference]: With dead ends: 38906 [2019-12-27 20:11:55,213 INFO L226 Difference]: Without dead ends: 38906 [2019-12-27 20:11:55,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1649, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 20:11:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38906 states. [2019-12-27 20:11:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38906 to 17958. [2019-12-27 20:11:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17958 states. [2019-12-27 20:11:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17958 states to 17958 states and 52816 transitions. [2019-12-27 20:11:55,620 INFO L78 Accepts]: Start accepts. Automaton has 17958 states and 52816 transitions. Word has length 55 [2019-12-27 20:11:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:11:55,620 INFO L462 AbstractCegarLoop]: Abstraction has 17958 states and 52816 transitions. [2019-12-27 20:11:55,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:11:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 17958 states and 52816 transitions. [2019-12-27 20:11:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:11:55,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:55,638 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] [2019-12-27 20:11:55,638 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:55,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:55,638 INFO L82 PathProgramCache]: Analyzing trace with hash -453565697, now seen corresponding path program 9 times [2019-12-27 20:11:55,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:55,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661582720] [2019-12-27 20:11:55,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:11:55,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661582720] [2019-12-27 20:11:55,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:55,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:11:55,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [883975299] [2019-12-27 20:11:55,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:55,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:56,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 299 transitions. [2019-12-27 20:11:56,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:56,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:11:56,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:11:56,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:56,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:11:56,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:11:56,471 INFO L87 Difference]: Start difference. First operand 17958 states and 52816 transitions. Second operand 18 states. [2019-12-27 20:12:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:00,507 INFO L93 Difference]: Finished difference Result 40544 states and 119200 transitions. [2019-12-27 20:12:00,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 20:12:00,508 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-27 20:12:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:00,564 INFO L225 Difference]: With dead ends: 40544 [2019-12-27 20:12:00,564 INFO L226 Difference]: Without dead ends: 39476 [2019-12-27 20:12:00,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=469, Invalid=2611, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 20:12:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39476 states. [2019-12-27 20:12:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39476 to 20373. [2019-12-27 20:12:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20373 states. [2019-12-27 20:12:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20373 states to 20373 states and 59563 transitions. [2019-12-27 20:12:01,010 INFO L78 Accepts]: Start accepts. Automaton has 20373 states and 59563 transitions. Word has length 55 [2019-12-27 20:12:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:01,011 INFO L462 AbstractCegarLoop]: Abstraction has 20373 states and 59563 transitions. [2019-12-27 20:12:01,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:12:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 20373 states and 59563 transitions. [2019-12-27 20:12:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:12:01,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:01,034 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] [2019-12-27 20:12:01,035 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1856740831, now seen corresponding path program 10 times [2019-12-27 20:12:01,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:01,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960586695] [2019-12-27 20:12:01,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:12:01,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960586695] [2019-12-27 20:12:01,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:01,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:12:01,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501791093] [2019-12-27 20:12:01,099 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:01,109 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:01,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 330 transitions. [2019-12-27 20:12:01,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:01,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:01,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:12:01,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:01,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:12:01,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:01,250 INFO L87 Difference]: Start difference. First operand 20373 states and 59563 transitions. Second operand 3 states. [2019-12-27 20:12:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:01,316 INFO L93 Difference]: Finished difference Result 20373 states and 59561 transitions. [2019-12-27 20:12:01,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:01,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 20:12:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:01,343 INFO L225 Difference]: With dead ends: 20373 [2019-12-27 20:12:01,343 INFO L226 Difference]: Without dead ends: 20373 [2019-12-27 20:12:01,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20373 states. [2019-12-27 20:12:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20373 to 15848. [2019-12-27 20:12:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15848 states. [2019-12-27 20:12:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15848 states to 15848 states and 47173 transitions. [2019-12-27 20:12:01,598 INFO L78 Accepts]: Start accepts. Automaton has 15848 states and 47173 transitions. Word has length 55 [2019-12-27 20:12:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:01,599 INFO L462 AbstractCegarLoop]: Abstraction has 15848 states and 47173 transitions. [2019-12-27 20:12:01,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15848 states and 47173 transitions. [2019-12-27 20:12:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:12:01,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:01,614 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] [2019-12-27 20:12:01,614 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:01,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1852085971, now seen corresponding path program 1 times [2019-12-27 20:12:01,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:01,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184886247] [2019-12-27 20:12:01,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:12:01,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184886247] [2019-12-27 20:12:01,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:01,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:12:01,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [225850262] [2019-12-27 20:12:01,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:01,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:02,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 396 transitions. [2019-12-27 20:12:02,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:02,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 20:12:02,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:12:02,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:02,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:12:02,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:12:02,185 INFO L87 Difference]: Start difference. First operand 15848 states and 47173 transitions. Second operand 11 states. [2019-12-27 20:12:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:04,315 INFO L93 Difference]: Finished difference Result 43178 states and 127586 transitions. [2019-12-27 20:12:04,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 20:12:04,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 20:12:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:04,361 INFO L225 Difference]: With dead ends: 43178 [2019-12-27 20:12:04,361 INFO L226 Difference]: Without dead ends: 33688 [2019-12-27 20:12:04,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=304, Invalid=1418, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:12:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33688 states. [2019-12-27 20:12:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33688 to 15417. [2019-12-27 20:12:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15417 states. [2019-12-27 20:12:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 45810 transitions. [2019-12-27 20:12:04,722 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 45810 transitions. Word has length 56 [2019-12-27 20:12:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:04,722 INFO L462 AbstractCegarLoop]: Abstraction has 15417 states and 45810 transitions. [2019-12-27 20:12:04,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:12:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 45810 transitions. [2019-12-27 20:12:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:12:04,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:04,738 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] [2019-12-27 20:12:04,739 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:04,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash -879531663, now seen corresponding path program 2 times [2019-12-27 20:12:04,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:04,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924101563] [2019-12-27 20:12:04,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:12:04,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924101563] [2019-12-27 20:12:04,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:04,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:12:04,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462948696] [2019-12-27 20:12:04,951 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:04,961 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:05,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 438 transitions. [2019-12-27 20:12:05,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:05,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:12:05,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:12:05,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 20:12:05,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 20:12:05,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:05,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 20:12:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:12:05,508 INFO L87 Difference]: Start difference. First operand 15417 states and 45810 transitions. Second operand 19 states. [2019-12-27 20:12:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:09,508 INFO L93 Difference]: Finished difference Result 41360 states and 122122 transitions. [2019-12-27 20:12:09,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 20:12:09,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-27 20:12:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:09,559 INFO L225 Difference]: With dead ends: 41360 [2019-12-27 20:12:09,560 INFO L226 Difference]: Without dead ends: 38412 [2019-12-27 20:12:09,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=408, Invalid=2348, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 20:12:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38412 states. [2019-12-27 20:12:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38412 to 15495. [2019-12-27 20:12:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15495 states. [2019-12-27 20:12:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15495 states to 15495 states and 45874 transitions. [2019-12-27 20:12:09,930 INFO L78 Accepts]: Start accepts. Automaton has 15495 states and 45874 transitions. Word has length 56 [2019-12-27 20:12:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:09,930 INFO L462 AbstractCegarLoop]: Abstraction has 15495 states and 45874 transitions. [2019-12-27 20:12:09,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 20:12:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 15495 states and 45874 transitions. [2019-12-27 20:12:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:12:09,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:09,946 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] [2019-12-27 20:12:09,946 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:09,946 INFO L82 PathProgramCache]: Analyzing trace with hash -255568507, now seen corresponding path program 3 times [2019-12-27 20:12:09,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:09,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533568205] [2019-12-27 20:12:09,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:12:10,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533568205] [2019-12-27 20:12:10,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:10,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:12:10,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431029630] [2019-12-27 20:12:10,185 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:10,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:10,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 326 transitions. [2019-12-27 20:12:10,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:10,478 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:12:10,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:12:10,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:10,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:12:10,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:12:10,479 INFO L87 Difference]: Start difference. First operand 15495 states and 45874 transitions. Second operand 12 states. [2019-12-27 20:12:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:12,503 INFO L93 Difference]: Finished difference Result 33572 states and 99725 transitions. [2019-12-27 20:12:12,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 20:12:12,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 20:12:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:12,549 INFO L225 Difference]: With dead ends: 33572 [2019-12-27 20:12:12,549 INFO L226 Difference]: Without dead ends: 30298 [2019-12-27 20:12:12,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=1288, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 20:12:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30298 states. [2019-12-27 20:12:12,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30298 to 13363. [2019-12-27 20:12:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13363 states. [2019-12-27 20:12:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13363 states to 13363 states and 39948 transitions. [2019-12-27 20:12:12,855 INFO L78 Accepts]: Start accepts. Automaton has 13363 states and 39948 transitions. Word has length 56 [2019-12-27 20:12:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:12,856 INFO L462 AbstractCegarLoop]: Abstraction has 13363 states and 39948 transitions. [2019-12-27 20:12:12,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:12:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 13363 states and 39948 transitions. [2019-12-27 20:12:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:12:12,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:12,869 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] [2019-12-27 20:12:12,869 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:12,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1279960527, now seen corresponding path program 4 times [2019-12-27 20:12:12,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:12,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406880708] [2019-12-27 20:12:12,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:12:13,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406880708] [2019-12-27 20:12:13,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:13,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:12:13,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297555603] [2019-12-27 20:12:13,011 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:13,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:13,118 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 343 transitions. [2019-12-27 20:12:13,118 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:13,171 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:12:13,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:12:13,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:12:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:12:13,173 INFO L87 Difference]: Start difference. First operand 13363 states and 39948 transitions. Second operand 11 states. [2019-12-27 20:12:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:14,481 INFO L93 Difference]: Finished difference Result 17056 states and 50501 transitions. [2019-12-27 20:12:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:12:14,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 20:12:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:14,505 INFO L225 Difference]: With dead ends: 17056 [2019-12-27 20:12:14,505 INFO L226 Difference]: Without dead ends: 16772 [2019-12-27 20:12:14,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:12:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16772 states. [2019-12-27 20:12:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16772 to 13217. [2019-12-27 20:12:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13217 states. [2019-12-27 20:12:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13217 states to 13217 states and 39604 transitions. [2019-12-27 20:12:14,733 INFO L78 Accepts]: Start accepts. Automaton has 13217 states and 39604 transitions. Word has length 56 [2019-12-27 20:12:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:14,733 INFO L462 AbstractCegarLoop]: Abstraction has 13217 states and 39604 transitions. [2019-12-27 20:12:14,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:12:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 13217 states and 39604 transitions. [2019-12-27 20:12:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:12:14,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:14,747 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] [2019-12-27 20:12:14,747 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:14,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:14,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1908396633, now seen corresponding path program 5 times [2019-12-27 20:12:14,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:14,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765388081] [2019-12-27 20:12:14,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:12:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:12:14,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:12:14,843 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:12:14,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$r_buff0_thd1~0_68) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~__unbuffered_p1_EAX~0_11) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t412~0.base_30| 1)) (= 0 v_~x$w_buff0_used~0_106) (= 0 v_~x$w_buff1~0_25) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t412~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t412~0.base_30|) |v_ULTIMATE.start_main_~#t412~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd0~0_21) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~x~0_26 0) (= v_~main$tmp_guard0~0_8 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (= (select .cse0 |v_ULTIMATE.start_main_~#t412~0.base_30|) 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~x$r_buff1_thd0~0_21 0) (= |v_ULTIMATE.start_main_~#t412~0.offset_23| 0) (= v_~x$flush_delayed~0_14 0) (= v_~x$w_buff1_used~0_65 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t412~0.base_30|) (= 0 v_~x$r_buff0_thd3~0_20) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t412~0.base_30| 4)) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= v_~x$mem_tmp~0_11 0) (= 0 v_~z~0_9) (= v_~y~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_~#t414~0.base=|v_ULTIMATE.start_main_~#t414~0.base_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, ULTIMATE.start_main_~#t412~0.offset=|v_ULTIMATE.start_main_~#t412~0.offset_23|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ULTIMATE.start_main_~#t412~0.base=|v_ULTIMATE.start_main_~#t412~0.base_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_~#t413~0.base=|v_ULTIMATE.start_main_~#t413~0.base_22|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_~#t414~0.offset=|v_ULTIMATE.start_main_~#t414~0.offset_15|, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t413~0.offset=|v_ULTIMATE.start_main_~#t413~0.offset_18|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t414~0.base, ~x$flush_delayed~0, ULTIMATE.start_main_~#t412~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t412~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t413~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t414~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t413~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 20:12:14,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L823-1-->L825: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t413~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t413~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t413~0.base_11|) |v_ULTIMATE.start_main_~#t413~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t413~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t413~0.offset_10|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t413~0.base_11| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t413~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t413~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t413~0.base=|v_ULTIMATE.start_main_~#t413~0.base_11|, ULTIMATE.start_main_~#t413~0.offset=|v_ULTIMATE.start_main_~#t413~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t413~0.base, ULTIMATE.start_main_~#t413~0.offset] because there is no mapped edge [2019-12-27 20:12:14,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= 1 v_~x$w_buff0_used~0_71) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_72) (= 1 v_~x$w_buff0~0_16) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 20:12:14,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t414~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t414~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t414~0.base_11|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t414~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t414~0.base_11|) |v_ULTIMATE.start_main_~#t414~0.offset_10| 2))) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t414~0.base_11| 1) |v_#valid_33|) (not (= |v_ULTIMATE.start_main_~#t414~0.base_11| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t414~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t414~0.base=|v_ULTIMATE.start_main_~#t414~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|, ULTIMATE.start_main_~#t414~0.offset=|v_ULTIMATE.start_main_~#t414~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t414~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t414~0.offset] because there is no mapped edge [2019-12-27 20:12:14,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-218516035 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-218516035 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-218516035| ~x$w_buff1~0_In-218516035)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-218516035| ~x~0_In-218516035) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-218516035, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-218516035, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-218516035, ~x~0=~x~0_In-218516035} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-218516035|, ~x$w_buff1~0=~x$w_buff1~0_In-218516035, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-218516035, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-218516035, ~x~0=~x~0_In-218516035} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 20:12:14,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1314515235 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1314515235 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1314515235|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1314515235 |P1Thread1of1ForFork0_#t~ite28_Out1314515235|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1314515235, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1314515235} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1314515235, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1314515235|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1314515235} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 20:12:14,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In516088963 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In516088963 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In516088963 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In516088963 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out516088963| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out516088963| ~x$w_buff1_used~0_In516088963) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In516088963, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In516088963, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In516088963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In516088963} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In516088963, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In516088963, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In516088963, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out516088963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In516088963} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:12:14,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-793600302 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-793600302 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-793600302 ~x$r_buff0_thd2~0_Out-793600302)) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-793600302) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-793600302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-793600302} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-793600302|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-793600302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-793600302} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:12:14,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-441646162 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-441646162 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-441646162 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-441646162 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-441646162|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-441646162 |P1Thread1of1ForFork0_#t~ite31_Out-441646162|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-441646162, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-441646162, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-441646162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-441646162} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-441646162|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-441646162, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-441646162, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-441646162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-441646162} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:12:14,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 20:12:14,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1619037448 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out1619037448| |P0Thread1of1ForFork2_#t~ite15_Out1619037448|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1619037448 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1619037448 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1619037448 256)) (and (= 0 (mod ~x$w_buff1_used~0_In1619037448 256)) .cse1))) (= ~x$w_buff0_used~0_In1619037448 |P0Thread1of1ForFork2_#t~ite14_Out1619037448|)) (and (not .cse0) (= ~x$w_buff0_used~0_In1619037448 |P0Thread1of1ForFork2_#t~ite15_Out1619037448|) (= |P0Thread1of1ForFork2_#t~ite14_In1619037448| |P0Thread1of1ForFork2_#t~ite14_Out1619037448|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1619037448, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1619037448, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1619037448, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1619037448|, ~weak$$choice2~0=~weak$$choice2~0_In1619037448, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1619037448} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1619037448, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1619037448, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1619037448|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1619037448, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1619037448|, ~weak$$choice2~0=~weak$$choice2~0_In1619037448, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1619037448} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:12:14,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse4 (= 0 (mod ~x$w_buff0_used~0_In1790763758 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1790763758 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1790763758 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite17_Out1790763758| |P0Thread1of1ForFork2_#t~ite18_Out1790763758|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In1790763758 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1790763758 256)))) (or (and (or (and (= ~x$w_buff1_used~0_In1790763758 |P0Thread1of1ForFork2_#t~ite18_Out1790763758|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1790763758| |P0Thread1of1ForFork2_#t~ite17_Out1790763758|)) (and (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4) (= ~x$w_buff1_used~0_In1790763758 |P0Thread1of1ForFork2_#t~ite17_Out1790763758|) .cse5 .cse0)) (= |P0Thread1of1ForFork2_#t~ite16_In1790763758| |P0Thread1of1ForFork2_#t~ite16_Out1790763758|)) (let ((.cse6 (not .cse2))) (and (not .cse4) (= |P0Thread1of1ForFork2_#t~ite16_Out1790763758| |P0Thread1of1ForFork2_#t~ite17_Out1790763758|) (or .cse6 (not .cse1)) (or .cse6 (not .cse3)) (= |P0Thread1of1ForFork2_#t~ite16_Out1790763758| 0) .cse5 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1790763758, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1790763758|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1790763758, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In1790763758|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1790763758, ~weak$$choice2~0=~weak$$choice2~0_In1790763758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1790763758} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1790763758, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1790763758|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1790763758|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1790763758, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out1790763758|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1790763758, ~weak$$choice2~0=~weak$$choice2~0_In1790763758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1790763758} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 20:12:14,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L746-->L747: Formula: (and (= v_~x$r_buff0_thd1~0_36 v_~x$r_buff0_thd1~0_35) (not (= 0 (mod v_~weak$$choice2~0_16 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_36, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_16, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 20:12:14,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_17 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 20:12:14,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_20) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 20:12:14,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-2125189866 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2125189866 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-2125189866| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-2125189866 |P2Thread1of1ForFork1_#t~ite34_Out-2125189866|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2125189866, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2125189866} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-2125189866|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2125189866, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2125189866} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:12:14,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2125545035 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In2125545035 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In2125545035 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In2125545035 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out2125545035| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite35_Out2125545035| ~x$w_buff1_used~0_In2125545035)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2125545035, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2125545035, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2125545035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2125545035} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2125545035|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2125545035, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2125545035, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2125545035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2125545035} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:12:14,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-944264270 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-944264270 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-944264270| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-944264270| ~x$r_buff0_thd3~0_In-944264270) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-944264270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-944264270} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-944264270|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-944264270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-944264270} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:12:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In570647192 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In570647192 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In570647192 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In570647192 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out570647192|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In570647192 |P2Thread1of1ForFork1_#t~ite37_Out570647192|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In570647192, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In570647192, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In570647192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570647192} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out570647192|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In570647192, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In570647192, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In570647192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570647192} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:12:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 20:12:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:12:14,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-608829729 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-608829729 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-608829729| |ULTIMATE.start_main_#t~ite41_Out-608829729|))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-608829729| ~x~0_In-608829729) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~x$w_buff1~0_In-608829729 |ULTIMATE.start_main_#t~ite41_Out-608829729|) (not .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-608829729, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-608829729, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-608829729, ~x~0=~x~0_In-608829729} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-608829729|, ~x$w_buff1~0=~x$w_buff1~0_In-608829729, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-608829729, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-608829729, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-608829729|, ~x~0=~x~0_In-608829729} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:12:14,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In490922796 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In490922796 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out490922796| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out490922796| ~x$w_buff0_used~0_In490922796)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In490922796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In490922796} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In490922796, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out490922796|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In490922796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:12:14,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In761604274 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In761604274 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In761604274 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In761604274 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out761604274|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite44_Out761604274| ~x$w_buff1_used~0_In761604274) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In761604274, ~x$w_buff1_used~0=~x$w_buff1_used~0_In761604274, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In761604274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In761604274} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In761604274, ~x$w_buff1_used~0=~x$w_buff1_used~0_In761604274, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In761604274, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out761604274|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In761604274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:12:14,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-419601007 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-419601007 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-419601007|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-419601007| ~x$r_buff0_thd0~0_In-419601007)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-419601007, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419601007} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-419601007, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-419601007|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419601007} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:12:14,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1276583550 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1276583550 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1276583550 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1276583550 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1276583550| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In1276583550 |ULTIMATE.start_main_#t~ite46_Out1276583550|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1276583550, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1276583550, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1276583550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1276583550} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1276583550, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1276583550|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1276583550, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1276583550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1276583550} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 20:12:14,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EAX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~main$tmp_guard1~0_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:12:14,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:12:14 BasicIcfg [2019-12-27 20:12:14,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:12:14,951 INFO L168 Benchmark]: Toolchain (without parser) took 101732.05 ms. Allocated memory was 138.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 977.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:14,954 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 20:12:14,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.59 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.1 MB in the beginning and 154.6 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:14,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.77 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:14,956 INFO L168 Benchmark]: Boogie Preprocessor took 77.28 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:14,962 INFO L168 Benchmark]: RCFGBuilder took 938.45 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 102.6 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:14,962 INFO L168 Benchmark]: TraceAbstraction took 99722.59 ms. Allocated memory was 202.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 914.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:12:14,965 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.37 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 882.59 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.1 MB in the beginning and 154.6 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 104.77 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.28 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 938.45 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 102.6 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99722.59 ms. Allocated memory was 202.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 914.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 165 ProgramPointsBefore, 85 ProgramPointsAfterwards, 196 TransitionsBefore, 94 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 26 ChoiceCompositions, 6815 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 79642 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L734] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 99.4s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 52.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5738 SDtfs, 10442 SDslu, 27821 SDs, 0 SdLazy, 28963 SolverSat, 1010 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 864 GetRequests, 230 SyntacticMatches, 92 SemanticMatches, 542 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8846 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95102occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 310450 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1111 NumberOfCodeBlocks, 1111 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1031 ConstructedInterpolants, 0 QuantifiedInterpolants, 239159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...