/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:31:22,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:31:22,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:31:22,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:31:22,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:31:22,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:31:22,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:31:22,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:31:22,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:31:22,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:31:22,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:31:22,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:31:22,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:31:22,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:31:22,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:31:22,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:31:22,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:31:22,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:31:22,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:31:22,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:31:22,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:31:22,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:31:22,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:31:22,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:31:22,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:31:22,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:31:22,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:31:22,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:31:22,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:31:22,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:31:22,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:31:22,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:31:22,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:31:22,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:31:22,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:31:22,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:31:22,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:31:22,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:31:22,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:31:22,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:31:22,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:31:22,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:31:22,106 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:31:22,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:31:22,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:31:22,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:31:22,108 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:31:22,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:31:22,109 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:31:22,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:31:22,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:31:22,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:31:22,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:31:22,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:31:22,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:31:22,111 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:31:22,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:31:22,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:31:22,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:31:22,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:31:22,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:31:22,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:31:22,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:31:22,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:31:22,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:31:22,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:31:22,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:31:22,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:31:22,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:31:22,114 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:31:22,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:31:22,115 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:31:22,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:31:22,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:31:22,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:31:22,420 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:31:22,420 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:31:22,421 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2019-12-18 22:31:22,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed01c921a/2e5cb91fc1794a5685a2aa5b5f0f5364/FLAG55b6d3a4b [2019-12-18 22:31:23,032 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:31:23,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2019-12-18 22:31:23,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed01c921a/2e5cb91fc1794a5685a2aa5b5f0f5364/FLAG55b6d3a4b [2019-12-18 22:31:23,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed01c921a/2e5cb91fc1794a5685a2aa5b5f0f5364 [2019-12-18 22:31:23,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:31:23,317 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:31:23,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:31:23,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:31:23,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:31:23,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:31:23" (1/1) ... [2019-12-18 22:31:23,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:23, skipping insertion in model container [2019-12-18 22:31:23,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:31:23" (1/1) ... [2019-12-18 22:31:23,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:31:23,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:31:23,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:31:23,879 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:31:23,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:31:24,036 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:31:24,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24 WrapperNode [2019-12-18 22:31:24,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:31:24,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:31:24,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:31:24,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:31:24,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,068 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:31:24,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:31:24,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:31:24,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:31:24,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:31:24,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:31:24,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:31:24,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:31:24,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:31:24,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:31:24,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:31:24,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:31:24,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:31:24,218 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:31:24,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:31:24,219 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:31:24,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:31:24,219 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:31:24,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:31:24,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:31:24,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:31:24,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:31:24,222 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:31:25,015 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:31:25,015 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:31:25,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:31:25 BoogieIcfgContainer [2019-12-18 22:31:25,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:31:25,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:31:25,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:31:25,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:31:25,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:31:23" (1/3) ... [2019-12-18 22:31:25,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565a7731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:31:25, skipping insertion in model container [2019-12-18 22:31:25,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24" (2/3) ... [2019-12-18 22:31:25,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565a7731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:31:25, skipping insertion in model container [2019-12-18 22:31:25,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:31:25" (3/3) ... [2019-12-18 22:31:25,025 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2019-12-18 22:31:25,036 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:31:25,036 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:31:25,044 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:31:25,045 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:31:25,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,083 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,107 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,107 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,107 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,114 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,114 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,128 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,129 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,129 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,133 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,134 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:25,149 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:31:25,170 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:31:25,170 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:31:25,170 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:31:25,170 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:31:25,170 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:31:25,171 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:31:25,171 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:31:25,171 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:31:25,188 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 22:31:25,190 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:31:25,288 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:31:25,288 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:31:25,312 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:31:25,337 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:31:25,401 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:31:25,402 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:31:25,411 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:31:25,430 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 22:31:25,431 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:31:28,391 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-12-18 22:31:28,495 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-12-18 22:31:28,617 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:31:28,754 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:31:28,792 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91848 [2019-12-18 22:31:28,793 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 22:31:28,796 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-18 22:31:47,666 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117808 states. [2019-12-18 22:31:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 117808 states. [2019-12-18 22:31:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:31:47,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:31:47,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:31:47,675 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:31:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:31:47,680 INFO L82 PathProgramCache]: Analyzing trace with hash 806010685, now seen corresponding path program 1 times [2019-12-18 22:31:47,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:31:47,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748395938] [2019-12-18 22:31:47,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:31:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:31:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:31:48,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748395938] [2019-12-18 22:31:48,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:31:48,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:31:48,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143050861] [2019-12-18 22:31:48,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:31:48,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:31:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:31:48,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:31:48,029 INFO L87 Difference]: Start difference. First operand 117808 states. Second operand 3 states. [2019-12-18 22:31:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:31:49,402 INFO L93 Difference]: Finished difference Result 117244 states and 506404 transitions. [2019-12-18 22:31:49,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:31:49,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:31:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:31:53,316 INFO L225 Difference]: With dead ends: 117244 [2019-12-18 22:31:53,317 INFO L226 Difference]: Without dead ends: 114878 [2019-12-18 22:31:53,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:31:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114878 states. [2019-12-18 22:31:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114878 to 114878. [2019-12-18 22:31:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114878 states. [2019-12-18 22:32:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114878 states to 114878 states and 496758 transitions. [2019-12-18 22:32:04,700 INFO L78 Accepts]: Start accepts. Automaton has 114878 states and 496758 transitions. Word has length 5 [2019-12-18 22:32:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:04,701 INFO L462 AbstractCegarLoop]: Abstraction has 114878 states and 496758 transitions. [2019-12-18 22:32:04,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 114878 states and 496758 transitions. [2019-12-18 22:32:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:32:04,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:04,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:04,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1817031618, now seen corresponding path program 1 times [2019-12-18 22:32:04,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:04,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309450703] [2019-12-18 22:32:04,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:04,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309450703] [2019-12-18 22:32:04,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:04,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:04,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601845293] [2019-12-18 22:32:04,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:32:04,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:04,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:32:04,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:32:04,795 INFO L87 Difference]: Start difference. First operand 114878 states and 496758 transitions. Second operand 4 states. [2019-12-18 22:32:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:10,252 INFO L93 Difference]: Finished difference Result 184188 states and 760222 transitions. [2019-12-18 22:32:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:32:10,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:32:10,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:10,935 INFO L225 Difference]: With dead ends: 184188 [2019-12-18 22:32:10,935 INFO L226 Difference]: Without dead ends: 184139 [2019-12-18 22:32:10,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184139 states. [2019-12-18 22:32:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184139 to 169203. [2019-12-18 22:32:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169203 states. [2019-12-18 22:32:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169203 states to 169203 states and 707190 transitions. [2019-12-18 22:32:27,680 INFO L78 Accepts]: Start accepts. Automaton has 169203 states and 707190 transitions. Word has length 11 [2019-12-18 22:32:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:27,681 INFO L462 AbstractCegarLoop]: Abstraction has 169203 states and 707190 transitions. [2019-12-18 22:32:27,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:32:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 169203 states and 707190 transitions. [2019-12-18 22:32:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:32:27,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:27,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:27,688 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:27,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:27,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1405836985, now seen corresponding path program 1 times [2019-12-18 22:32:27,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:27,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668150801] [2019-12-18 22:32:27,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:27,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668150801] [2019-12-18 22:32:27,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:27,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:27,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244545270] [2019-12-18 22:32:27,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:32:27,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:32:27,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:32:27,796 INFO L87 Difference]: Start difference. First operand 169203 states and 707190 transitions. Second operand 4 states. [2019-12-18 22:32:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:30,768 INFO L93 Difference]: Finished difference Result 240014 states and 977713 transitions. [2019-12-18 22:32:30,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:32:30,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:32:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:31,497 INFO L225 Difference]: With dead ends: 240014 [2019-12-18 22:32:31,497 INFO L226 Difference]: Without dead ends: 239951 [2019-12-18 22:32:31,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239951 states. [2019-12-18 22:32:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239951 to 203645. [2019-12-18 22:32:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203645 states. [2019-12-18 22:32:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203645 states to 203645 states and 844323 transitions. [2019-12-18 22:32:49,807 INFO L78 Accepts]: Start accepts. Automaton has 203645 states and 844323 transitions. Word has length 13 [2019-12-18 22:32:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:49,809 INFO L462 AbstractCegarLoop]: Abstraction has 203645 states and 844323 transitions. [2019-12-18 22:32:49,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:32:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 203645 states and 844323 transitions. [2019-12-18 22:32:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:32:49,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:49,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:49,813 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1324537938, now seen corresponding path program 1 times [2019-12-18 22:32:49,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:49,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189432019] [2019-12-18 22:32:49,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:49,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189432019] [2019-12-18 22:32:49,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:49,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:49,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616149822] [2019-12-18 22:32:49,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:32:49,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:49,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:32:49,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:49,885 INFO L87 Difference]: Start difference. First operand 203645 states and 844323 transitions. Second operand 3 states. [2019-12-18 22:32:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:50,069 INFO L93 Difference]: Finished difference Result 39928 states and 130360 transitions. [2019-12-18 22:32:50,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:32:50,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:32:50,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:50,129 INFO L225 Difference]: With dead ends: 39928 [2019-12-18 22:32:50,130 INFO L226 Difference]: Without dead ends: 39928 [2019-12-18 22:32:50,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2019-12-18 22:32:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 39928. [2019-12-18 22:32:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39928 states. [2019-12-18 22:32:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39928 states to 39928 states and 130360 transitions. [2019-12-18 22:32:56,151 INFO L78 Accepts]: Start accepts. Automaton has 39928 states and 130360 transitions. Word has length 13 [2019-12-18 22:32:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:56,152 INFO L462 AbstractCegarLoop]: Abstraction has 39928 states and 130360 transitions. [2019-12-18 22:32:56,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39928 states and 130360 transitions. [2019-12-18 22:32:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:32:56,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:56,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:56,155 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1708808890, now seen corresponding path program 1 times [2019-12-18 22:32:56,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:56,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948792996] [2019-12-18 22:32:56,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:56,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948792996] [2019-12-18 22:32:56,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:56,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:32:56,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484209011] [2019-12-18 22:32:56,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:32:56,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:56,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:32:56,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:56,263 INFO L87 Difference]: Start difference. First operand 39928 states and 130360 transitions. Second operand 5 states. [2019-12-18 22:32:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:57,061 INFO L93 Difference]: Finished difference Result 53752 states and 171521 transitions. [2019-12-18 22:32:57,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:32:57,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:32:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:57,149 INFO L225 Difference]: With dead ends: 53752 [2019-12-18 22:32:57,150 INFO L226 Difference]: Without dead ends: 53739 [2019-12-18 22:32:57,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:32:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53739 states. [2019-12-18 22:32:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53739 to 40157. [2019-12-18 22:32:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-18 22:32:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 130977 transitions. [2019-12-18 22:32:58,339 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 130977 transitions. Word has length 19 [2019-12-18 22:32:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:58,339 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 130977 transitions. [2019-12-18 22:32:58,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:32:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 130977 transitions. [2019-12-18 22:32:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:32:58,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:58,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:58,351 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash 102238509, now seen corresponding path program 1 times [2019-12-18 22:32:58,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:58,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671824365] [2019-12-18 22:32:58,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:58,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671824365] [2019-12-18 22:32:58,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:58,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:32:58,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030282079] [2019-12-18 22:32:58,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:32:58,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:58,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:32:58,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:32:58,467 INFO L87 Difference]: Start difference. First operand 40157 states and 130977 transitions. Second operand 4 states. [2019-12-18 22:32:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:58,504 INFO L93 Difference]: Finished difference Result 7224 states and 19739 transitions. [2019-12-18 22:32:58,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:32:58,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:32:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:58,516 INFO L225 Difference]: With dead ends: 7224 [2019-12-18 22:32:58,517 INFO L226 Difference]: Without dead ends: 7224 [2019-12-18 22:32:58,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:32:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-18 22:32:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7112. [2019-12-18 22:32:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2019-12-18 22:32:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 19419 transitions. [2019-12-18 22:32:58,610 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 19419 transitions. Word has length 25 [2019-12-18 22:32:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:58,611 INFO L462 AbstractCegarLoop]: Abstraction has 7112 states and 19419 transitions. [2019-12-18 22:32:58,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:32:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 19419 transitions. [2019-12-18 22:32:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:32:58,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:58,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:58,623 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:58,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash -297997791, now seen corresponding path program 1 times [2019-12-18 22:32:58,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:58,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948895903] [2019-12-18 22:32:58,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:58,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948895903] [2019-12-18 22:32:58,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:58,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:32:58,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140439549] [2019-12-18 22:32:58,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:32:58,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:32:58,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:58,732 INFO L87 Difference]: Start difference. First operand 7112 states and 19419 transitions. Second operand 5 states. [2019-12-18 22:32:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:58,771 INFO L93 Difference]: Finished difference Result 5025 states and 14423 transitions. [2019-12-18 22:32:58,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:32:58,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:32:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:58,778 INFO L225 Difference]: With dead ends: 5025 [2019-12-18 22:32:58,778 INFO L226 Difference]: Without dead ends: 5025 [2019-12-18 22:32:58,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-18 22:32:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-18 22:32:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-18 22:32:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13439 transitions. [2019-12-18 22:32:58,846 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13439 transitions. Word has length 37 [2019-12-18 22:32:58,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:58,846 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13439 transitions. [2019-12-18 22:32:58,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:32:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13439 transitions. [2019-12-18 22:32:58,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:32:58,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:58,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:58,854 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:58,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:58,855 INFO L82 PathProgramCache]: Analyzing trace with hash 253348591, now seen corresponding path program 1 times [2019-12-18 22:32:58,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:58,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004449161] [2019-12-18 22:32:58,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:58,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004449161] [2019-12-18 22:32:58,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:58,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:32:58,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018946377] [2019-12-18 22:32:58,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:32:58,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:58,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:32:58,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:58,929 INFO L87 Difference]: Start difference. First operand 4661 states and 13439 transitions. Second operand 3 states. [2019-12-18 22:32:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:58,992 INFO L93 Difference]: Finished difference Result 4670 states and 13453 transitions. [2019-12-18 22:32:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:32:58,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:32:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:59,000 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:32:59,000 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:32:59,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:32:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:32:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:32:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13449 transitions. [2019-12-18 22:32:59,061 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13449 transitions. Word has length 65 [2019-12-18 22:32:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:59,061 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13449 transitions. [2019-12-18 22:32:59,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13449 transitions. [2019-12-18 22:32:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:32:59,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:59,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:59,071 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:59,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1957187666, now seen corresponding path program 1 times [2019-12-18 22:32:59,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:59,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990605241] [2019-12-18 22:32:59,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:59,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990605241] [2019-12-18 22:32:59,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:59,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:32:59,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703172948] [2019-12-18 22:32:59,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:32:59,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:59,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:32:59,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:59,149 INFO L87 Difference]: Start difference. First operand 4666 states and 13449 transitions. Second operand 3 states. [2019-12-18 22:32:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:59,201 INFO L93 Difference]: Finished difference Result 4670 states and 13443 transitions. [2019-12-18 22:32:59,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:32:59,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:32:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:59,209 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:32:59,209 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:32:59,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:32:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:32:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:32:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13439 transitions. [2019-12-18 22:32:59,269 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13439 transitions. Word has length 65 [2019-12-18 22:32:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:59,269 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13439 transitions. [2019-12-18 22:32:59,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13439 transitions. [2019-12-18 22:32:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:32:59,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:59,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:59,277 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:59,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:59,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1964874705, now seen corresponding path program 1 times [2019-12-18 22:32:59,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:59,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135181793] [2019-12-18 22:32:59,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:59,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135181793] [2019-12-18 22:32:59,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:59,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:32:59,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205426799] [2019-12-18 22:32:59,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:32:59,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:32:59,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:59,393 INFO L87 Difference]: Start difference. First operand 4666 states and 13439 transitions. Second operand 5 states. [2019-12-18 22:32:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:59,725 INFO L93 Difference]: Finished difference Result 7416 states and 21064 transitions. [2019-12-18 22:32:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:32:59,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:32:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:59,736 INFO L225 Difference]: With dead ends: 7416 [2019-12-18 22:32:59,736 INFO L226 Difference]: Without dead ends: 7416 [2019-12-18 22:32:59,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:32:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7416 states. [2019-12-18 22:32:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7416 to 5422. [2019-12-18 22:32:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-12-18 22:32:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 15669 transitions. [2019-12-18 22:32:59,820 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 15669 transitions. Word has length 65 [2019-12-18 22:32:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:59,820 INFO L462 AbstractCegarLoop]: Abstraction has 5422 states and 15669 transitions. [2019-12-18 22:32:59,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:32:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 15669 transitions. [2019-12-18 22:32:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:32:59,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:59,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:59,828 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:59,828 INFO L82 PathProgramCache]: Analyzing trace with hash -857096593, now seen corresponding path program 2 times [2019-12-18 22:32:59,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:59,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905210542] [2019-12-18 22:32:59,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:59,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905210542] [2019-12-18 22:32:59,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:59,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:32:59,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396818242] [2019-12-18 22:32:59,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:32:59,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:32:59,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:32:59,929 INFO L87 Difference]: Start difference. First operand 5422 states and 15669 transitions. Second operand 6 states. [2019-12-18 22:33:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:00,543 INFO L93 Difference]: Finished difference Result 9150 states and 26231 transitions. [2019-12-18 22:33:00,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:33:00,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:33:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:00,558 INFO L225 Difference]: With dead ends: 9150 [2019-12-18 22:33:00,558 INFO L226 Difference]: Without dead ends: 9150 [2019-12-18 22:33:00,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:33:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9150 states. [2019-12-18 22:33:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9150 to 5924. [2019-12-18 22:33:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5924 states. [2019-12-18 22:33:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 17161 transitions. [2019-12-18 22:33:00,715 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 17161 transitions. Word has length 65 [2019-12-18 22:33:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:00,715 INFO L462 AbstractCegarLoop]: Abstraction has 5924 states and 17161 transitions. [2019-12-18 22:33:00,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:33:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 17161 transitions. [2019-12-18 22:33:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:33:00,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:00,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:00,729 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:00,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:00,730 INFO L82 PathProgramCache]: Analyzing trace with hash -730670737, now seen corresponding path program 3 times [2019-12-18 22:33:00,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:00,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363575100] [2019-12-18 22:33:00,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:00,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363575100] [2019-12-18 22:33:00,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:00,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:00,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212409458] [2019-12-18 22:33:00,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:00,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:00,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:00,803 INFO L87 Difference]: Start difference. First operand 5924 states and 17161 transitions. Second operand 3 states. [2019-12-18 22:33:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:00,839 INFO L93 Difference]: Finished difference Result 5090 states and 14466 transitions. [2019-12-18 22:33:00,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:00,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:33:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:00,847 INFO L225 Difference]: With dead ends: 5090 [2019-12-18 22:33:00,847 INFO L226 Difference]: Without dead ends: 5090 [2019-12-18 22:33:00,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2019-12-18 22:33:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 4950. [2019-12-18 22:33:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-18 22:33:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14080 transitions. [2019-12-18 22:33:00,949 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14080 transitions. Word has length 65 [2019-12-18 22:33:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:00,950 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14080 transitions. [2019-12-18 22:33:00,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14080 transitions. [2019-12-18 22:33:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:33:00,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:00,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:00,960 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:00,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:00,961 INFO L82 PathProgramCache]: Analyzing trace with hash -190495509, now seen corresponding path program 1 times [2019-12-18 22:33:00,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:00,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846319684] [2019-12-18 22:33:00,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:01,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846319684] [2019-12-18 22:33:01,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:01,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:33:01,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400040715] [2019-12-18 22:33:01,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:33:01,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:33:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:33:01,291 INFO L87 Difference]: Start difference. First operand 4950 states and 14080 transitions. Second operand 6 states. [2019-12-18 22:33:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:01,403 INFO L93 Difference]: Finished difference Result 8076 states and 22982 transitions. [2019-12-18 22:33:01,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:33:01,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 22:33:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:01,410 INFO L225 Difference]: With dead ends: 8076 [2019-12-18 22:33:01,410 INFO L226 Difference]: Without dead ends: 3950 [2019-12-18 22:33:01,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:33:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2019-12-18 22:33:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3950. [2019-12-18 22:33:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2019-12-18 22:33:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 11210 transitions. [2019-12-18 22:33:01,493 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 11210 transitions. Word has length 66 [2019-12-18 22:33:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:01,494 INFO L462 AbstractCegarLoop]: Abstraction has 3950 states and 11210 transitions. [2019-12-18 22:33:01,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:33:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 11210 transitions. [2019-12-18 22:33:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:33:01,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:01,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:01,502 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:01,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1847269673, now seen corresponding path program 2 times [2019-12-18 22:33:01,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:01,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580657254] [2019-12-18 22:33:01,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:01,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580657254] [2019-12-18 22:33:01,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:01,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:33:01,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996165821] [2019-12-18 22:33:01,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:33:01,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:01,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:33:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:33:01,657 INFO L87 Difference]: Start difference. First operand 3950 states and 11210 transitions. Second operand 6 states. [2019-12-18 22:33:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:02,027 INFO L93 Difference]: Finished difference Result 5762 states and 16076 transitions. [2019-12-18 22:33:02,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:33:02,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 22:33:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:02,035 INFO L225 Difference]: With dead ends: 5762 [2019-12-18 22:33:02,036 INFO L226 Difference]: Without dead ends: 5762 [2019-12-18 22:33:02,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:33:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2019-12-18 22:33:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 4461. [2019-12-18 22:33:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4461 states. [2019-12-18 22:33:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 12635 transitions. [2019-12-18 22:33:02,128 INFO L78 Accepts]: Start accepts. Automaton has 4461 states and 12635 transitions. Word has length 66 [2019-12-18 22:33:02,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:02,128 INFO L462 AbstractCegarLoop]: Abstraction has 4461 states and 12635 transitions. [2019-12-18 22:33:02,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:33:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4461 states and 12635 transitions. [2019-12-18 22:33:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:33:02,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:02,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:02,134 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash 534056381, now seen corresponding path program 3 times [2019-12-18 22:33:02,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:02,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140026949] [2019-12-18 22:33:02,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:02,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140026949] [2019-12-18 22:33:02,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:02,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:33:02,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21597268] [2019-12-18 22:33:02,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:33:02,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:02,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:33:02,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:33:02,223 INFO L87 Difference]: Start difference. First operand 4461 states and 12635 transitions. Second operand 6 states. [2019-12-18 22:33:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:02,623 INFO L93 Difference]: Finished difference Result 6401 states and 17772 transitions. [2019-12-18 22:33:02,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:33:02,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 22:33:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:02,632 INFO L225 Difference]: With dead ends: 6401 [2019-12-18 22:33:02,633 INFO L226 Difference]: Without dead ends: 6401 [2019-12-18 22:33:02,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:33:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6401 states. [2019-12-18 22:33:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6401 to 4860. [2019-12-18 22:33:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4860 states. [2019-12-18 22:33:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 13633 transitions. [2019-12-18 22:33:02,710 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 13633 transitions. Word has length 66 [2019-12-18 22:33:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:02,710 INFO L462 AbstractCegarLoop]: Abstraction has 4860 states and 13633 transitions. [2019-12-18 22:33:02,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:33:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 13633 transitions. [2019-12-18 22:33:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:33:02,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:02,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:02,717 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:02,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:02,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2007535423, now seen corresponding path program 4 times [2019-12-18 22:33:02,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:02,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476741389] [2019-12-18 22:33:02,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:02,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476741389] [2019-12-18 22:33:02,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:02,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:33:02,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851542219] [2019-12-18 22:33:02,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:33:02,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:02,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:33:02,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:33:02,809 INFO L87 Difference]: Start difference. First operand 4860 states and 13633 transitions. Second operand 7 states. [2019-12-18 22:33:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:03,318 INFO L93 Difference]: Finished difference Result 6822 states and 18868 transitions. [2019-12-18 22:33:03,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:33:03,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 22:33:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:03,327 INFO L225 Difference]: With dead ends: 6822 [2019-12-18 22:33:03,327 INFO L226 Difference]: Without dead ends: 6822 [2019-12-18 22:33:03,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:33:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6822 states. [2019-12-18 22:33:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6822 to 4692. [2019-12-18 22:33:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4692 states. [2019-12-18 22:33:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 13181 transitions. [2019-12-18 22:33:03,397 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 13181 transitions. Word has length 66 [2019-12-18 22:33:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:03,398 INFO L462 AbstractCegarLoop]: Abstraction has 4692 states and 13181 transitions. [2019-12-18 22:33:03,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:33:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 13181 transitions. [2019-12-18 22:33:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:33:03,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:03,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:03,406 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:03,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2115049527, now seen corresponding path program 5 times [2019-12-18 22:33:03,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:03,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960147748] [2019-12-18 22:33:03,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:03,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960147748] [2019-12-18 22:33:03,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:03,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:03,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748297605] [2019-12-18 22:33:03,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:03,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:03,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:03,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:03,471 INFO L87 Difference]: Start difference. First operand 4692 states and 13181 transitions. Second operand 3 states. [2019-12-18 22:33:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:03,516 INFO L93 Difference]: Finished difference Result 4692 states and 13180 transitions. [2019-12-18 22:33:03,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:03,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:33:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:03,522 INFO L225 Difference]: With dead ends: 4692 [2019-12-18 22:33:03,523 INFO L226 Difference]: Without dead ends: 4692 [2019-12-18 22:33:03,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2019-12-18 22:33:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 3155. [2019-12-18 22:33:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3155 states. [2019-12-18 22:33:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 8951 transitions. [2019-12-18 22:33:03,572 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 8951 transitions. Word has length 66 [2019-12-18 22:33:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:03,572 INFO L462 AbstractCegarLoop]: Abstraction has 3155 states and 8951 transitions. [2019-12-18 22:33:03,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 8951 transitions. [2019-12-18 22:33:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:33:03,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:03,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:03,578 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:03,578 INFO L82 PathProgramCache]: Analyzing trace with hash 440086491, now seen corresponding path program 1 times [2019-12-18 22:33:03,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:03,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340885859] [2019-12-18 22:33:03,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:03,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340885859] [2019-12-18 22:33:03,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:03,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:33:03,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008872545] [2019-12-18 22:33:03,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:33:03,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:03,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:33:03,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:33:03,677 INFO L87 Difference]: Start difference. First operand 3155 states and 8951 transitions. Second operand 6 states. [2019-12-18 22:33:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:03,764 INFO L93 Difference]: Finished difference Result 5550 states and 15794 transitions. [2019-12-18 22:33:03,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:33:03,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 22:33:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:03,770 INFO L225 Difference]: With dead ends: 5550 [2019-12-18 22:33:03,770 INFO L226 Difference]: Without dead ends: 2510 [2019-12-18 22:33:03,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:33:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2019-12-18 22:33:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2096. [2019-12-18 22:33:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-12-18 22:33:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 5938 transitions. [2019-12-18 22:33:03,812 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 5938 transitions. Word has length 67 [2019-12-18 22:33:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:03,812 INFO L462 AbstractCegarLoop]: Abstraction has 2096 states and 5938 transitions. [2019-12-18 22:33:03,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:33:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 5938 transitions. [2019-12-18 22:33:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:33:03,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:03,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:03,815 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1956804165, now seen corresponding path program 2 times [2019-12-18 22:33:03,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:03,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166120634] [2019-12-18 22:33:03,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:03,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166120634] [2019-12-18 22:33:03,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:03,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:33:03,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089955120] [2019-12-18 22:33:03,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:33:03,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:03,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:33:03,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:33:03,940 INFO L87 Difference]: Start difference. First operand 2096 states and 5938 transitions. Second operand 8 states. [2019-12-18 22:33:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:04,444 INFO L93 Difference]: Finished difference Result 3669 states and 10227 transitions. [2019-12-18 22:33:04,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:33:04,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-18 22:33:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:04,450 INFO L225 Difference]: With dead ends: 3669 [2019-12-18 22:33:04,450 INFO L226 Difference]: Without dead ends: 3669 [2019-12-18 22:33:04,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:33:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2019-12-18 22:33:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 2133. [2019-12-18 22:33:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-18 22:33:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 6045 transitions. [2019-12-18 22:33:04,486 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 6045 transitions. Word has length 67 [2019-12-18 22:33:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:04,486 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 6045 transitions. [2019-12-18 22:33:04,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:33:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 6045 transitions. [2019-12-18 22:33:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:33:04,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:04,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:04,490 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash 467896731, now seen corresponding path program 3 times [2019-12-18 22:33:04,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:04,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079145372] [2019-12-18 22:33:04,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:04,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079145372] [2019-12-18 22:33:04,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:04,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:04,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841111918] [2019-12-18 22:33:04,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:04,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:04,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:04,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:04,536 INFO L87 Difference]: Start difference. First operand 2133 states and 6045 transitions. Second operand 3 states. [2019-12-18 22:33:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:04,549 INFO L93 Difference]: Finished difference Result 1835 states and 5052 transitions. [2019-12-18 22:33:04,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:04,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:33:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:04,552 INFO L225 Difference]: With dead ends: 1835 [2019-12-18 22:33:04,552 INFO L226 Difference]: Without dead ends: 1835 [2019-12-18 22:33:04,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-12-18 22:33:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1772. [2019-12-18 22:33:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2019-12-18 22:33:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 4879 transitions. [2019-12-18 22:33:04,586 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 4879 transitions. Word has length 67 [2019-12-18 22:33:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:04,586 INFO L462 AbstractCegarLoop]: Abstraction has 1772 states and 4879 transitions. [2019-12-18 22:33:04,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 4879 transitions. [2019-12-18 22:33:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:33:04,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:04,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:04,589 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1001515831, now seen corresponding path program 1 times [2019-12-18 22:33:04,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:04,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80398518] [2019-12-18 22:33:04,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:33:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:33:04,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:33:04,757 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:33:04,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$w_buff1_used~0_75 0) (= 0 v_~x$w_buff0_used~0_119) (= 0 v_~weak$$choice0~0_9) (= 0 v_~x$r_buff0_thd3~0_21) (= 0 |v_ULTIMATE.start_main_~#t2028~0.offset_18|) (= v_~z~0_11 0) (= |v_#NULL.offset_3| 0) (= v_~x$r_buff1_thd2~0_18 0) (= 0 v_~x$r_buff0_thd2~0_27) (= v_~x$flush_delayed~0_17 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_34) (= 0 v_~x$read_delayed_var~0.base_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2028~0.base_21|) 0) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~x~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_48 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2028~0.base_21| 4)) (= 0 v_~x$r_buff0_thd1~0_21) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2028~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2028~0.base_21|) |v_ULTIMATE.start_main_~#t2028~0.offset_18| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2028~0.base_21|) (= v_~y~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2028~0.base_21| 1)) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (= v_~x$r_buff1_thd1~0_17 0) (= v_~x$r_buff1_thd3~0_16 0) (= 0 v_~x$w_buff1~0_30))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_10|, ~x$w_buff0~0=v_~x$w_buff0~0_31, ULTIMATE.start_main_~#t2029~0.base=|v_ULTIMATE.start_main_~#t2029~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_14|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_15|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_17|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t2029~0.offset=|v_ULTIMATE.start_main_~#t2029~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ~x$w_buff1~0=v_~x$w_buff1~0_30, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_75, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ULTIMATE.start_main_~#t2028~0.base=|v_ULTIMATE.start_main_~#t2028~0.base_21|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_31, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_10|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_10|, ULTIMATE.start_main_~#t2030~0.base=|v_ULTIMATE.start_main_~#t2030~0.base_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_~#t2030~0.offset=|v_ULTIMATE.start_main_~#t2030~0.offset_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t2028~0.offset=|v_ULTIMATE.start_main_~#t2028~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t2029~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2029~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2028~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2030~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t2030~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2028~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:33:04,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-1-->L807: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2029~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2029~0.base_13|) |v_ULTIMATE.start_main_~#t2029~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2029~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2029~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2029~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2029~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2029~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2029~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2029~0.base=|v_ULTIMATE.start_main_~#t2029~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2029~0.offset=|v_ULTIMATE.start_main_~#t2029~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2029~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2029~0.offset] because there is no mapped edge [2019-12-18 22:33:04,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~x$w_buff0_used~0_80) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_15) (= 2 v_~x$w_buff0~0_16) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_49 v_~x$w_buff0_used~0_81) (= (mod v_~x$w_buff1_used~0_49 256) 0)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:33:04,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2030~0.base_9| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t2030~0.offset_8| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2030~0.base_9| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2030~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2030~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2030~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2030~0.base_9|) |v_ULTIMATE.start_main_~#t2030~0.offset_8| 2))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2030~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2030~0.base=|v_ULTIMATE.start_main_~#t2030~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2030~0.offset=|v_ULTIMATE.start_main_~#t2030~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2030~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2030~0.offset, #length] because there is no mapped edge [2019-12-18 22:33:04,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In1899209518 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1899209518 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1899209518| ~x$w_buff1~0_In1899209518)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1899209518| ~x~0_In1899209518) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1899209518, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1899209518, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1899209518, ~x~0=~x~0_In1899209518} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1899209518|, ~x$w_buff1~0=~x$w_buff1~0_In1899209518, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1899209518, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1899209518, ~x~0=~x~0_In1899209518} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:33:04,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 22:33:04,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In745117695 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In745117695 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In745117695 |P2Thread1of1ForFork2_#t~ite17_Out745117695|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out745117695| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In745117695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In745117695} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In745117695, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out745117695|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In745117695} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:33:04,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L784-->L784-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1360938323 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1360938323 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1360938323 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1360938323 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out1360938323| 0)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out1360938323| ~x$w_buff1_used~0_In1360938323) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1360938323, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1360938323, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1360938323, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1360938323} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1360938323, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1360938323, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1360938323, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1360938323|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1360938323} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:33:04,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In951257253 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In951257253 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out951257253|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In951257253 |P2Thread1of1ForFork2_#t~ite19_Out951257253|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In951257253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In951257253} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In951257253, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out951257253|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In951257253} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:33:04,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1573012054 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1573012054 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1573012054 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1573012054 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out-1573012054| ~x$r_buff1_thd3~0_In-1573012054) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out-1573012054| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1573012054, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1573012054, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1573012054, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1573012054} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1573012054|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1573012054, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1573012054, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1573012054, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1573012054} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:33:04,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_13)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:33:04,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L733-2-->L733-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1853108215 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1853108215| |P0Thread1of1ForFork0_#t~ite4_Out1853108215|)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1853108215 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1853108215| ~x~0_In1853108215) (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1853108215| ~x$w_buff1~0_In1853108215) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1853108215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1853108215, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1853108215, ~x~0=~x~0_In1853108215} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1853108215|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1853108215|, ~x$w_buff1~0=~x$w_buff1~0_In1853108215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1853108215, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1853108215, ~x~0=~x~0_In1853108215} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 22:33:04,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1431489906 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1431489906 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1431489906| ~x$w_buff0_used~0_In-1431489906)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1431489906| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1431489906, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1431489906} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1431489906|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1431489906, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1431489906} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:33:04,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In182919776 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In182919776 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In182919776 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In182919776 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out182919776|)) (and (= ~x$w_buff1_used~0_In182919776 |P0Thread1of1ForFork0_#t~ite6_Out182919776|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In182919776, ~x$w_buff1_used~0=~x$w_buff1_used~0_In182919776, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In182919776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In182919776} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out182919776|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In182919776, ~x$w_buff1_used~0=~x$w_buff1_used~0_In182919776, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In182919776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In182919776} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:33:04,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-190322246 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-190322246 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-190322246|)) (and (= ~x$r_buff0_thd1~0_In-190322246 |P0Thread1of1ForFork0_#t~ite7_Out-190322246|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-190322246, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-190322246} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-190322246, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-190322246|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-190322246} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 22:33:04,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L737-->L737-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In2142317179 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In2142317179 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In2142317179 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In2142317179 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out2142317179| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out2142317179| ~x$r_buff1_thd1~0_In2142317179) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2142317179, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2142317179, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2142317179, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2142317179} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2142317179, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2142317179|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2142317179, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2142317179, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2142317179} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:33:04,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L737-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 22:33:04,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1632644994 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1632644994 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1632644994| ~x$w_buff0_used~0_In-1632644994) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1632644994| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1632644994, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1632644994} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1632644994|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1632644994, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1632644994} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:33:04,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1708200299 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1708200299 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1708200299 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1708200299 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1708200299|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1708200299 |P1Thread1of1ForFork1_#t~ite12_Out1708200299|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1708200299, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1708200299, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1708200299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1708200299} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1708200299, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1708200299, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1708200299|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1708200299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1708200299} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:33:04,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L765-->L766: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1362467463 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1362467463 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1362467463) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In1362467463 ~x$r_buff0_thd2~0_Out1362467463) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1362467463, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1362467463} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1362467463|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1362467463, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1362467463} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:33:04,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1935645407 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1935645407 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1935645407 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1935645407 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1935645407| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out-1935645407| ~x$r_buff1_thd2~0_In-1935645407)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1935645407, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1935645407, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1935645407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1935645407} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1935645407, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1935645407, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1935645407, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1935645407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1935645407} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:33:04,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:33:04,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:33:04,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L815-2-->L815-5: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1868992660 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1868992660 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite25_Out-1868992660| |ULTIMATE.start_main_#t~ite24_Out-1868992660|))) (or (and (= ~x$w_buff1~0_In-1868992660 |ULTIMATE.start_main_#t~ite24_Out-1868992660|) (not .cse0) .cse1 (not .cse2)) (and (= ~x~0_In-1868992660 |ULTIMATE.start_main_#t~ite24_Out-1868992660|) (or .cse2 .cse0) .cse1))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1868992660, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1868992660, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1868992660, ~x~0=~x~0_In-1868992660} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1868992660, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1868992660|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1868992660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1868992660, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1868992660, ~x~0=~x~0_In-1868992660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 22:33:04,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-23942351 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-23942351 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out-23942351|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-23942351 |ULTIMATE.start_main_#t~ite26_Out-23942351|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-23942351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-23942351} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-23942351, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-23942351|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-23942351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:33:04,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In774003116 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In774003116 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In774003116 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In774003116 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out774003116| ~x$w_buff1_used~0_In774003116) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out774003116|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In774003116, ~x$w_buff1_used~0=~x$w_buff1_used~0_In774003116, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In774003116, ~x$w_buff0_used~0=~x$w_buff0_used~0_In774003116} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In774003116, ~x$w_buff1_used~0=~x$w_buff1_used~0_In774003116, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out774003116|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In774003116, ~x$w_buff0_used~0=~x$w_buff0_used~0_In774003116} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:33:04,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1969752898 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1969752898 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out1969752898|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In1969752898 |ULTIMATE.start_main_#t~ite28_Out1969752898|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1969752898, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1969752898} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1969752898, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1969752898|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1969752898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:33:04,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1349661859 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1349661859 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1349661859 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1349661859 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out1349661859|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In1349661859 |ULTIMATE.start_main_#t~ite29_Out1349661859|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1349661859, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1349661859, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1349661859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1349661859} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1349661859, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1349661859|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1349661859, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1349661859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1349661859} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:33:04,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L831-->L832: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd0~0_56 v_~x$r_buff0_thd0~0_55)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:33:04,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~x$flush_delayed~0_12 256))) (= v_~x$mem_tmp~0_6 v_~x~0_26) (= v_~x$flush_delayed~0_11 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:33:04,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:33:04,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:33:04 BasicIcfg [2019-12-18 22:33:04,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:33:04,932 INFO L168 Benchmark]: Toolchain (without parser) took 101610.01 ms. Allocated memory was 146.8 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 101.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 22:33:04,932 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 22:33:04,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.99 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 157.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:33:04,934 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.56 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:33:04,936 INFO L168 Benchmark]: Boogie Preprocessor took 38.40 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:33:04,937 INFO L168 Benchmark]: RCFGBuilder took 875.70 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.2 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:33:04,938 INFO L168 Benchmark]: TraceAbstraction took 99907.02 ms. Allocated memory was 203.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 22:33:04,947 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.44 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 718.99 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 157.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.56 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.40 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 875.70 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.2 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99907.02 ms. Allocated memory was 203.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 28 ChoiceCompositions, 5991 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 91848 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L727] 1 z = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 99.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2937 SDtfs, 2260 SDslu, 4998 SDs, 0 SdLazy, 3357 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 39 SyntacticMatches, 19 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203645occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 54.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 79190 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1047 NumberOfCodeBlocks, 1047 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 959 ConstructedInterpolants, 0 QuantifiedInterpolants, 131837 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...