/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/podwr001_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:48:39,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:48:39,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:48:39,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:48:39,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:48:39,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:48:39,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:48:39,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:48:39,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:48:39,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:48:39,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:48:39,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:48:39,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:48:39,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:48:39,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:48:39,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:48:39,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:48:39,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:48:39,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:48:39,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:48:39,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:48:39,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:48:39,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:48:39,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:48:39,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:48:39,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:48:39,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:48:39,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:48:39,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:48:39,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:48:39,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:48:40,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:48:40,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:48:40,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:48:40,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:48:40,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:48:40,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:48:40,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:48:40,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:48:40,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:48:40,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:48:40,006 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 21:48:40,021 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:48:40,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:48:40,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:48:40,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:48:40,023 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:48:40,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:48:40,023 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:48:40,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:48:40,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:48:40,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:48:40,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:48:40,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:48:40,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:48:40,024 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:48:40,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:48:40,025 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:48:40,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:48:40,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:48:40,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:48:40,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:48:40,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:48:40,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:48:40,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:48:40,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:48:40,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:48:40,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:48:40,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:48:40,027 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:48:40,027 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:48:40,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:48:40,028 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:48:40,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:48:40,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:48:40,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:48:40,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:48:40,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:48:40,356 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:48:40,357 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_tso.oepc.i [2019-12-27 21:48:40,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4466c3a/f2583d08a0274fd6a6f63594142d8b33/FLAG4bc572c6e [2019-12-27 21:48:40,913 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:48:40,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_tso.oepc.i [2019-12-27 21:48:40,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4466c3a/f2583d08a0274fd6a6f63594142d8b33/FLAG4bc572c6e [2019-12-27 21:48:41,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4466c3a/f2583d08a0274fd6a6f63594142d8b33 [2019-12-27 21:48:41,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:48:41,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:48:41,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:48:41,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:48:41,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:48:41,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:48:41" (1/1) ... [2019-12-27 21:48:41,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24328a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:41, skipping insertion in model container [2019-12-27 21:48:41,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:48:41" (1/1) ... [2019-12-27 21:48:41,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:48:41,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:48:41,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:48:41,868 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:48:41,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:48:42,022 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:48:42,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42 WrapperNode [2019-12-27 21:48:42,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:48:42,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:48:42,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:48:42,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:48:42,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (1/1) ... [2019-12-27 21:48:42,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (1/1) ... [2019-12-27 21:48:42,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:48:42,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:48:42,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:48:42,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:48:42,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (1/1) ... [2019-12-27 21:48:42,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (1/1) ... [2019-12-27 21:48:42,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (1/1) ... [2019-12-27 21:48:42,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (1/1) ... [2019-12-27 21:48:42,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (1/1) ... [2019-12-27 21:48:42,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (1/1) ... [2019-12-27 21:48:42,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (1/1) ... [2019-12-27 21:48:42,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:48:42,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:48:42,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:48:42,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:48:42,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (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 21:48:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:48:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:48:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:48:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:48:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:48:42,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:48:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:48:42,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:48:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:48:42,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:48:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:48:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:48:42,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:48:42,229 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 21:48:42,974 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:48:42,974 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:48:42,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:48:42 BoogieIcfgContainer [2019-12-27 21:48:42,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:48:42,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:48:42,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:48:42,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:48:42,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:48:41" (1/3) ... [2019-12-27 21:48:42,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b47008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:48:42, skipping insertion in model container [2019-12-27 21:48:42,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:48:42" (2/3) ... [2019-12-27 21:48:42,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b47008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:48:42, skipping insertion in model container [2019-12-27 21:48:42,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:48:42" (3/3) ... [2019-12-27 21:48:42,985 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_tso.oepc.i [2019-12-27 21:48:42,995 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:48:42,996 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:48:43,006 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:48:43,008 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:48:43,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,062 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,062 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,071 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,112 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,112 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,142 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,152 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,152 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,152 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,157 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,158 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:48:43,177 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:48:43,198 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:48:43,198 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:48:43,198 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:48:43,198 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:48:43,198 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:48:43,199 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:48:43,199 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:48:43,199 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:48:43,215 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 21:48:43,218 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 21:48:43,321 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 21:48:43,322 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:48:43,339 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:48:43,369 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 21:48:43,432 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 21:48:43,432 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:48:43,444 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:48:43,472 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:48:43,473 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:48:46,761 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 21:48:46,884 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:48:46,913 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-27 21:48:46,913 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 21:48:46,917 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-27 21:49:08,989 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 21:49:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 21:49:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:49:08,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:08,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:49:08,998 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:09,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:09,004 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-27 21:49:09,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:09,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266692973] [2019-12-27 21:49:09,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:09,244 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 21:49:09,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266692973] [2019-12-27 21:49:09,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:09,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:49:09,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215397135] [2019-12-27 21:49:09,248 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:09,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:09,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:49:09,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:09,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:09,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:09,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:09,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:09,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:09,288 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 21:49:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:13,105 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-27 21:49:13,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:13,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:49:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:13,860 INFO L225 Difference]: With dead ends: 120110 [2019-12-27 21:49:13,860 INFO L226 Difference]: Without dead ends: 112648 [2019-12-27 21:49:13,865 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 21:49:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-27 21:49:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-27 21:49:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-27 21:49:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-27 21:49:27,497 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-27 21:49:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:27,497 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-27 21:49:27,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-27 21:49:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:49:27,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:27,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:27,502 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:27,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-27 21:49:27,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:27,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706284669] [2019-12-27 21:49:27,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:27,597 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 21:49:27,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706284669] [2019-12-27 21:49:27,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:27,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:27,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [518685238] [2019-12-27 21:49:27,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:27,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:27,604 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:49:27,604 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:27,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:27,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:49:27,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:27,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:49:27,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:49:27,607 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-27 21:49:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:33,620 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-27 21:49:33,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:49:33,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:49:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:34,291 INFO L225 Difference]: With dead ends: 175220 [2019-12-27 21:49:34,291 INFO L226 Difference]: Without dead ends: 175171 [2019-12-27 21:49:34,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-27 21:49:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-27 21:49:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-27 21:49:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-27 21:49:44,163 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-27 21:49:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:44,163 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-27 21:49:44,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:49:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-27 21:49:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:49:44,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:44,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:44,171 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:44,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:44,171 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-27 21:49:44,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:44,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594226119] [2019-12-27 21:49:44,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:44,241 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 21:49:44,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594226119] [2019-12-27 21:49:44,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:44,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:44,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95936366] [2019-12-27 21:49:44,242 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:44,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:44,245 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:49:44,245 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:44,246 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:44,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:44,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:44,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:44,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:44,247 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-27 21:49:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:44,418 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-27 21:49:44,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:44,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:49:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:44,480 INFO L225 Difference]: With dead ends: 34935 [2019-12-27 21:49:44,481 INFO L226 Difference]: Without dead ends: 34935 [2019-12-27 21:49:44,481 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 21:49:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-27 21:49:45,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-27 21:49:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-27 21:49:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-27 21:49:45,114 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-27 21:49:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:45,114 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-27 21:49:45,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-27 21:49:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:49:45,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:45,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:45,117 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:45,118 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-27 21:49:45,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:45,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515902033] [2019-12-27 21:49:45,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:45,172 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 21:49:45,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515902033] [2019-12-27 21:49:45,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:45,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:45,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248568184] [2019-12-27 21:49:45,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:45,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:45,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:49:45,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:45,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:45,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:45,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:45,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:45,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:45,179 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-27 21:49:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:45,889 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-27 21:49:45,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:45,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:49:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:45,975 INFO L225 Difference]: With dead ends: 52469 [2019-12-27 21:49:45,975 INFO L226 Difference]: Without dead ends: 52469 [2019-12-27 21:49:45,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-27 21:49:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-27 21:49:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-27 21:49:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-27 21:49:46,777 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-27 21:49:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:46,778 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-27 21:49:46,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-27 21:49:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:49:46,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:46,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:46,781 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-27 21:49:46,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:46,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823481822] [2019-12-27 21:49:46,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:46,872 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 21:49:46,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823481822] [2019-12-27 21:49:46,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:46,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:46,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2060089975] [2019-12-27 21:49:46,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:46,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:46,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:49:46,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:46,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:46,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:46,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:46,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:46,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:46,880 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-27 21:49:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:47,412 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-27 21:49:47,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:49:47,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:49:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:47,506 INFO L225 Difference]: With dead ends: 54128 [2019-12-27 21:49:47,506 INFO L226 Difference]: Without dead ends: 54128 [2019-12-27 21:49:47,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:49:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-27 21:49:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-27 21:49:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-27 21:49:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-27 21:49:48,809 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-27 21:49:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:48,809 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-27 21:49:48,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-27 21:49:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:49:48,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:48,822 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 21:49:48,823 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:48,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-27 21:49:48,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:48,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495154013] [2019-12-27 21:49:48,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:48,919 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 21:49:48,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495154013] [2019-12-27 21:49:48,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:48,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:49:48,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [668587869] [2019-12-27 21:49:48,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:48,923 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:48,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 21:49:48,931 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:48,980 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:49:48,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:49:48,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:48,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:49:48,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:49:48,981 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 7 states. [2019-12-27 21:49:49,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:49,992 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-27 21:49:49,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:49:49,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 21:49:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:50,115 INFO L225 Difference]: With dead ends: 67629 [2019-12-27 21:49:50,115 INFO L226 Difference]: Without dead ends: 67622 [2019-12-27 21:49:50,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:49:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-27 21:49:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-27 21:49:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-27 21:49:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-27 21:49:51,611 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-27 21:49:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:51,611 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-27 21:49:51,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:49:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-27 21:49:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:49:51,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:51,630 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 21:49:51,630 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:51,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-27 21:49:51,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:51,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293392563] [2019-12-27 21:49:51,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:51,689 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 21:49:51,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293392563] [2019-12-27 21:49:51,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:51,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:51,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [586832634] [2019-12-27 21:49:51,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:51,694 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:51,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:49:51,704 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:51,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:49:51,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:51,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:51,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:51,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:51,723 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 5 states. [2019-12-27 21:49:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:51,816 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-27 21:49:51,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:49:51,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:49:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:51,843 INFO L225 Difference]: With dead ends: 18428 [2019-12-27 21:49:51,843 INFO L226 Difference]: Without dead ends: 18428 [2019-12-27 21:49:51,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:49:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-27 21:49:52,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-27 21:49:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-27 21:49:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-27 21:49:52,141 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-27 21:49:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:52,142 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-27 21:49:52,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-27 21:49:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:49:52,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:52,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:52,156 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:52,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:52,156 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-27 21:49:52,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:52,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070019519] [2019-12-27 21:49:52,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:52,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 21:49:52,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070019519] [2019-12-27 21:49:52,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:52,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:49:52,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1818186262] [2019-12-27 21:49:52,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:52,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:52,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:49:52,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:52,260 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:52,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:49:52,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:52,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:49:52,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:49:52,261 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-27 21:49:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:52,909 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-27 21:49:52,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:49:52,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:49:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:52,949 INFO L225 Difference]: With dead ends: 25507 [2019-12-27 21:49:52,949 INFO L226 Difference]: Without dead ends: 25507 [2019-12-27 21:49:52,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:49:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-27 21:49:53,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-27 21:49:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-27 21:49:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-27 21:49:53,330 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-27 21:49:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:53,330 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-27 21:49:53,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:49:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-27 21:49:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:49:53,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:53,648 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:53,648 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:53,648 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-27 21:49:53,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:53,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716868927] [2019-12-27 21:49:53,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:53,773 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 21:49:53,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716868927] [2019-12-27 21:49:53,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:53,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:49:53,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [943482434] [2019-12-27 21:49:53,774 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:53,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:53,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 21:49:53,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:53,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:49:53,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:49:53,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:53,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:49:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:49:53,819 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 8 states. [2019-12-27 21:49:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:54,920 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-27 21:49:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:49:54,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 21:49:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:54,964 INFO L225 Difference]: With dead ends: 28486 [2019-12-27 21:49:54,965 INFO L226 Difference]: Without dead ends: 28486 [2019-12-27 21:49:54,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:49:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-27 21:49:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-27 21:49:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-27 21:49:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-27 21:49:55,341 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-27 21:49:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:55,342 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-27 21:49:55,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:49:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-27 21:49:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:49:55,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:55,369 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 21:49:55,369 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:55,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-27 21:49:55,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:55,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048125338] [2019-12-27 21:49:55,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:55,441 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 21:49:55,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048125338] [2019-12-27 21:49:55,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:55,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:49:55,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [728095998] [2019-12-27 21:49:55,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:55,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:55,509 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 21:49:55,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:55,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:49:55,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:49:55,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:55,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:49:55,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:49:55,585 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 8 states. [2019-12-27 21:49:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:56,695 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-27 21:49:56,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:49:56,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 21:49:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:56,767 INFO L225 Difference]: With dead ends: 28283 [2019-12-27 21:49:56,768 INFO L226 Difference]: Without dead ends: 28283 [2019-12-27 21:49:56,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:49:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-27 21:49:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-27 21:49:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-27 21:49:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-27 21:49:57,248 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-27 21:49:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:57,248 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-27 21:49:57,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:49:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-27 21:49:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:49:57,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:57,278 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 21:49:57,278 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-27 21:49:57,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:57,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024923238] [2019-12-27 21:49:57,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:57,336 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 21:49:57,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024923238] [2019-12-27 21:49:57,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:57,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:49:57,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006173467] [2019-12-27 21:49:57,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:57,345 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:57,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 331 transitions. [2019-12-27 21:49:57,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:57,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:49:57,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:49:57,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:57,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:49:57,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:49:57,760 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 7 states. [2019-12-27 21:49:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:57,864 INFO L93 Difference]: Finished difference Result 24998 states and 77951 transitions. [2019-12-27 21:49:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:49:57,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 21:49:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:57,903 INFO L225 Difference]: With dead ends: 24998 [2019-12-27 21:49:57,903 INFO L226 Difference]: Without dead ends: 24998 [2019-12-27 21:49:57,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:49:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2019-12-27 21:49:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 24032. [2019-12-27 21:49:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24032 states. [2019-12-27 21:49:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24032 states to 24032 states and 75345 transitions. [2019-12-27 21:49:58,287 INFO L78 Accepts]: Start accepts. Automaton has 24032 states and 75345 transitions. Word has length 39 [2019-12-27 21:49:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:58,287 INFO L462 AbstractCegarLoop]: Abstraction has 24032 states and 75345 transitions. [2019-12-27 21:49:58,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:49:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 24032 states and 75345 transitions. [2019-12-27 21:49:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:49:58,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:58,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:58,315 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:58,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1198798044, now seen corresponding path program 1 times [2019-12-27 21:49:58,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:58,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148403479] [2019-12-27 21:49:58,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:58,422 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 21:49:58,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148403479] [2019-12-27 21:49:58,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:58,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:49:58,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [148949225] [2019-12-27 21:49:58,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:58,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:58,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 321 transitions. [2019-12-27 21:49:58,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:58,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:49:58,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:49:58,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:58,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:49:58,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:49:58,687 INFO L87 Difference]: Start difference. First operand 24032 states and 75345 transitions. Second operand 8 states. [2019-12-27 21:49:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:59,612 INFO L93 Difference]: Finished difference Result 82358 states and 256539 transitions. [2019-12-27 21:49:59,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:49:59,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 21:49:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:59,725 INFO L225 Difference]: With dead ends: 82358 [2019-12-27 21:49:59,726 INFO L226 Difference]: Without dead ends: 66507 [2019-12-27 21:49:59,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:49:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66507 states. [2019-12-27 21:50:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66507 to 27688. [2019-12-27 21:50:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27688 states. [2019-12-27 21:50:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27688 states to 27688 states and 87532 transitions. [2019-12-27 21:50:00,894 INFO L78 Accepts]: Start accepts. Automaton has 27688 states and 87532 transitions. Word has length 64 [2019-12-27 21:50:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:00,894 INFO L462 AbstractCegarLoop]: Abstraction has 27688 states and 87532 transitions. [2019-12-27 21:50:00,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:50:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 27688 states and 87532 transitions. [2019-12-27 21:50:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:50:00,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:00,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:00,938 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash 207970498, now seen corresponding path program 2 times [2019-12-27 21:50:00,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:00,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057014497] [2019-12-27 21:50:00,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:01,056 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 21:50:01,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057014497] [2019-12-27 21:50:01,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:01,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:50:01,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [960092855] [2019-12-27 21:50:01,057 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:01,077 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:01,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 275 transitions. [2019-12-27 21:50:01,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:01,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:50:01,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:50:01,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:01,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:50:01,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:50:01,312 INFO L87 Difference]: Start difference. First operand 27688 states and 87532 transitions. Second operand 10 states. [2019-12-27 21:50:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:03,540 INFO L93 Difference]: Finished difference Result 88226 states and 275339 transitions. [2019-12-27 21:50:03,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:50:03,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 21:50:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:03,640 INFO L225 Difference]: With dead ends: 88226 [2019-12-27 21:50:03,640 INFO L226 Difference]: Without dead ends: 65053 [2019-12-27 21:50:03,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:50:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65053 states. [2019-12-27 21:50:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65053 to 32348. [2019-12-27 21:50:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32348 states. [2019-12-27 21:50:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32348 states to 32348 states and 102236 transitions. [2019-12-27 21:50:04,888 INFO L78 Accepts]: Start accepts. Automaton has 32348 states and 102236 transitions. Word has length 64 [2019-12-27 21:50:04,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:04,889 INFO L462 AbstractCegarLoop]: Abstraction has 32348 states and 102236 transitions. [2019-12-27 21:50:04,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:50:04,889 INFO L276 IsEmpty]: Start isEmpty. Operand 32348 states and 102236 transitions. [2019-12-27 21:50:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:50:04,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:04,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:04,924 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1789319912, now seen corresponding path program 3 times [2019-12-27 21:50:04,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:04,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396752490] [2019-12-27 21:50:04,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:05,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396752490] [2019-12-27 21:50:05,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:05,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:50:05,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [596814219] [2019-12-27 21:50:05,016 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:05,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:05,250 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 361 transitions. [2019-12-27 21:50:05,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:05,295 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:50:05,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:50:05,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:05,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:50:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:50:05,296 INFO L87 Difference]: Start difference. First operand 32348 states and 102236 transitions. Second operand 8 states. [2019-12-27 21:50:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:06,983 INFO L93 Difference]: Finished difference Result 87822 states and 272155 transitions. [2019-12-27 21:50:06,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:50:06,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 21:50:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:07,185 INFO L225 Difference]: With dead ends: 87822 [2019-12-27 21:50:07,185 INFO L226 Difference]: Without dead ends: 78373 [2019-12-27 21:50:07,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:50:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78373 states. [2019-12-27 21:50:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78373 to 32656. [2019-12-27 21:50:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32656 states. [2019-12-27 21:50:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 103187 transitions. [2019-12-27 21:50:08,647 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 103187 transitions. Word has length 64 [2019-12-27 21:50:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:08,647 INFO L462 AbstractCegarLoop]: Abstraction has 32656 states and 103187 transitions. [2019-12-27 21:50:08,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:50:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 103187 transitions. [2019-12-27 21:50:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:50:08,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:08,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:08,684 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash 755538776, now seen corresponding path program 4 times [2019-12-27 21:50:08,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:08,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974954653] [2019-12-27 21:50:08,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:08,750 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 21:50:08,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974954653] [2019-12-27 21:50:08,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:08,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:08,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [228625652] [2019-12-27 21:50:08,751 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:08,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:09,015 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 500 transitions. [2019-12-27 21:50:09,015 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:09,016 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:09,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:09,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:09,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:09,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:09,017 INFO L87 Difference]: Start difference. First operand 32656 states and 103187 transitions. Second operand 3 states. [2019-12-27 21:50:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:09,188 INFO L93 Difference]: Finished difference Result 39410 states and 123345 transitions. [2019-12-27 21:50:09,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:09,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:50:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:09,246 INFO L225 Difference]: With dead ends: 39410 [2019-12-27 21:50:09,246 INFO L226 Difference]: Without dead ends: 39410 [2019-12-27 21:50:09,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39410 states. [2019-12-27 21:50:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39410 to 34552. [2019-12-27 21:50:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34552 states. [2019-12-27 21:50:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34552 states to 34552 states and 109132 transitions. [2019-12-27 21:50:09,842 INFO L78 Accepts]: Start accepts. Automaton has 34552 states and 109132 transitions. Word has length 64 [2019-12-27 21:50:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:09,842 INFO L462 AbstractCegarLoop]: Abstraction has 34552 states and 109132 transitions. [2019-12-27 21:50:09,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34552 states and 109132 transitions. [2019-12-27 21:50:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:50:09,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:09,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:09,881 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:09,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:09,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2009701319, now seen corresponding path program 1 times [2019-12-27 21:50:09,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:09,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647023348] [2019-12-27 21:50:09,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:09,936 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 21:50:09,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647023348] [2019-12-27 21:50:09,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:09,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:50:09,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2085223553] [2019-12-27 21:50:09,937 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:09,959 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:10,599 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 304 transitions. [2019-12-27 21:50:10,599 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:10,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:50:10,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:50:10,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:10,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:50:10,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:10,624 INFO L87 Difference]: Start difference. First operand 34552 states and 109132 transitions. Second operand 5 states. [2019-12-27 21:50:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:11,241 INFO L93 Difference]: Finished difference Result 61028 states and 191780 transitions. [2019-12-27 21:50:11,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:50:11,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 21:50:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:11,383 INFO L225 Difference]: With dead ends: 61028 [2019-12-27 21:50:11,383 INFO L226 Difference]: Without dead ends: 61028 [2019-12-27 21:50:11,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:50:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61028 states. [2019-12-27 21:50:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61028 to 37988. [2019-12-27 21:50:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37988 states. [2019-12-27 21:50:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37988 states to 37988 states and 121326 transitions. [2019-12-27 21:50:12,210 INFO L78 Accepts]: Start accepts. Automaton has 37988 states and 121326 transitions. Word has length 65 [2019-12-27 21:50:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:12,210 INFO L462 AbstractCegarLoop]: Abstraction has 37988 states and 121326 transitions. [2019-12-27 21:50:12,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:50:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 37988 states and 121326 transitions. [2019-12-27 21:50:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:50:12,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:12,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:12,252 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:12,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2089376379, now seen corresponding path program 2 times [2019-12-27 21:50:12,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:12,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477023298] [2019-12-27 21:50:12,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:12,300 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 21:50:12,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477023298] [2019-12-27 21:50:12,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:12,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:12,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [727647853] [2019-12-27 21:50:12,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:12,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:12,499 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 296 transitions. [2019-12-27 21:50:12,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:12,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:50:12,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:12,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:12,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:12,512 INFO L87 Difference]: Start difference. First operand 37988 states and 121326 transitions. Second operand 3 states. [2019-12-27 21:50:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:12,785 INFO L93 Difference]: Finished difference Result 53096 states and 168447 transitions. [2019-12-27 21:50:12,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:12,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:50:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:12,872 INFO L225 Difference]: With dead ends: 53096 [2019-12-27 21:50:12,872 INFO L226 Difference]: Without dead ends: 53096 [2019-12-27 21:50:12,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 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 21:50:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53096 states. [2019-12-27 21:50:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53096 to 38139. [2019-12-27 21:50:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38139 states. [2019-12-27 21:50:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38139 states to 38139 states and 121744 transitions. [2019-12-27 21:50:13,972 INFO L78 Accepts]: Start accepts. Automaton has 38139 states and 121744 transitions. Word has length 65 [2019-12-27 21:50:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:13,972 INFO L462 AbstractCegarLoop]: Abstraction has 38139 states and 121744 transitions. [2019-12-27 21:50:13,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 38139 states and 121744 transitions. [2019-12-27 21:50:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:50:14,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:14,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:14,015 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1789961201, now seen corresponding path program 3 times [2019-12-27 21:50:14,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:14,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848887673] [2019-12-27 21:50:14,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:14,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848887673] [2019-12-27 21:50:14,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:14,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:50:14,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [446234398] [2019-12-27 21:50:14,089 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:14,109 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:14,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 279 transitions. [2019-12-27 21:50:14,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:14,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:50:14,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:50:14,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:50:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:50:14,278 INFO L87 Difference]: Start difference. First operand 38139 states and 121744 transitions. Second operand 7 states. [2019-12-27 21:50:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:14,810 INFO L93 Difference]: Finished difference Result 80217 states and 251951 transitions. [2019-12-27 21:50:14,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:50:14,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 21:50:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:14,925 INFO L225 Difference]: With dead ends: 80217 [2019-12-27 21:50:14,925 INFO L226 Difference]: Without dead ends: 73955 [2019-12-27 21:50:14,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:50:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73955 states. [2019-12-27 21:50:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73955 to 38203. [2019-12-27 21:50:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38203 states. [2019-12-27 21:50:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38203 states to 38203 states and 121962 transitions. [2019-12-27 21:50:16,371 INFO L78 Accepts]: Start accepts. Automaton has 38203 states and 121962 transitions. Word has length 65 [2019-12-27 21:50:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:16,372 INFO L462 AbstractCegarLoop]: Abstraction has 38203 states and 121962 transitions. [2019-12-27 21:50:16,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:50:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 38203 states and 121962 transitions. [2019-12-27 21:50:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:50:16,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:16,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:16,416 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash 206855563, now seen corresponding path program 4 times [2019-12-27 21:50:16,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:16,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915245124] [2019-12-27 21:50:16,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:16,517 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 21:50:16,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915245124] [2019-12-27 21:50:16,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:16,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:50:16,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [852911076] [2019-12-27 21:50:16,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:16,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:16,787 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 387 transitions. [2019-12-27 21:50:16,787 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:16,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:50:16,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:50:16,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:16,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:50:16,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:50:16,881 INFO L87 Difference]: Start difference. First operand 38203 states and 121962 transitions. Second operand 10 states. [2019-12-27 21:50:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:18,952 INFO L93 Difference]: Finished difference Result 93660 states and 294565 transitions. [2019-12-27 21:50:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 21:50:18,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 21:50:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:19,105 INFO L225 Difference]: With dead ends: 93660 [2019-12-27 21:50:19,105 INFO L226 Difference]: Without dead ends: 93660 [2019-12-27 21:50:19,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:50:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93660 states. [2019-12-27 21:50:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93660 to 36001. [2019-12-27 21:50:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36001 states. [2019-12-27 21:50:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36001 states to 36001 states and 113537 transitions. [2019-12-27 21:50:20,762 INFO L78 Accepts]: Start accepts. Automaton has 36001 states and 113537 transitions. Word has length 65 [2019-12-27 21:50:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:20,762 INFO L462 AbstractCegarLoop]: Abstraction has 36001 states and 113537 transitions. [2019-12-27 21:50:20,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:50:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 36001 states and 113537 transitions. [2019-12-27 21:50:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:50:20,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:20,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:20,804 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash -217073613, now seen corresponding path program 5 times [2019-12-27 21:50:20,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:20,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459764800] [2019-12-27 21:50:20,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:20,875 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 21:50:20,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459764800] [2019-12-27 21:50:20,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:20,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:20,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1963112007] [2019-12-27 21:50:20,876 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:20,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:21,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 237 states and 414 transitions. [2019-12-27 21:50:21,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:21,248 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:21,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:50:21,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:21,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:50:21,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:50:21,249 INFO L87 Difference]: Start difference. First operand 36001 states and 113537 transitions. Second operand 4 states. [2019-12-27 21:50:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:21,527 INFO L93 Difference]: Finished difference Result 43922 states and 137939 transitions. [2019-12-27 21:50:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:50:21,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 21:50:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:21,591 INFO L225 Difference]: With dead ends: 43922 [2019-12-27 21:50:21,591 INFO L226 Difference]: Without dead ends: 43922 [2019-12-27 21:50:21,591 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 21:50:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43922 states. [2019-12-27 21:50:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43922 to 36010. [2019-12-27 21:50:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36010 states. [2019-12-27 21:50:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36010 states to 36010 states and 114136 transitions. [2019-12-27 21:50:22,232 INFO L78 Accepts]: Start accepts. Automaton has 36010 states and 114136 transitions. Word has length 65 [2019-12-27 21:50:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:22,232 INFO L462 AbstractCegarLoop]: Abstraction has 36010 states and 114136 transitions. [2019-12-27 21:50:22,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:50:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 36010 states and 114136 transitions. [2019-12-27 21:50:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:50:22,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:22,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:22,276 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1865713068, now seen corresponding path program 1 times [2019-12-27 21:50:22,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:22,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176180639] [2019-12-27 21:50:22,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:22,346 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 21:50:22,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176180639] [2019-12-27 21:50:22,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:22,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:22,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [532237983] [2019-12-27 21:50:22,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:22,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:22,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 501 transitions. [2019-12-27 21:50:22,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:22,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:22,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:22,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:22,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:22,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:22,597 INFO L87 Difference]: Start difference. First operand 36010 states and 114136 transitions. Second operand 3 states. [2019-12-27 21:50:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:23,108 INFO L93 Difference]: Finished difference Result 36010 states and 114135 transitions. [2019-12-27 21:50:23,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:23,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:50:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:23,166 INFO L225 Difference]: With dead ends: 36010 [2019-12-27 21:50:23,167 INFO L226 Difference]: Without dead ends: 36010 [2019-12-27 21:50:23,167 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 21:50:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36010 states. [2019-12-27 21:50:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36010 to 31976. [2019-12-27 21:50:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31976 states. [2019-12-27 21:50:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 102860 transitions. [2019-12-27 21:50:23,732 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 102860 transitions. Word has length 65 [2019-12-27 21:50:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:23,732 INFO L462 AbstractCegarLoop]: Abstraction has 31976 states and 102860 transitions. [2019-12-27 21:50:23,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 102860 transitions. [2019-12-27 21:50:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:50:23,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:23,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:23,777 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:23,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:23,777 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-27 21:50:23,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:23,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743630842] [2019-12-27 21:50:23,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:23,835 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 21:50:23,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743630842] [2019-12-27 21:50:23,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:23,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:23,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1302408392] [2019-12-27 21:50:23,836 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:23,855 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:24,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 280 states and 502 transitions. [2019-12-27 21:50:24,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:24,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:50:24,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:50:24,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:24,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:50:24,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:50:24,240 INFO L87 Difference]: Start difference. First operand 31976 states and 102860 transitions. Second operand 4 states. [2019-12-27 21:50:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:24,658 INFO L93 Difference]: Finished difference Result 34683 states and 108446 transitions. [2019-12-27 21:50:24,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:50:24,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:50:24,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:24,731 INFO L225 Difference]: With dead ends: 34683 [2019-12-27 21:50:24,732 INFO L226 Difference]: Without dead ends: 34683 [2019-12-27 21:50:24,736 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 21:50:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34683 states. [2019-12-27 21:50:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34683 to 24273. [2019-12-27 21:50:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-27 21:50:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 76412 transitions. [2019-12-27 21:50:25,189 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 76412 transitions. Word has length 66 [2019-12-27 21:50:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:25,189 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 76412 transitions. [2019-12-27 21:50:25,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:50:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 76412 transitions. [2019-12-27 21:50:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:50:25,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:25,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:50:25,215 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:25,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:25,215 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-27 21:50:25,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:25,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765721270] [2019-12-27 21:50:25,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:25,369 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 21:50:25,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765721270] [2019-12-27 21:50:25,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:25,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:50:25,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2045861540] [2019-12-27 21:50:25,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:25,390 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:25,995 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 322 transitions. [2019-12-27 21:50:25,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:26,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:50:26,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:50:26,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:50:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:50:26,102 INFO L87 Difference]: Start difference. First operand 24273 states and 76412 transitions. Second operand 12 states. [2019-12-27 21:50:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:27,761 INFO L93 Difference]: Finished difference Result 35523 states and 111659 transitions. [2019-12-27 21:50:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:50:27,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 21:50:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:27,806 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 21:50:27,807 INFO L226 Difference]: Without dead ends: 28791 [2019-12-27 21:50:27,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:50:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-27 21:50:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 24621. [2019-12-27 21:50:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-12-27 21:50:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 77383 transitions. [2019-12-27 21:50:28,225 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 77383 transitions. Word has length 67 [2019-12-27 21:50:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:28,225 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 77383 transitions. [2019-12-27 21:50:28,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:50:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 77383 transitions. [2019-12-27 21:50:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:50:28,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:28,254 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:28,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:28,254 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-27 21:50:28,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:28,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014410996] [2019-12-27 21:50:28,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:28,439 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 21:50:28,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014410996] [2019-12-27 21:50:28,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:28,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:50:28,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1276353689] [2019-12-27 21:50:28,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:28,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:28,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 341 transitions. [2019-12-27 21:50:28,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:28,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:50:28,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:50:28,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:28,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:50:28,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:50:28,886 INFO L87 Difference]: Start difference. First operand 24621 states and 77383 transitions. Second operand 13 states. [2019-12-27 21:50:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:30,826 INFO L93 Difference]: Finished difference Result 45644 states and 141958 transitions. [2019-12-27 21:50:30,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 21:50:30,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 21:50:30,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:30,888 INFO L225 Difference]: With dead ends: 45644 [2019-12-27 21:50:30,888 INFO L226 Difference]: Without dead ends: 40426 [2019-12-27 21:50:30,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:50:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40426 states. [2019-12-27 21:50:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40426 to 25169. [2019-12-27 21:50:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25169 states. [2019-12-27 21:50:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 78786 transitions. [2019-12-27 21:50:31,405 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 78786 transitions. Word has length 67 [2019-12-27 21:50:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:31,405 INFO L462 AbstractCegarLoop]: Abstraction has 25169 states and 78786 transitions. [2019-12-27 21:50:31,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:50:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 78786 transitions. [2019-12-27 21:50:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:50:31,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:31,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:31,434 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-27 21:50:31,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:31,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004488454] [2019-12-27 21:50:31,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:31,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004488454] [2019-12-27 21:50:31,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:31,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:50:31,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [890179586] [2019-12-27 21:50:31,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:31,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:32,131 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 302 states and 617 transitions. [2019-12-27 21:50:32,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:32,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:50:32,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:50:32,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 21:50:32,907 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:50:32,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:50:32,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 21:50:32,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:32,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 21:50:32,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:50:32,910 INFO L87 Difference]: Start difference. First operand 25169 states and 78786 transitions. Second operand 19 states. [2019-12-27 21:50:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:36,337 INFO L93 Difference]: Finished difference Result 34459 states and 107407 transitions. [2019-12-27 21:50:36,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:50:36,337 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 21:50:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:36,380 INFO L225 Difference]: With dead ends: 34459 [2019-12-27 21:50:36,380 INFO L226 Difference]: Without dead ends: 30448 [2019-12-27 21:50:36,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:50:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-12-27 21:50:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 24805. [2019-12-27 21:50:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-27 21:50:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-27 21:50:36,798 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 67 [2019-12-27 21:50:36,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:36,798 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-27 21:50:36,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 21:50:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-27 21:50:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:50:36,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:36,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:36,826 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:36,826 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-27 21:50:36,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:36,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187293729] [2019-12-27 21:50:36,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:37,048 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 21:50:37,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187293729] [2019-12-27 21:50:37,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:37,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:50:37,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1949568367] [2019-12-27 21:50:37,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:37,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:37,210 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 324 transitions. [2019-12-27 21:50:37,210 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:37,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:50:37,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:50:37,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:37,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:50:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:50:37,401 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 15 states. [2019-12-27 21:50:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:39,768 INFO L93 Difference]: Finished difference Result 50603 states and 158867 transitions. [2019-12-27 21:50:39,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 21:50:39,768 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 21:50:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:39,842 INFO L225 Difference]: With dead ends: 50603 [2019-12-27 21:50:39,842 INFO L226 Difference]: Without dead ends: 48055 [2019-12-27 21:50:39,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 21:50:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48055 states. [2019-12-27 21:50:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48055 to 28332. [2019-12-27 21:50:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28332 states. [2019-12-27 21:50:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28332 states to 28332 states and 88818 transitions. [2019-12-27 21:50:40,453 INFO L78 Accepts]: Start accepts. Automaton has 28332 states and 88818 transitions. Word has length 67 [2019-12-27 21:50:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:40,453 INFO L462 AbstractCegarLoop]: Abstraction has 28332 states and 88818 transitions. [2019-12-27 21:50:40,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:50:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 28332 states and 88818 transitions. [2019-12-27 21:50:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:50:40,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:40,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:40,488 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:40,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 5 times [2019-12-27 21:50:40,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:40,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537301508] [2019-12-27 21:50:40,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:41,111 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 21:50:41,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537301508] [2019-12-27 21:50:41,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:41,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 21:50:41,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2073734648] [2019-12-27 21:50:41,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:41,121 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:41,375 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 323 states and 677 transitions. [2019-12-27 21:50:41,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:42,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:50:42,242 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 21:50:42,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 21:50:42,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:42,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 21:50:42,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:50:42,243 INFO L87 Difference]: Start difference. First operand 28332 states and 88818 transitions. Second operand 30 states. [2019-12-27 21:50:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:59,736 INFO L93 Difference]: Finished difference Result 72523 states and 221832 transitions. [2019-12-27 21:50:59,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-27 21:50:59,736 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 21:50:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:59,839 INFO L225 Difference]: With dead ends: 72523 [2019-12-27 21:50:59,840 INFO L226 Difference]: Without dead ends: 68051 [2019-12-27 21:50:59,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 13 SyntacticMatches, 17 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3362 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1365, Invalid=9977, Unknown=0, NotChecked=0, Total=11342 [2019-12-27 21:51:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68051 states. [2019-12-27 21:51:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68051 to 29878. [2019-12-27 21:51:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29878 states. [2019-12-27 21:51:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29878 states to 29878 states and 93126 transitions. [2019-12-27 21:51:00,824 INFO L78 Accepts]: Start accepts. Automaton has 29878 states and 93126 transitions. Word has length 67 [2019-12-27 21:51:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:00,824 INFO L462 AbstractCegarLoop]: Abstraction has 29878 states and 93126 transitions. [2019-12-27 21:51:00,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 21:51:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 29878 states and 93126 transitions. [2019-12-27 21:51:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:51:00,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:00,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:00,859 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:00,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1883446901, now seen corresponding path program 6 times [2019-12-27 21:51:00,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:00,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407459583] [2019-12-27 21:51:00,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:01,021 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 21:51:01,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407459583] [2019-12-27 21:51:01,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:01,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:51:01,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599195386] [2019-12-27 21:51:01,022 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:01,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:01,270 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 332 transitions. [2019-12-27 21:51:01,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:02,390 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-27 21:51:02,790 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-12-27 21:51:02,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 21:51:03,043 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 21:51:03,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 21:51:03,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 21:51:03,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:03,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 21:51:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:51:03,045 INFO L87 Difference]: Start difference. First operand 29878 states and 93126 transitions. Second operand 30 states. [2019-12-27 21:51:13,861 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-12-27 21:51:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:17,694 INFO L93 Difference]: Finished difference Result 86305 states and 261561 transitions. [2019-12-27 21:51:17,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 21:51:17,694 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 21:51:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:17,794 INFO L225 Difference]: With dead ends: 86305 [2019-12-27 21:51:17,794 INFO L226 Difference]: Without dead ends: 61976 [2019-12-27 21:51:17,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2727 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1733, Invalid=8979, Unknown=0, NotChecked=0, Total=10712 [2019-12-27 21:51:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61976 states. [2019-12-27 21:51:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61976 to 36156. [2019-12-27 21:51:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36156 states. [2019-12-27 21:51:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36156 states to 36156 states and 113038 transitions. [2019-12-27 21:51:18,578 INFO L78 Accepts]: Start accepts. Automaton has 36156 states and 113038 transitions. Word has length 67 [2019-12-27 21:51:18,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:18,579 INFO L462 AbstractCegarLoop]: Abstraction has 36156 states and 113038 transitions. [2019-12-27 21:51:18,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 21:51:18,579 INFO L276 IsEmpty]: Start isEmpty. Operand 36156 states and 113038 transitions. [2019-12-27 21:51:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:51:18,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:18,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:18,621 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:18,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:18,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1208603803, now seen corresponding path program 7 times [2019-12-27 21:51:18,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:18,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440662053] [2019-12-27 21:51:18,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:19,057 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 21:51:19,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440662053] [2019-12-27 21:51:19,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:19,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 21:51:19,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896344276] [2019-12-27 21:51:19,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:19,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:19,314 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 310 states and 633 transitions. [2019-12-27 21:51:19,314 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:19,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:51:20,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 48 times. [2019-12-27 21:51:20,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 21:51:20,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:20,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 21:51:20,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-12-27 21:51:20,419 INFO L87 Difference]: Start difference. First operand 36156 states and 113038 transitions. Second operand 29 states. [2019-12-27 21:51:22,082 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-27 21:51:22,689 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-27 21:51:23,484 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-27 21:51:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:31,787 INFO L93 Difference]: Finished difference Result 65921 states and 200351 transitions. [2019-12-27 21:51:31,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-12-27 21:51:31,788 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2019-12-27 21:51:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:31,882 INFO L225 Difference]: With dead ends: 65921 [2019-12-27 21:51:31,882 INFO L226 Difference]: Without dead ends: 61658 [2019-12-27 21:51:31,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 22 SyntacticMatches, 17 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2232 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1009, Invalid=7181, Unknown=0, NotChecked=0, Total=8190 [2019-12-27 21:51:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61658 states. [2019-12-27 21:51:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61658 to 35449. [2019-12-27 21:51:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35449 states. [2019-12-27 21:51:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35449 states to 35449 states and 110404 transitions. [2019-12-27 21:51:32,621 INFO L78 Accepts]: Start accepts. Automaton has 35449 states and 110404 transitions. Word has length 67 [2019-12-27 21:51:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:32,621 INFO L462 AbstractCegarLoop]: Abstraction has 35449 states and 110404 transitions. [2019-12-27 21:51:32,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 21:51:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 35449 states and 110404 transitions. [2019-12-27 21:51:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:51:32,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:32,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:32,659 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:32,659 INFO L82 PathProgramCache]: Analyzing trace with hash 745191327, now seen corresponding path program 8 times [2019-12-27 21:51:32,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:32,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056161632] [2019-12-27 21:51:32,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:32,810 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 21:51:32,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056161632] [2019-12-27 21:51:32,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:32,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:51:32,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [783107946] [2019-12-27 21:51:32,811 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:32,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:33,438 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 355 states and 753 transitions. [2019-12-27 21:51:33,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:33,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 21:51:33,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:51:33,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:33,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:51:33,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:51:33,680 INFO L87 Difference]: Start difference. First operand 35449 states and 110404 transitions. Second operand 16 states. [2019-12-27 21:51:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:35,457 INFO L93 Difference]: Finished difference Result 56126 states and 173826 transitions. [2019-12-27 21:51:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 21:51:35,458 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 21:51:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:35,534 INFO L225 Difference]: With dead ends: 56126 [2019-12-27 21:51:35,535 INFO L226 Difference]: Without dead ends: 48200 [2019-12-27 21:51:35,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 21:51:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48200 states. [2019-12-27 21:51:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48200 to 30237. [2019-12-27 21:51:36,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30237 states. [2019-12-27 21:51:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30237 states to 30237 states and 94435 transitions. [2019-12-27 21:51:36,173 INFO L78 Accepts]: Start accepts. Automaton has 30237 states and 94435 transitions. Word has length 67 [2019-12-27 21:51:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:36,174 INFO L462 AbstractCegarLoop]: Abstraction has 30237 states and 94435 transitions. [2019-12-27 21:51:36,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:51:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 30237 states and 94435 transitions. [2019-12-27 21:51:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:51:36,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:36,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:36,211 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:36,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:36,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 9 times [2019-12-27 21:51:36,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:36,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657417533] [2019-12-27 21:51:36,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:51:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:51:36,330 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:51:36,330 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:51:36,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1579~0.base_21| 4) |v_#length_21|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1579~0.base_21|) 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1579~0.base_21|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1579~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1579~0.base_21|) |v_ULTIMATE.start_main_~#t1579~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= 0 |v_ULTIMATE.start_main_~#t1579~0.offset_16|) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1579~0.base_21| 1)) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t1580~0.base=|v_ULTIMATE.start_main_~#t1580~0.base_19|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t1580~0.offset=|v_ULTIMATE.start_main_~#t1580~0.offset_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t1579~0.base=|v_ULTIMATE.start_main_~#t1579~0.base_21|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_~#t1581~0.base=|v_ULTIMATE.start_main_~#t1581~0.base_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1581~0.offset=|v_ULTIMATE.start_main_~#t1581~0.offset_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1579~0.offset=|v_ULTIMATE.start_main_~#t1579~0.offset_16|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1580~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1580~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1579~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1581~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1581~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1579~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:51:36,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1580~0.offset_9|) (not (= |v_ULTIMATE.start_main_~#t1580~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1580~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1580~0.base_11|) |v_ULTIMATE.start_main_~#t1580~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1580~0.base_11| 1)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1580~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1580~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1580~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1580~0.offset=|v_ULTIMATE.start_main_~#t1580~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1580~0.base=|v_ULTIMATE.start_main_~#t1580~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1580~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1580~0.base] because there is no mapped edge [2019-12-27 21:51:36,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:51:36,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1536246817 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1536246817 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1536246817| ~z$w_buff1~0_In1536246817) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1536246817| ~z~0_In1536246817)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1536246817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1536246817, ~z$w_buff1~0=~z$w_buff1~0_In1536246817, ~z~0=~z~0_In1536246817} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1536246817|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1536246817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1536246817, ~z$w_buff1~0=~z$w_buff1~0_In1536246817, ~z~0=~z~0_In1536246817} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 21:51:36,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 21:51:36,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1581~0.base_13|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1581~0.base_13| 1) |v_#valid_36|) (not (= 0 |v_ULTIMATE.start_main_~#t1581~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1581~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1581~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1581~0.base_13|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1581~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1581~0.base_13|) |v_ULTIMATE.start_main_~#t1581~0.offset_11| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1581~0.base=|v_ULTIMATE.start_main_~#t1581~0.base_13|, ULTIMATE.start_main_~#t1581~0.offset=|v_ULTIMATE.start_main_~#t1581~0.offset_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1581~0.base, ULTIMATE.start_main_~#t1581~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 21:51:36,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1789969281 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1789969281 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1789969281| ~z$w_buff0_used~0_In1789969281)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1789969281|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1789969281, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1789969281} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1789969281, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1789969281|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1789969281} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:51:36,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1666946054 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1666946054 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1666946054 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1666946054 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1666946054| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out-1666946054| ~z$w_buff1_used~0_In-1666946054) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1666946054, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1666946054, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1666946054, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1666946054} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1666946054, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1666946054, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1666946054, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1666946054|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1666946054} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:51:36,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In293957588 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In293957588 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out293957588| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out293957588| ~z$r_buff0_thd2~0_In293957588)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In293957588, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In293957588} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In293957588, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out293957588|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In293957588} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 21:51:36,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1760052168 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-1760052168| ~z$w_buff0_used~0_In-1760052168) (= |P2Thread1of1ForFork0_#t~ite26_In-1760052168| |P2Thread1of1ForFork0_#t~ite26_Out-1760052168|)) (and (= ~z$w_buff0_used~0_In-1760052168 |P2Thread1of1ForFork0_#t~ite26_Out-1760052168|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1760052168 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1760052168 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1760052168 256))) (= (mod ~z$w_buff0_used~0_In-1760052168 256) 0))) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out-1760052168| |P2Thread1of1ForFork0_#t~ite26_Out-1760052168|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1760052168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1760052168, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1760052168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1760052168, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1760052168, ~weak$$choice2~0=~weak$$choice2~0_In-1760052168} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1760052168|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1760052168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1760052168, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1760052168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1760052168, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1760052168, ~weak$$choice2~0=~weak$$choice2~0_In-1760052168} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 21:51:36,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:51:36,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-686394888 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-686394888 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-686394888 |P0Thread1of1ForFork1_#t~ite5_Out-686394888|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-686394888|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-686394888, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-686394888} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-686394888|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686394888, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-686394888} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:51:36,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:51:36,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out637111280| |P2Thread1of1ForFork0_#t~ite38_Out637111280|)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In637111280 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In637111280 256)))) (or (and (= ~z~0_In637111280 |P2Thread1of1ForFork0_#t~ite38_Out637111280|) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In637111280 |P2Thread1of1ForFork0_#t~ite38_Out637111280|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In637111280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In637111280, ~z$w_buff1~0=~z$w_buff1~0_In637111280, ~z~0=~z~0_In637111280} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out637111280|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out637111280|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In637111280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In637111280, ~z$w_buff1~0=~z$w_buff1~0_In637111280, ~z~0=~z~0_In637111280} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:51:36,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1817268479 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1817268479 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1817268479 |P2Thread1of1ForFork0_#t~ite40_Out1817268479|)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out1817268479| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1817268479, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1817268479} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1817268479, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1817268479|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1817268479} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 21:51:36,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1859828811 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1859828811 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1859828811 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1859828811 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1859828811|)) (and (= ~z$w_buff1_used~0_In1859828811 |P2Thread1of1ForFork0_#t~ite41_Out1859828811|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1859828811, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1859828811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1859828811, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1859828811} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1859828811, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1859828811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1859828811, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1859828811, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1859828811|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 21:51:36,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1417856512 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1417856512 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In1417856512 |P2Thread1of1ForFork0_#t~ite42_Out1417856512|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1417856512|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1417856512, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1417856512} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1417856512, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1417856512, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1417856512|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 21:51:36,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1857153807 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1857153807 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1857153807 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1857153807 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1857153807 |P2Thread1of1ForFork0_#t~ite43_Out1857153807|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out1857153807| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1857153807, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1857153807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1857153807, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1857153807} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1857153807|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1857153807, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1857153807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1857153807, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1857153807} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 21:51:36,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 21:51:36,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2115041636 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-2115041636 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2115041636 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-2115041636 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-2115041636| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-2115041636| ~z$w_buff1_used~0_In-2115041636)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2115041636, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2115041636, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2115041636, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2115041636} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2115041636, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2115041636|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2115041636, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2115041636, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2115041636} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:51:36,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-384712580 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-384712580 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-384712580)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-384712580 ~z$r_buff0_thd1~0_Out-384712580)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-384712580, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-384712580} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-384712580, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-384712580|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-384712580} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:51:36,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1332768827 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1332768827 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1332768827 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1332768827 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1332768827| ~z$r_buff1_thd1~0_In-1332768827) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1332768827| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1332768827, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1332768827, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1332768827, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1332768827} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1332768827|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1332768827, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1332768827, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1332768827, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1332768827} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:51:36,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:51:36,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1601898278 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-1601898278 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1601898278 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1601898278 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1601898278|)) (and (= ~z$r_buff1_thd2~0_In-1601898278 |P1Thread1of1ForFork2_#t~ite14_Out-1601898278|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1601898278, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1601898278, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1601898278, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1601898278} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1601898278, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1601898278, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1601898278, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1601898278|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1601898278} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:51:36,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 21:51:36,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:51:36,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In867910218 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In867910218 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out867910218| |ULTIMATE.start_main_#t~ite47_Out867910218|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out867910218| ~z~0_In867910218) .cse2) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out867910218| ~z$w_buff1~0_In867910218) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In867910218, ~z$w_buff1_used~0=~z$w_buff1_used~0_In867910218, ~z$w_buff1~0=~z$w_buff1~0_In867910218, ~z~0=~z~0_In867910218} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In867910218, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out867910218|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In867910218, ~z$w_buff1~0=~z$w_buff1~0_In867910218, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out867910218|, ~z~0=~z~0_In867910218} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:51:36,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1844319171 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1844319171 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1844319171| 0)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1844319171 |ULTIMATE.start_main_#t~ite49_Out-1844319171|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1844319171, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1844319171} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1844319171, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1844319171, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1844319171|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:51:36,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-912230438 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-912230438 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-912230438 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-912230438 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-912230438| 0)) (and (= ~z$w_buff1_used~0_In-912230438 |ULTIMATE.start_main_#t~ite50_Out-912230438|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-912230438, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-912230438, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-912230438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-912230438} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-912230438|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-912230438, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-912230438, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-912230438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-912230438} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:51:36,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-477878927 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-477878927 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-477878927| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-477878927 |ULTIMATE.start_main_#t~ite51_Out-477878927|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-477878927, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-477878927} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-477878927, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-477878927|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-477878927} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:51:36,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1391474770 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1391474770 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1391474770 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1391474770 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1391474770| ~z$r_buff1_thd0~0_In-1391474770)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out-1391474770| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1391474770, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1391474770, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1391474770, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1391474770} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1391474770|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1391474770, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1391474770, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1391474770, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1391474770} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:51:36,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:51:36,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:51:36 BasicIcfg [2019-12-27 21:51:36,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:51:36,464 INFO L168 Benchmark]: Toolchain (without parser) took 175258.10 ms. Allocated memory was 144.2 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.6 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 21:51:36,464 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:51:36,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.71 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 155.6 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:51:36,471 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.11 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:51:36,471 INFO L168 Benchmark]: Boogie Preprocessor took 40.79 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:51:36,471 INFO L168 Benchmark]: RCFGBuilder took 847.39 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 100.3 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:51:36,472 INFO L168 Benchmark]: TraceAbstraction took 173485.70 ms. Allocated memory was 202.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 21:51:36,474 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.71 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 155.6 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.11 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.79 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.39 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 100.3 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 173485.70 ms. Allocated memory was 202.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1579, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1580, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1581, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 173.1s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 83.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8024 SDtfs, 14714 SDslu, 43132 SDs, 0 SdLazy, 43850 SolverSat, 1246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 140 SyntacticMatches, 81 SemanticMatches, 603 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9456 ImplicationChecksByTransitivity, 21.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 503300 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1559 NumberOfCodeBlocks, 1559 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1462 ConstructedInterpolants, 0 QuantifiedInterpolants, 346456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...