/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:35:10,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:35:10,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:35:10,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:35:10,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:35:10,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:35:10,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:35:10,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:35:11,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:35:11,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:35:11,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:35:11,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:35:11,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:35:11,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:35:11,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:35:11,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:35:11,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:35:11,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:35:11,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:35:11,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:35:11,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:35:11,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:35:11,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:35:11,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:35:11,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:35:11,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:35:11,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:35:11,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:35:11,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:35:11,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:35:11,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:35:11,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:35:11,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:35:11,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:35:11,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:35:11,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:35:11,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:35:11,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:35:11,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:35:11,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:35:11,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:35:11,041 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-SemanticLbe.epf [2019-12-27 03:35:11,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:35:11,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:35:11,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:35:11,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:35:11,057 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:35:11,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:35:11,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:35:11,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:35:11,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:35:11,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:35:11,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:35:11,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:35:11,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:35:11,058 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:35:11,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:35:11,059 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:35:11,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:35:11,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:35:11,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:35:11,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:35:11,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:35:11,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:35:11,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:35:11,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:35:11,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:35:11,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:35:11,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:35:11,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:35:11,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:35:11,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:35:11,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:35:11,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:35:11,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:35:11,357 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:35:11,357 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2019-12-27 03:35:11,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89384eadf/13d91f46c55e40b2a7d0181cacdb406a/FLAG9a2cf75bf [2019-12-27 03:35:12,002 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:35:12,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2019-12-27 03:35:12,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89384eadf/13d91f46c55e40b2a7d0181cacdb406a/FLAG9a2cf75bf [2019-12-27 03:35:12,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89384eadf/13d91f46c55e40b2a7d0181cacdb406a [2019-12-27 03:35:12,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:35:12,194 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:35:12,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:35:12,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:35:12,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:35:12,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:12,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305166a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12, skipping insertion in model container [2019-12-27 03:35:12,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:12,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:35:12,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:35:12,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:35:12,767 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:35:12,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:35:12,950 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:35:12,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12 WrapperNode [2019-12-27 03:35:12,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:35:12,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:35:12,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:35:12,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:35:12,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:12,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:13,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:35:13,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:35:13,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:35:13,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:35:13,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:13,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:13,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:13,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:13,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:13,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:13,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (1/1) ... [2019-12-27 03:35:13,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:35:13,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:35:13,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:35:13,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:35:13,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (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 03:35:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:35:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:35:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:35:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:35:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:35:13,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:35:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:35:13,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:35:13,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:35:13,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:35:13,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:35:13,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:35:13,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:35:13,122 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 03:35:13,903 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:35:13,903 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:35:13,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:35:13 BoogieIcfgContainer [2019-12-27 03:35:13,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:35:13,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:35:13,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:35:13,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:35:13,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:35:12" (1/3) ... [2019-12-27 03:35:13,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438b8dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:35:13, skipping insertion in model container [2019-12-27 03:35:13,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:35:12" (2/3) ... [2019-12-27 03:35:13,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438b8dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:35:13, skipping insertion in model container [2019-12-27 03:35:13,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:35:13" (3/3) ... [2019-12-27 03:35:13,918 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_rmo.oepc.i [2019-12-27 03:35:13,929 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:35:13,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:35:13,941 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:35:13,942 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:35:13,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:13,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,041 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,041 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,055 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,062 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,074 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,075 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:35:14,091 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:35:14,108 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:35:14,109 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:35:14,109 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:35:14,109 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:35:14,109 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:35:14,109 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:35:14,109 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:35:14,109 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:35:14,123 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 03:35:14,125 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 03:35:14,230 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 03:35:14,230 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:35:14,247 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:35:14,270 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 03:35:14,324 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 03:35:14,324 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:35:14,332 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:35:14,352 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 03:35:14,353 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:35:19,030 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 03:35:19,148 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 03:35:19,178 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-27 03:35:19,179 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 03:35:19,182 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-27 03:35:37,410 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-27 03:35:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-27 03:35:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:35:37,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:35:37,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:35:37,419 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 03:35:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:35:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-27 03:35:37,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:35:37,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698582680] [2019-12-27 03:35:37,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:35:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:35:37,673 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 03:35:37,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698582680] [2019-12-27 03:35:37,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:35:37,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:35:37,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346235967] [2019-12-27 03:35:37,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:35:37,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:35:37,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:35:37,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:35:37,705 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-27 03:35:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:35:39,402 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-27 03:35:39,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:35:39,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:35:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:35:40,179 INFO L225 Difference]: With dead ends: 115182 [2019-12-27 03:35:40,179 INFO L226 Difference]: Without dead ends: 112830 [2019-12-27 03:35:40,181 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 03:35:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-27 03:35:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-27 03:35:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-27 03:35:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-27 03:35:50,805 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-27 03:35:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:35:50,806 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-27 03:35:50,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:35:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-27 03:35:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:35:50,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:35:50,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:35:50,812 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 03:35:50,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:35:50,813 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-27 03:35:50,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:35:50,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695855478] [2019-12-27 03:35:50,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:35:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:35:50,949 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 03:35:50,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695855478] [2019-12-27 03:35:50,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:35:50,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:35:50,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099478036] [2019-12-27 03:35:50,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:35:50,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:35:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:35:50,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:35:50,953 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-27 03:35:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:35:56,352 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-27 03:35:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:35:56,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:35:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:35:56,853 INFO L225 Difference]: With dead ends: 176302 [2019-12-27 03:35:56,853 INFO L226 Difference]: Without dead ends: 176253 [2019-12-27 03:35:56,854 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 03:36:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-27 03:36:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-27 03:36:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-27 03:36:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-27 03:36:09,124 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-27 03:36:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:09,124 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-27 03:36:09,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:36:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-27 03:36:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:36:09,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:09,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:09,132 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 03:36:09,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:09,133 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-27 03:36:09,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:09,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861108242] [2019-12-27 03:36:09,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:09,213 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 03:36:09,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861108242] [2019-12-27 03:36:09,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:09,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:36:09,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455795020] [2019-12-27 03:36:09,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:36:09,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:36:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:36:09,217 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-27 03:36:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:16,722 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-27 03:36:16,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:36:16,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:36:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:17,409 INFO L225 Difference]: With dead ends: 228428 [2019-12-27 03:36:17,410 INFO L226 Difference]: Without dead ends: 228365 [2019-12-27 03:36:17,410 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 03:36:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-27 03:36:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-27 03:36:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-27 03:36:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-27 03:36:28,137 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-27 03:36:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:28,139 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-27 03:36:28,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:36:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-27 03:36:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:36:28,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:28,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:28,143 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 03:36:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-27 03:36:28,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:28,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883790397] [2019-12-27 03:36:28,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:28,223 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 03:36:28,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883790397] [2019-12-27 03:36:28,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:28,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:36:28,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138129467] [2019-12-27 03:36:28,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:36:28,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:28,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:36:28,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:36:28,226 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 3 states. [2019-12-27 03:36:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:28,363 INFO L93 Difference]: Finished difference Result 38255 states and 124332 transitions. [2019-12-27 03:36:28,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:36:28,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:36:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:28,422 INFO L225 Difference]: With dead ends: 38255 [2019-12-27 03:36:28,422 INFO L226 Difference]: Without dead ends: 38255 [2019-12-27 03:36:28,423 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 03:36:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38255 states. [2019-12-27 03:36:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38255 to 38255. [2019-12-27 03:36:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38255 states. [2019-12-27 03:36:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 124332 transitions. [2019-12-27 03:36:34,971 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 124332 transitions. Word has length 13 [2019-12-27 03:36:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:34,972 INFO L462 AbstractCegarLoop]: Abstraction has 38255 states and 124332 transitions. [2019-12-27 03:36:34,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:36:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 124332 transitions. [2019-12-27 03:36:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:36:34,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:34,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:34,977 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 03:36:34,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:34,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-27 03:36:34,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:34,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131179086] [2019-12-27 03:36:34,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:35,096 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 03:36:35,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131179086] [2019-12-27 03:36:35,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:35,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:36:35,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058053889] [2019-12-27 03:36:35,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:36:35,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:36:35,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:36:35,098 INFO L87 Difference]: Start difference. First operand 38255 states and 124332 transitions. Second operand 5 states. [2019-12-27 03:36:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:35,881 INFO L93 Difference]: Finished difference Result 51712 states and 164813 transitions. [2019-12-27 03:36:35,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:36:35,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 03:36:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:35,963 INFO L225 Difference]: With dead ends: 51712 [2019-12-27 03:36:35,963 INFO L226 Difference]: Without dead ends: 51699 [2019-12-27 03:36:35,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:36:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51699 states. [2019-12-27 03:36:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51699 to 38713. [2019-12-27 03:36:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38713 states. [2019-12-27 03:36:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38713 states to 38713 states and 125630 transitions. [2019-12-27 03:36:36,682 INFO L78 Accepts]: Start accepts. Automaton has 38713 states and 125630 transitions. Word has length 19 [2019-12-27 03:36:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:36,682 INFO L462 AbstractCegarLoop]: Abstraction has 38713 states and 125630 transitions. [2019-12-27 03:36:36,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:36:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 38713 states and 125630 transitions. [2019-12-27 03:36:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:36:36,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:36,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:36,697 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 03:36:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1240477865, now seen corresponding path program 1 times [2019-12-27 03:36:36,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:36,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487656845] [2019-12-27 03:36:36,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:36,774 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 03:36:36,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487656845] [2019-12-27 03:36:36,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:36,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:36:36,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760969510] [2019-12-27 03:36:36,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:36:36,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:36:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:36:36,777 INFO L87 Difference]: Start difference. First operand 38713 states and 125630 transitions. Second operand 4 states. [2019-12-27 03:36:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:36,822 INFO L93 Difference]: Finished difference Result 7422 states and 20312 transitions. [2019-12-27 03:36:36,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:36:36,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:36:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:36,836 INFO L225 Difference]: With dead ends: 7422 [2019-12-27 03:36:36,837 INFO L226 Difference]: Without dead ends: 7422 [2019-12-27 03:36:36,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:36:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2019-12-27 03:36:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 7310. [2019-12-27 03:36:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2019-12-27 03:36:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 19992 transitions. [2019-12-27 03:36:37,215 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 19992 transitions. Word has length 25 [2019-12-27 03:36:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:37,215 INFO L462 AbstractCegarLoop]: Abstraction has 7310 states and 19992 transitions. [2019-12-27 03:36:37,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:36:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 19992 transitions. [2019-12-27 03:36:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 03:36:37,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:37,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:37,227 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 03:36:37,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:37,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1041968244, now seen corresponding path program 1 times [2019-12-27 03:36:37,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:37,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112526866] [2019-12-27 03:36:37,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:37,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 03:36:37,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112526866] [2019-12-27 03:36:37,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:37,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:36:37,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384715985] [2019-12-27 03:36:37,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:36:37,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:36:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:36:37,302 INFO L87 Difference]: Start difference. First operand 7310 states and 19992 transitions. Second operand 5 states. [2019-12-27 03:36:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:37,348 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 03:36:37,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:36:37,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 03:36:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:37,357 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 03:36:37,357 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 03:36:37,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:36:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 03:36:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 03:36:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 03:36:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 03:36:37,439 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 03:36:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:37,439 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 03:36:37,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:36:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 03:36:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:36:37,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:37,450 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 03:36:37,450 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 03:36:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:37,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-27 03:36:37,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:37,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641189912] [2019-12-27 03:36:37,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:37,589 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 03:36:37,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641189912] [2019-12-27 03:36:37,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:37,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:36:37,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600744444] [2019-12-27 03:36:37,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:36:37,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:37,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:36:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:36:37,592 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 5 states. [2019-12-27 03:36:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:37,926 INFO L93 Difference]: Finished difference Result 7539 states and 21548 transitions. [2019-12-27 03:36:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:36:37,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 03:36:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:37,939 INFO L225 Difference]: With dead ends: 7539 [2019-12-27 03:36:37,940 INFO L226 Difference]: Without dead ends: 7539 [2019-12-27 03:36:37,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:36:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-27 03:36:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 6345. [2019-12-27 03:36:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-27 03:36:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 18318 transitions. [2019-12-27 03:36:38,077 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 18318 transitions. Word has length 65 [2019-12-27 03:36:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:38,078 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 18318 transitions. [2019-12-27 03:36:38,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:36:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 18318 transitions. [2019-12-27 03:36:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:36:38,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:38,087 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 03:36:38,087 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 03:36:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-27 03:36:38,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:38,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672148088] [2019-12-27 03:36:38,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:38,199 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 03:36:38,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672148088] [2019-12-27 03:36:38,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:38,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:36:38,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131823268] [2019-12-27 03:36:38,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:36:38,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:38,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:36:38,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:36:38,207 INFO L87 Difference]: Start difference. First operand 6345 states and 18318 transitions. Second operand 3 states. [2019-12-27 03:36:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:38,238 INFO L93 Difference]: Finished difference Result 5975 states and 16977 transitions. [2019-12-27 03:36:38,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:36:38,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:36:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:38,248 INFO L225 Difference]: With dead ends: 5975 [2019-12-27 03:36:38,248 INFO L226 Difference]: Without dead ends: 5975 [2019-12-27 03:36:38,248 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 03:36:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2019-12-27 03:36:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5819. [2019-12-27 03:36:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5819 states. [2019-12-27 03:36:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5819 states to 5819 states and 16547 transitions. [2019-12-27 03:36:38,323 INFO L78 Accepts]: Start accepts. Automaton has 5819 states and 16547 transitions. Word has length 65 [2019-12-27 03:36:38,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:38,323 INFO L462 AbstractCegarLoop]: Abstraction has 5819 states and 16547 transitions. [2019-12-27 03:36:38,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:36:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 5819 states and 16547 transitions. [2019-12-27 03:36:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:36:38,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:38,331 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 03:36:38,331 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 03:36:38,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:38,332 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-27 03:36:38,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:38,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864226877] [2019-12-27 03:36:38,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:38,428 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 03:36:38,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864226877] [2019-12-27 03:36:38,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:38,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:36:38,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151364936] [2019-12-27 03:36:38,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:36:38,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:38,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:36:38,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:36:38,432 INFO L87 Difference]: Start difference. First operand 5819 states and 16547 transitions. Second operand 5 states. [2019-12-27 03:36:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:38,788 INFO L93 Difference]: Finished difference Result 8394 states and 23622 transitions. [2019-12-27 03:36:38,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:36:38,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 03:36:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:38,799 INFO L225 Difference]: With dead ends: 8394 [2019-12-27 03:36:38,799 INFO L226 Difference]: Without dead ends: 8394 [2019-12-27 03:36:38,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:36:38,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2019-12-27 03:36:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 6167. [2019-12-27 03:36:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-12-27 03:36:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 17580 transitions. [2019-12-27 03:36:38,890 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 17580 transitions. Word has length 66 [2019-12-27 03:36:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:38,890 INFO L462 AbstractCegarLoop]: Abstraction has 6167 states and 17580 transitions. [2019-12-27 03:36:38,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:36:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 17580 transitions. [2019-12-27 03:36:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:36:38,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:38,899 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 03:36:38,899 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 03:36:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-27 03:36:38,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:38,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117075513] [2019-12-27 03:36:38,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:38,978 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 03:36:38,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117075513] [2019-12-27 03:36:38,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:38,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:36:38,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701358002] [2019-12-27 03:36:38,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:36:38,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:38,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:36:38,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:36:38,981 INFO L87 Difference]: Start difference. First operand 6167 states and 17580 transitions. Second operand 3 states. [2019-12-27 03:36:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:39,008 INFO L93 Difference]: Finished difference Result 5518 states and 15469 transitions. [2019-12-27 03:36:39,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:36:39,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:36:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:39,016 INFO L225 Difference]: With dead ends: 5518 [2019-12-27 03:36:39,016 INFO L226 Difference]: Without dead ends: 5518 [2019-12-27 03:36:39,017 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 03:36:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2019-12-27 03:36:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5170. [2019-12-27 03:36:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-27 03:36:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 14519 transitions. [2019-12-27 03:36:39,108 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 14519 transitions. Word has length 66 [2019-12-27 03:36:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:39,108 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 14519 transitions. [2019-12-27 03:36:39,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:36:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 14519 transitions. [2019-12-27 03:36:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:36:39,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:39,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:36:39,117 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 03:36:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash 991626200, now seen corresponding path program 1 times [2019-12-27 03:36:39,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:39,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214978319] [2019-12-27 03:36:39,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:39,437 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 03:36:39,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214978319] [2019-12-27 03:36:39,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:39,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:36:39,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968146219] [2019-12-27 03:36:39,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:36:39,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:39,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:36:39,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:36:39,440 INFO L87 Difference]: Start difference. First operand 5170 states and 14519 transitions. Second operand 13 states. [2019-12-27 03:36:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:40,108 INFO L93 Difference]: Finished difference Result 10542 states and 29542 transitions. [2019-12-27 03:36:40,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:36:40,108 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 03:36:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:40,117 INFO L225 Difference]: With dead ends: 10542 [2019-12-27 03:36:40,117 INFO L226 Difference]: Without dead ends: 5832 [2019-12-27 03:36:40,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:36:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5832 states. [2019-12-27 03:36:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5832 to 4872. [2019-12-27 03:36:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-12-27 03:36:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 13645 transitions. [2019-12-27 03:36:40,187 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 13645 transitions. Word has length 67 [2019-12-27 03:36:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:40,188 INFO L462 AbstractCegarLoop]: Abstraction has 4872 states and 13645 transitions. [2019-12-27 03:36:40,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:36:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 13645 transitions. [2019-12-27 03:36:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:36:40,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:40,195 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 03:36:40,195 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 03:36:40,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:40,195 INFO L82 PathProgramCache]: Analyzing trace with hash 499610268, now seen corresponding path program 2 times [2019-12-27 03:36:40,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:40,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377753153] [2019-12-27 03:36:40,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:40,326 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 03:36:40,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377753153] [2019-12-27 03:36:40,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:40,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:36:40,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966888271] [2019-12-27 03:36:40,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:36:40,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:40,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:36:40,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:36:40,328 INFO L87 Difference]: Start difference. First operand 4872 states and 13645 transitions. Second operand 7 states. [2019-12-27 03:36:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:41,347 INFO L93 Difference]: Finished difference Result 7161 states and 19868 transitions. [2019-12-27 03:36:41,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 03:36:41,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 03:36:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:41,356 INFO L225 Difference]: With dead ends: 7161 [2019-12-27 03:36:41,357 INFO L226 Difference]: Without dead ends: 7161 [2019-12-27 03:36:41,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:36:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2019-12-27 03:36:41,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 5279. [2019-12-27 03:36:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5279 states. [2019-12-27 03:36:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 14775 transitions. [2019-12-27 03:36:41,432 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 14775 transitions. Word has length 67 [2019-12-27 03:36:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:41,433 INFO L462 AbstractCegarLoop]: Abstraction has 5279 states and 14775 transitions. [2019-12-27 03:36:41,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:36:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 14775 transitions. [2019-12-27 03:36:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:36:41,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:41,440 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 03:36:41,440 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 03:36:41,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1057080962, now seen corresponding path program 3 times [2019-12-27 03:36:41,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:41,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538550155] [2019-12-27 03:36:41,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:36:41,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538550155] [2019-12-27 03:36:41,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:41,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:36:41,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899898288] [2019-12-27 03:36:41,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:36:41,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:41,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:36:41,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:36:41,512 INFO L87 Difference]: Start difference. First operand 5279 states and 14775 transitions. Second operand 3 states. [2019-12-27 03:36:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:41,564 INFO L93 Difference]: Finished difference Result 5278 states and 14773 transitions. [2019-12-27 03:36:41,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:36:41,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 03:36:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:41,571 INFO L225 Difference]: With dead ends: 5278 [2019-12-27 03:36:41,572 INFO L226 Difference]: Without dead ends: 5278 [2019-12-27 03:36:41,572 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 03:36:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2019-12-27 03:36:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 2810. [2019-12-27 03:36:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-27 03:36:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 7936 transitions. [2019-12-27 03:36:41,653 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 7936 transitions. Word has length 67 [2019-12-27 03:36:41,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:41,654 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 7936 transitions. [2019-12-27 03:36:41,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:36:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 7936 transitions. [2019-12-27 03:36:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:36:41,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:41,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:41,661 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 03:36:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1090372922, now seen corresponding path program 1 times [2019-12-27 03:36:41,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:41,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180094195] [2019-12-27 03:36:41,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:42,179 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 03:36:42,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180094195] [2019-12-27 03:36:42,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:42,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 03:36:42,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206395669] [2019-12-27 03:36:42,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 03:36:42,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:42,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 03:36:42,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:36:42,181 INFO L87 Difference]: Start difference. First operand 2810 states and 7936 transitions. Second operand 19 states. [2019-12-27 03:36:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:45,706 INFO L93 Difference]: Finished difference Result 10142 states and 28082 transitions. [2019-12-27 03:36:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 03:36:45,707 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 03:36:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:45,727 INFO L225 Difference]: With dead ends: 10142 [2019-12-27 03:36:45,727 INFO L226 Difference]: Without dead ends: 10117 [2019-12-27 03:36:45,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=476, Invalid=2830, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 03:36:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2019-12-27 03:36:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 4233. [2019-12-27 03:36:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4233 states. [2019-12-27 03:36:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4233 states to 4233 states and 11842 transitions. [2019-12-27 03:36:45,896 INFO L78 Accepts]: Start accepts. Automaton has 4233 states and 11842 transitions. Word has length 68 [2019-12-27 03:36:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:45,896 INFO L462 AbstractCegarLoop]: Abstraction has 4233 states and 11842 transitions. [2019-12-27 03:36:45,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 03:36:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4233 states and 11842 transitions. [2019-12-27 03:36:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:36:45,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:45,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:45,904 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 03:36:45,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 2 times [2019-12-27 03:36:45,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:45,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638412458] [2019-12-27 03:36:45,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:46,194 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 03:36:46,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638412458] [2019-12-27 03:36:46,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:46,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:36:46,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380352690] [2019-12-27 03:36:46,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:36:46,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:46,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:36:46,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:36:46,199 INFO L87 Difference]: Start difference. First operand 4233 states and 11842 transitions. Second operand 14 states. [2019-12-27 03:36:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:47,221 INFO L93 Difference]: Finished difference Result 6974 states and 19475 transitions. [2019-12-27 03:36:47,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:36:47,222 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 03:36:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:47,232 INFO L225 Difference]: With dead ends: 6974 [2019-12-27 03:36:47,232 INFO L226 Difference]: Without dead ends: 6949 [2019-12-27 03:36:47,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2019-12-27 03:36:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6949 states. [2019-12-27 03:36:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6949 to 4510. [2019-12-27 03:36:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4510 states. [2019-12-27 03:36:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 12639 transitions. [2019-12-27 03:36:47,304 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 12639 transitions. Word has length 68 [2019-12-27 03:36:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:47,304 INFO L462 AbstractCegarLoop]: Abstraction has 4510 states and 12639 transitions. [2019-12-27 03:36:47,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:36:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 12639 transitions. [2019-12-27 03:36:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:36:47,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:47,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:47,312 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 03:36:47,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 3 times [2019-12-27 03:36:47,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:47,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653839867] [2019-12-27 03:36:47,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:47,850 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 03:36:47,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653839867] [2019-12-27 03:36:47,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:47,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 03:36:47,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457746275] [2019-12-27 03:36:47,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 03:36:47,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 03:36:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:36:47,852 INFO L87 Difference]: Start difference. First operand 4510 states and 12639 transitions. Second operand 19 states. [2019-12-27 03:36:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:50,300 INFO L93 Difference]: Finished difference Result 10766 states and 30000 transitions. [2019-12-27 03:36:50,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 03:36:50,301 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 03:36:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:50,315 INFO L225 Difference]: With dead ends: 10766 [2019-12-27 03:36:50,315 INFO L226 Difference]: Without dead ends: 10741 [2019-12-27 03:36:50,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=347, Invalid=1815, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 03:36:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10741 states. [2019-12-27 03:36:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10741 to 4606. [2019-12-27 03:36:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4606 states. [2019-12-27 03:36:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 12911 transitions. [2019-12-27 03:36:50,405 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 12911 transitions. Word has length 68 [2019-12-27 03:36:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:50,406 INFO L462 AbstractCegarLoop]: Abstraction has 4606 states and 12911 transitions. [2019-12-27 03:36:50,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 03:36:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 12911 transitions. [2019-12-27 03:36:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:36:50,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:50,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:50,412 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 03:36:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash -450226916, now seen corresponding path program 4 times [2019-12-27 03:36:50,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:50,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996198815] [2019-12-27 03:36:50,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:50,904 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 03:36:50,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996198815] [2019-12-27 03:36:50,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:50,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 03:36:50,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718667860] [2019-12-27 03:36:50,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 03:36:50,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:50,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 03:36:50,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:36:50,907 INFO L87 Difference]: Start difference. First operand 4606 states and 12911 transitions. Second operand 19 states. [2019-12-27 03:36:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:53,967 INFO L93 Difference]: Finished difference Result 12537 states and 34790 transitions. [2019-12-27 03:36:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 03:36:53,967 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 03:36:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:53,986 INFO L225 Difference]: With dead ends: 12537 [2019-12-27 03:36:53,986 INFO L226 Difference]: Without dead ends: 12512 [2019-12-27 03:36:53,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=460, Invalid=2620, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 03:36:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12512 states. [2019-12-27 03:36:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12512 to 4806. [2019-12-27 03:36:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2019-12-27 03:36:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 13511 transitions. [2019-12-27 03:36:54,095 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 13511 transitions. Word has length 68 [2019-12-27 03:36:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:54,096 INFO L462 AbstractCegarLoop]: Abstraction has 4806 states and 13511 transitions. [2019-12-27 03:36:54,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 03:36:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 13511 transitions. [2019-12-27 03:36:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:36:54,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:54,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:54,101 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 03:36:54,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:54,101 INFO L82 PathProgramCache]: Analyzing trace with hash 932771090, now seen corresponding path program 5 times [2019-12-27 03:36:54,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:54,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491525221] [2019-12-27 03:36:54,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:54,629 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 03:36:54,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491525221] [2019-12-27 03:36:54,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:54,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 03:36:54,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170079078] [2019-12-27 03:36:54,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 03:36:54,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:54,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 03:36:54,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-12-27 03:36:54,631 INFO L87 Difference]: Start difference. First operand 4806 states and 13511 transitions. Second operand 20 states. [2019-12-27 03:36:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:58,087 INFO L93 Difference]: Finished difference Result 12141 states and 33758 transitions. [2019-12-27 03:36:58,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 03:36:58,087 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 03:36:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:58,101 INFO L225 Difference]: With dead ends: 12141 [2019-12-27 03:36:58,101 INFO L226 Difference]: Without dead ends: 12116 [2019-12-27 03:36:58,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=499, Invalid=2923, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 03:36:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12116 states. [2019-12-27 03:36:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12116 to 4724. [2019-12-27 03:36:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-12-27 03:36:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 13264 transitions. [2019-12-27 03:36:58,195 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 13264 transitions. Word has length 68 [2019-12-27 03:36:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:58,196 INFO L462 AbstractCegarLoop]: Abstraction has 4724 states and 13264 transitions. [2019-12-27 03:36:58,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 03:36:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 13264 transitions. [2019-12-27 03:36:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:36:58,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:58,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:58,201 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 03:36:58,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:58,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1425961288, now seen corresponding path program 6 times [2019-12-27 03:36:58,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:58,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784412473] [2019-12-27 03:36:58,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:36:58,496 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 03:36:58,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784412473] [2019-12-27 03:36:58,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:36:58,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:36:58,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354694813] [2019-12-27 03:36:58,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:36:58,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:36:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:36:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:36:58,498 INFO L87 Difference]: Start difference. First operand 4724 states and 13264 transitions. Second operand 16 states. [2019-12-27 03:36:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:36:59,527 INFO L93 Difference]: Finished difference Result 7189 states and 19981 transitions. [2019-12-27 03:36:59,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 03:36:59,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-27 03:36:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:36:59,538 INFO L225 Difference]: With dead ends: 7189 [2019-12-27 03:36:59,538 INFO L226 Difference]: Without dead ends: 7164 [2019-12-27 03:36:59,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 03:36:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7164 states. [2019-12-27 03:36:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7164 to 4062. [2019-12-27 03:36:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-12-27 03:36:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 11322 transitions. [2019-12-27 03:36:59,605 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 11322 transitions. Word has length 68 [2019-12-27 03:36:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:36:59,605 INFO L462 AbstractCegarLoop]: Abstraction has 4062 states and 11322 transitions. [2019-12-27 03:36:59,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:36:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 11322 transitions. [2019-12-27 03:36:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:36:59,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:36:59,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:36:59,609 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 03:36:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:36:59,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 7 times [2019-12-27 03:36:59,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:36:59,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422715566] [2019-12-27 03:36:59,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:36:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:36:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:36:59,723 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:36:59,723 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:36:59,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1973~0.base_23|)) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= v_~z$w_buff1_used~0_381 0) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1973~0.base_23|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1973~0.base_23| 1)) (= v_~z$read_delayed~0_7 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1973~0.base_23| 4)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1973~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1973~0.base_23|) |v_ULTIMATE.start_main_~#t1973~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~z$flush_delayed~0_41) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= 0 |v_ULTIMATE.start_main_~#t1973~0.offset_17|) (= v_~weak$$choice2~0_111 0) (= v_~z$r_buff0_thd2~0_100 0) (= v_~z$r_buff1_thd2~0_185 0) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ULTIMATE.start_main_~#t1974~0.offset=|v_ULTIMATE.start_main_~#t1974~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_~#t1975~0.offset=|v_ULTIMATE.start_main_~#t1975~0.offset_16|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ULTIMATE.start_main_~#t1975~0.base=|v_ULTIMATE.start_main_~#t1975~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ULTIMATE.start_main_~#t1973~0.offset=|v_ULTIMATE.start_main_~#t1973~0.offset_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_~#t1974~0.base=|v_ULTIMATE.start_main_~#t1974~0.base_21|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_~#t1973~0.base=|v_ULTIMATE.start_main_~#t1973~0.base_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1974~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1975~0.offset, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1975~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1973~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1974~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1973~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:36:59,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1974~0.base_11| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1974~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1974~0.base_11|) |v_ULTIMATE.start_main_~#t1974~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1974~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1974~0.base_11|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1974~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1974~0.base_11| 0)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1974~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1974~0.offset=|v_ULTIMATE.start_main_~#t1974~0.offset_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1974~0.base=|v_ULTIMATE.start_main_~#t1974~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1974~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1974~0.base] because there is no mapped edge [2019-12-27 03:36:59,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 0 (mod v_~z$w_buff1_used~0_97 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_~z$w_buff0_used~0_206 1) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 03:36:59,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1975~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1975~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1975~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1975~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1975~0.base_12|) |v_ULTIMATE.start_main_~#t1975~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1975~0.base_12| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1975~0.base_12| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1975~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1975~0.base=|v_ULTIMATE.start_main_~#t1975~0.base_12|, ULTIMATE.start_main_~#t1975~0.offset=|v_ULTIMATE.start_main_~#t1975~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1975~0.base, ULTIMATE.start_main_~#t1975~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 03:36:59,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-534385819 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-534385819 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-534385819| ~z$w_buff0_used~0_In-534385819)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-534385819|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-534385819, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-534385819} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-534385819|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-534385819, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-534385819} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:36:59,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-514639736 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-514639736 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-514639736 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-514639736 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-514639736| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-514639736 |P0Thread1of1ForFork0_#t~ite6_Out-514639736|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-514639736, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-514639736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-514639736, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-514639736} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-514639736|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-514639736, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-514639736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-514639736, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-514639736} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:36:59,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1017858784 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1017858784 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In1017858784 ~z$r_buff0_thd1~0_Out1017858784) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd1~0_Out1017858784) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1017858784, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1017858784} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1017858784, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1017858784|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1017858784} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:36:59,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1404521509 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1404521509 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1404521509 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1404521509 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1404521509| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1404521509| ~z$r_buff1_thd1~0_In-1404521509) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1404521509, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1404521509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1404521509, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1404521509} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1404521509, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1404521509|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1404521509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1404521509, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1404521509} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:36:59,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:36:59,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In515520553 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In515520553 256)))) (or (and (= ~z~0_In515520553 |P1Thread1of1ForFork1_#t~ite9_Out515520553|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In515520553 |P1Thread1of1ForFork1_#t~ite9_Out515520553|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In515520553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In515520553, ~z$w_buff1~0=~z$w_buff1~0_In515520553, ~z~0=~z~0_In515520553} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out515520553|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In515520553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In515520553, ~z$w_buff1~0=~z$w_buff1~0_In515520553, ~z~0=~z~0_In515520553} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 03:36:59,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_16|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_16|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_15|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_21|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 03:36:59,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1140648833 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1140648833 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1140648833| ~z$w_buff0_used~0_In1140648833) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1140648833|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1140648833, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1140648833} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1140648833, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1140648833|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1140648833} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:36:59,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In121326199 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In121326199 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out121326199| ~z~0_In121326199) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out121326199| ~z$w_buff1~0_In121326199)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In121326199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In121326199, ~z$w_buff1~0=~z$w_buff1~0_In121326199, ~z~0=~z~0_In121326199} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out121326199|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In121326199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In121326199, ~z$w_buff1~0=~z$w_buff1~0_In121326199, ~z~0=~z~0_In121326199} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 03:36:59,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In329990519 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In329990519 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In329990519 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In329990519 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out329990519|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In329990519 |P1Thread1of1ForFork1_#t~ite12_Out329990519|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In329990519, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In329990519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In329990519, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In329990519} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In329990519, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In329990519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In329990519, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out329990519|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In329990519} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:36:59,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-219402679 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-219402679 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-219402679|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-219402679 |P1Thread1of1ForFork1_#t~ite13_Out-219402679|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-219402679, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-219402679} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-219402679, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-219402679|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-219402679} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 03:36:59,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= v_~z~0_45 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 03:36:59,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-824525818 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-824525818 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-824525818| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-824525818| ~z$w_buff0_used~0_In-824525818)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-824525818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-824525818} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-824525818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-824525818, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-824525818|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:36:59,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In94595416 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In94595416 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In94595416 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In94595416 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out94595416|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In94595416 |P2Thread1of1ForFork2_#t~ite18_Out94595416|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In94595416, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In94595416, ~z$w_buff1_used~0=~z$w_buff1_used~0_In94595416, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In94595416} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In94595416, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In94595416, ~z$w_buff1_used~0=~z$w_buff1_used~0_In94595416, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In94595416, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out94595416|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 03:36:59,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1469714142 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1469714142 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out1469714142| ~z$r_buff0_thd3~0_In1469714142)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out1469714142| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1469714142, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1469714142} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1469714142, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1469714142, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1469714142|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 03:36:59,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In-1801268712 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1801268712 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1801268712 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1801268712 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out-1801268712| ~z$r_buff1_thd3~0_In-1801268712)) (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-1801268712|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1801268712, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1801268712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1801268712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1801268712} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1801268712, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1801268712|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1801268712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1801268712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1801268712} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 03:36:59,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~z$r_buff1_thd3~0_66) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 03:36:59,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-884908566 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-884908566 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-884908566 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-884908566 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-884908566 |P1Thread1of1ForFork1_#t~ite14_Out-884908566|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-884908566|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-884908566, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-884908566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884908566, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-884908566} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-884908566, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-884908566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884908566, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-884908566|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-884908566} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:36:59,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_54) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:36:59,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:36:59,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In450180946 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In450180946 256)))) (or (and (= ~z~0_In450180946 |ULTIMATE.start_main_#t~ite24_Out450180946|) (or .cse0 .cse1)) (and (not .cse0) (= ~z$w_buff1~0_In450180946 |ULTIMATE.start_main_#t~ite24_Out450180946|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In450180946, ~z$w_buff1_used~0=~z$w_buff1_used~0_In450180946, ~z$w_buff1~0=~z$w_buff1~0_In450180946, ~z~0=~z~0_In450180946} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In450180946, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out450180946|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In450180946, ~z$w_buff1~0=~z$w_buff1~0_In450180946, ~z~0=~z~0_In450180946} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 03:36:59,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-27 03:36:59,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1018705201 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1018705201 256)))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out-1018705201| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1018705201 |ULTIMATE.start_main_#t~ite26_Out-1018705201|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1018705201, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1018705201} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1018705201, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1018705201, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1018705201|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 03:36:59,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1793069984 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1793069984 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1793069984 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1793069984 256)))) (or (and (= ~z$w_buff1_used~0_In1793069984 |ULTIMATE.start_main_#t~ite27_Out1793069984|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite27_Out1793069984| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1793069984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1793069984, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1793069984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1793069984} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1793069984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1793069984, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1793069984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1793069984, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1793069984|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 03:36:59,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In527329357 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In527329357 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out527329357| 0)) (and (= |ULTIMATE.start_main_#t~ite28_Out527329357| ~z$r_buff0_thd0~0_In527329357) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In527329357, ~z$w_buff0_used~0=~z$w_buff0_used~0_In527329357} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In527329357, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out527329357|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In527329357} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 03:36:59,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1068671548 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1068671548 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1068671548 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1068671548 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out1068671548|)) (and (= ~z$r_buff1_thd0~0_In1068671548 |ULTIMATE.start_main_#t~ite29_Out1068671548|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1068671548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1068671548, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1068671548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1068671548} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1068671548, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1068671548|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1068671548, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1068671548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1068671548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 03:36:59,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 03:36:59,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:36:59,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:36:59,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:36:59 BasicIcfg [2019-12-27 03:36:59,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:36:59,877 INFO L168 Benchmark]: Toolchain (without parser) took 107683.02 ms. Allocated memory was 145.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 102.1 MB in the beginning and 1.1 GB in the end (delta: -995.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 03:36:59,878 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 03:36:59,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.70 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 157.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:36:59,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.36 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:36:59,880 INFO L168 Benchmark]: Boogie Preprocessor took 38.26 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:36:59,881 INFO L168 Benchmark]: RCFGBuilder took 847.96 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 101.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:36:59,882 INFO L168 Benchmark]: TraceAbstraction took 105969.38 ms. Allocated memory was 203.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.1 MB in the beginning and 1.1 GB in the end (delta: -996.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 03:36:59,895 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.70 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 157.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.36 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.26 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.96 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 101.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105969.38 ms. Allocated memory was 203.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.1 MB in the beginning and 1.1 GB in the end (delta: -996.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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_p1_EAX=0, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L811] FCALL, FORK 0 pthread_create(&t1975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __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=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __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=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 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=1, __unbuffered_p1_EAX=1, __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=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 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 [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 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 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 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 [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 34.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3249 SDtfs, 5023 SDslu, 13925 SDs, 0 SdLazy, 14015 SolverSat, 449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 31 SyntacticMatches, 24 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3524 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192396occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 108141 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1060 NumberOfCodeBlocks, 1060 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 972 ConstructedInterpolants, 0 QuantifiedInterpolants, 372505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...