/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:19:35,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:19:35,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:19:35,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:19:35,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:19:35,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:19:35,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:19:35,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:19:35,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:19:35,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:19:35,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:19:35,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:19:35,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:19:35,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:19:35,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:19:35,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:19:35,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:19:35,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:19:35,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:19:35,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:19:35,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:19:35,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:19:35,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:19:35,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:19:35,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:19:35,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:19:35,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:19:35,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:19:35,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:19:35,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:19:35,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:19:35,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:19:35,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:19:35,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:19:35,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:19:35,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:19:35,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:19:35,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:19:35,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:19:35,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:19:35,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:19:35,100 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:19:35,114 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:19:35,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:19:35,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:19:35,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:19:35,116 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:19:35,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:19:35,116 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:19:35,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:19:35,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:19:35,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:19:35,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:19:35,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:19:35,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:19:35,118 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:19:35,118 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:19:35,118 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:19:35,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:19:35,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:19:35,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:19:35,119 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:19:35,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:19:35,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:19:35,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:19:35,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:19:35,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:19:35,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:19:35,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:19:35,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:19:35,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:19:35,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:19:35,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:19:35,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:19:35,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:19:35,404 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:19:35,404 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i [2019-12-18 17:19:35,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050404751/98d198201d9345e591f742efd19b875e/FLAG07383d3dd [2019-12-18 17:19:36,074 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:19:36,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i [2019-12-18 17:19:36,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050404751/98d198201d9345e591f742efd19b875e/FLAG07383d3dd [2019-12-18 17:19:36,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050404751/98d198201d9345e591f742efd19b875e [2019-12-18 17:19:36,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:19:36,389 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:19:36,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:19:36,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:19:36,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:19:36,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:19:36" (1/1) ... [2019-12-18 17:19:36,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6171d743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:36, skipping insertion in model container [2019-12-18 17:19:36,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:19:36" (1/1) ... [2019-12-18 17:19:36,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:19:36,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:19:37,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:19:37,051 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:19:37,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:19:37,189 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:19:37,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37 WrapperNode [2019-12-18 17:19:37,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:19:37,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:19:37,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:19:37,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:19:37,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (1/1) ... [2019-12-18 17:19:37,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (1/1) ... [2019-12-18 17:19:37,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:19:37,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:19:37,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:19:37,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:19:37,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (1/1) ... [2019-12-18 17:19:37,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (1/1) ... [2019-12-18 17:19:37,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (1/1) ... [2019-12-18 17:19:37,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (1/1) ... [2019-12-18 17:19:37,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (1/1) ... [2019-12-18 17:19:37,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (1/1) ... [2019-12-18 17:19:37,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (1/1) ... [2019-12-18 17:19:37,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:19:37,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:19:37,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:19:37,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:19:37,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (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 17:19:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:19:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:19:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:19:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:19:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:19:37,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:19:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:19:37,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:19:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:19:37,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:19:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:19:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:19:37,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:19:37,383 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 17:19:38,163 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:19:38,163 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:19:38,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:19:38 BoogieIcfgContainer [2019-12-18 17:19:38,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:19:38,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:19:38,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:19:38,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:19:38,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:19:36" (1/3) ... [2019-12-18 17:19:38,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7ed163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:19:38, skipping insertion in model container [2019-12-18 17:19:38,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:37" (2/3) ... [2019-12-18 17:19:38,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7ed163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:19:38, skipping insertion in model container [2019-12-18 17:19:38,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:19:38" (3/3) ... [2019-12-18 17:19:38,173 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc.i [2019-12-18 17:19:38,184 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:19:38,184 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:19:38,192 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:19:38,193 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:19:38,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,237 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,237 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,237 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,238 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,238 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,271 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,272 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,299 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,301 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,310 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,310 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,310 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:38,336 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:19:38,357 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:19:38,357 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:19:38,357 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:19:38,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:19:38,357 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:19:38,357 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:19:38,358 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:19:38,358 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:19:38,375 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 17:19:38,377 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 17:19:38,465 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 17:19:38,465 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:19:38,482 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:19:38,510 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 17:19:38,563 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 17:19:38,563 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:19:38,580 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:19:38,602 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 17:19:38,603 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:19:43,996 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 17:19:44,101 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 17:19:44,426 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 17:19:44,557 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 17:19:44,586 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-18 17:19:44,587 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 17:19:44,590 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 17:19:58,055 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 17:19:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 17:19:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:19:58,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:58,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:19:58,065 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:58,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:58,071 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-18 17:19:58,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:58,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65637854] [2019-12-18 17:19:58,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:58,307 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 17:19:58,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65637854] [2019-12-18 17:19:58,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:58,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:19:58,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487039151] [2019-12-18 17:19:58,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:19:58,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:19:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:19:58,335 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 17:20:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:01,282 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-18 17:20:01,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:20:01,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:20:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:01,944 INFO L225 Difference]: With dead ends: 101544 [2019-12-18 17:20:01,945 INFO L226 Difference]: Without dead ends: 95304 [2019-12-18 17:20:01,946 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 17:20:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-18 17:20:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-18 17:20:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-18 17:20:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-18 17:20:12,429 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-18 17:20:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:12,430 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-18 17:20:12,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:20:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-18 17:20:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:20:12,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:12,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:12,434 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-18 17:20:12,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:12,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857137942] [2019-12-18 17:20:12,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:12,606 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 17:20:12,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857137942] [2019-12-18 17:20:12,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:12,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:20:12,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408892081] [2019-12-18 17:20:12,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:20:12,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:12,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:20:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:20:12,610 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-18 17:20:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:17,415 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-18 17:20:17,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:20:17,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:20:17,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:17,946 INFO L225 Difference]: With dead ends: 152040 [2019-12-18 17:20:17,946 INFO L226 Difference]: Without dead ends: 151991 [2019-12-18 17:20:17,947 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 17:20:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-18 17:20:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-18 17:20:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-18 17:20:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-18 17:20:26,773 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-18 17:20:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:26,774 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-18 17:20:26,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:20:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-18 17:20:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:20:26,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:26,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:26,782 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:26,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-18 17:20:26,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:26,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627561279] [2019-12-18 17:20:26,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:26,852 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 17:20:26,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627561279] [2019-12-18 17:20:26,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:26,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:20:26,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962919747] [2019-12-18 17:20:26,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:20:26,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:26,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:20:26,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:20:26,854 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-18 17:20:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:26,971 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-18 17:20:26,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:20:26,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:20:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:27,066 INFO L225 Difference]: With dead ends: 30915 [2019-12-18 17:20:27,067 INFO L226 Difference]: Without dead ends: 30915 [2019-12-18 17:20:27,067 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 17:20:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-18 17:20:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-18 17:20:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-18 17:20:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-18 17:20:32,138 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-18 17:20:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:32,139 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-18 17:20:32,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:20:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-18 17:20:32,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:20:32,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:32,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:32,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:32,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:32,143 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-18 17:20:32,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:32,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630927219] [2019-12-18 17:20:32,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:32,266 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 17:20:32,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630927219] [2019-12-18 17:20:32,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:32,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:20:32,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360190378] [2019-12-18 17:20:32,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:20:32,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:32,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:20:32,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:20:32,268 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-18 17:20:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:32,678 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-18 17:20:32,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:20:32,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:20:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:32,749 INFO L225 Difference]: With dead ends: 38538 [2019-12-18 17:20:32,750 INFO L226 Difference]: Without dead ends: 38538 [2019-12-18 17:20:32,750 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 17:20:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-18 17:20:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-18 17:20:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-18 17:20:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-18 17:20:33,392 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-18 17:20:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:33,393 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-18 17:20:33,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:20:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-18 17:20:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:20:33,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:33,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:33,402 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:33,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:33,402 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-18 17:20:33,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:33,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357089683] [2019-12-18 17:20:33,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:33,544 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 17:20:33,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357089683] [2019-12-18 17:20:33,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:33,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:20:33,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116708343] [2019-12-18 17:20:33,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:20:33,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:33,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:20:33,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:20:33,546 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-18 17:20:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:34,216 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-18 17:20:34,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:20:34,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:20:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:34,575 INFO L225 Difference]: With dead ends: 44779 [2019-12-18 17:20:34,575 INFO L226 Difference]: Without dead ends: 44772 [2019-12-18 17:20:34,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 17:20:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-18 17:20:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-18 17:20:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-18 17:20:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-18 17:20:35,178 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-18 17:20:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:35,178 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-18 17:20:35,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:20:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-18 17:20:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:20:35,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:35,190 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 17:20:35,191 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-18 17:20:35,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:35,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281901171] [2019-12-18 17:20:35,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:35,258 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 17:20:35,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281901171] [2019-12-18 17:20:35,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:35,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:20:35,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81937490] [2019-12-18 17:20:35,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:20:35,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:35,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:20:35,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:20:35,263 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-18 17:20:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:35,323 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-18 17:20:35,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:20:35,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:20:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:35,343 INFO L225 Difference]: With dead ends: 13768 [2019-12-18 17:20:35,343 INFO L226 Difference]: Without dead ends: 13768 [2019-12-18 17:20:35,344 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 17:20:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-18 17:20:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-18 17:20:35,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-18 17:20:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-18 17:20:35,549 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-18 17:20:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:35,549 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-18 17:20:35,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:20:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-18 17:20:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:20:35,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:35,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:35,562 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:35,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:35,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-18 17:20:35,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:35,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167054270] [2019-12-18 17:20:35,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:35,606 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 17:20:35,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167054270] [2019-12-18 17:20:35,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:35,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:20:35,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838012052] [2019-12-18 17:20:35,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:20:35,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:20:35,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:20:35,609 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-18 17:20:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:35,719 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-18 17:20:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:20:35,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 17:20:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:35,761 INFO L225 Difference]: With dead ends: 19309 [2019-12-18 17:20:35,762 INFO L226 Difference]: Without dead ends: 19309 [2019-12-18 17:20:35,762 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 17:20:35,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-18 17:20:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-18 17:20:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-18 17:20:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-18 17:20:36,296 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-18 17:20:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:36,296 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-18 17:20:36,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:20:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-18 17:20:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:20:36,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:36,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:36,310 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:36,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:36,311 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-18 17:20:36,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:36,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460316401] [2019-12-18 17:20:36,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:36,363 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 17:20:36,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460316401] [2019-12-18 17:20:36,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:36,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:20:36,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240900808] [2019-12-18 17:20:36,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:20:36,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:36,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:20:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:20:36,365 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-18 17:20:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:36,452 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-18 17:20:36,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:20:36,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 17:20:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:36,482 INFO L225 Difference]: With dead ends: 21037 [2019-12-18 17:20:36,482 INFO L226 Difference]: Without dead ends: 21037 [2019-12-18 17:20:36,483 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 17:20:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-18 17:20:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-18 17:20:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-18 17:20:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-18 17:20:36,761 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-18 17:20:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:36,761 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-18 17:20:36,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:20:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-18 17:20:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:20:36,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:36,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:36,773 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:36,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-18 17:20:36,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:36,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031593322] [2019-12-18 17:20:36,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:36,888 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 17:20:36,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031593322] [2019-12-18 17:20:36,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:36,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:20:36,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578553056] [2019-12-18 17:20:36,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:20:36,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:36,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:20:36,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:20:36,890 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-18 17:20:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:37,523 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-18 17:20:37,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:20:37,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 17:20:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:37,568 INFO L225 Difference]: With dead ends: 29609 [2019-12-18 17:20:37,568 INFO L226 Difference]: Without dead ends: 29609 [2019-12-18 17:20:37,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:20:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-18 17:20:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-18 17:20:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-18 17:20:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-18 17:20:37,992 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-18 17:20:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:37,992 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-18 17:20:37,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:20:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-18 17:20:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:20:38,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:38,005 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] [2019-12-18 17:20:38,005 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:38,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:38,006 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-18 17:20:38,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:38,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137189995] [2019-12-18 17:20:38,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:38,130 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 17:20:38,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137189995] [2019-12-18 17:20:38,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:38,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:20:38,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081482036] [2019-12-18 17:20:38,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:20:38,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:38,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:20:38,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:20:38,132 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-18 17:20:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:38,745 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-18 17:20:38,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:20:38,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 17:20:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:38,796 INFO L225 Difference]: With dead ends: 28968 [2019-12-18 17:20:38,797 INFO L226 Difference]: Without dead ends: 28968 [2019-12-18 17:20:38,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:20:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-18 17:20:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-18 17:20:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-18 17:20:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-18 17:20:39,259 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-18 17:20:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:39,260 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-18 17:20:39,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:20:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-18 17:20:39,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:20:39,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:39,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:39,278 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:39,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:39,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-18 17:20:39,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:39,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852912824] [2019-12-18 17:20:39,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:39,460 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 17:20:39,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852912824] [2019-12-18 17:20:39,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:39,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:20:39,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570726407] [2019-12-18 17:20:39,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:20:39,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:39,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:20:39,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:20:39,462 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-18 17:20:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:40,755 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-18 17:20:40,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:20:40,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 17:20:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:40,810 INFO L225 Difference]: With dead ends: 38372 [2019-12-18 17:20:40,811 INFO L226 Difference]: Without dead ends: 38372 [2019-12-18 17:20:40,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:20:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-18 17:20:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-18 17:20:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-18 17:20:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-18 17:20:41,238 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-18 17:20:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:41,239 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-18 17:20:41,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:20:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-18 17:20:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:20:41,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:41,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:41,259 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:41,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:41,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-18 17:20:41,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:41,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466497961] [2019-12-18 17:20:41,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:41,450 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 17:20:41,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466497961] [2019-12-18 17:20:41,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:41,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:20:41,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184653468] [2019-12-18 17:20:41,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:20:41,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:41,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:20:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:20:41,454 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-18 17:20:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:43,545 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-18 17:20:43,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 17:20:43,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 17:20:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:43,608 INFO L225 Difference]: With dead ends: 45317 [2019-12-18 17:20:43,608 INFO L226 Difference]: Without dead ends: 45317 [2019-12-18 17:20:43,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:20:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-18 17:20:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-18 17:20:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-18 17:20:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-18 17:20:44,090 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-18 17:20:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:44,091 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-18 17:20:44,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:20:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-18 17:20:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:20:44,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:44,109 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] [2019-12-18 17:20:44,109 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-18 17:20:44,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:44,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170224327] [2019-12-18 17:20:44,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:44,284 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 17:20:44,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170224327] [2019-12-18 17:20:44,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:44,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:20:44,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382506072] [2019-12-18 17:20:44,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:20:44,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:44,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:20:44,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:20:44,289 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-18 17:20:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:45,704 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-18 17:20:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:20:45,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 17:20:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:45,750 INFO L225 Difference]: With dead ends: 34977 [2019-12-18 17:20:45,750 INFO L226 Difference]: Without dead ends: 34977 [2019-12-18 17:20:45,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:20:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-18 17:20:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-18 17:20:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-18 17:20:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-18 17:20:46,342 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-18 17:20:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:46,342 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-18 17:20:46,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:20:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-18 17:20:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:20:46,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:46,362 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] [2019-12-18 17:20:46,362 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:46,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:46,363 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-18 17:20:46,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:46,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594013852] [2019-12-18 17:20:46,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:46,535 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 17:20:46,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594013852] [2019-12-18 17:20:46,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:46,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:20:46,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851717250] [2019-12-18 17:20:46,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:20:46,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:46,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:20:46,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:20:46,538 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 8 states. [2019-12-18 17:20:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:47,975 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-18 17:20:47,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:20:47,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 17:20:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:48,041 INFO L225 Difference]: With dead ends: 43257 [2019-12-18 17:20:48,041 INFO L226 Difference]: Without dead ends: 43257 [2019-12-18 17:20:48,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:20:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-18 17:20:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-18 17:20:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-18 17:20:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-18 17:20:48,489 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-18 17:20:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:48,490 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-18 17:20:48,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:20:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-18 17:20:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:20:48,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:48,506 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] [2019-12-18 17:20:48,506 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:48,506 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-18 17:20:48,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:48,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791871404] [2019-12-18 17:20:48,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:48,738 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 17:20:48,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791871404] [2019-12-18 17:20:48,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:48,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:20:48,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56502910] [2019-12-18 17:20:48,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:20:48,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:48,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:20:48,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:20:48,741 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 9 states. [2019-12-18 17:20:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:50,957 INFO L93 Difference]: Finished difference Result 38272 states and 111540 transitions. [2019-12-18 17:20:50,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:20:50,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 17:20:50,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:51,045 INFO L225 Difference]: With dead ends: 38272 [2019-12-18 17:20:51,046 INFO L226 Difference]: Without dead ends: 38272 [2019-12-18 17:20:51,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:20:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38272 states. [2019-12-18 17:20:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38272 to 17513. [2019-12-18 17:20:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17513 states. [2019-12-18 17:20:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17513 states to 17513 states and 52269 transitions. [2019-12-18 17:20:51,532 INFO L78 Accepts]: Start accepts. Automaton has 17513 states and 52269 transitions. Word has length 34 [2019-12-18 17:20:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:51,532 INFO L462 AbstractCegarLoop]: Abstraction has 17513 states and 52269 transitions. [2019-12-18 17:20:51,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:20:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 17513 states and 52269 transitions. [2019-12-18 17:20:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:20:51,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:51,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:51,556 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:51,556 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-18 17:20:51,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:51,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260645835] [2019-12-18 17:20:51,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:51,611 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 17:20:51,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260645835] [2019-12-18 17:20:51,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:51,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:20:51,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467430348] [2019-12-18 17:20:51,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:20:51,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:51,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:20:51,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:20:51,614 INFO L87 Difference]: Start difference. First operand 17513 states and 52269 transitions. Second operand 3 states. [2019-12-18 17:20:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:51,684 INFO L93 Difference]: Finished difference Result 17512 states and 52267 transitions. [2019-12-18 17:20:51,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:20:51,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 17:20:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:51,719 INFO L225 Difference]: With dead ends: 17512 [2019-12-18 17:20:51,719 INFO L226 Difference]: Without dead ends: 17512 [2019-12-18 17:20:51,719 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 17:20:51,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17512 states. [2019-12-18 17:20:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17512 to 17512. [2019-12-18 17:20:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17512 states. [2019-12-18 17:20:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17512 states to 17512 states and 52267 transitions. [2019-12-18 17:20:51,992 INFO L78 Accepts]: Start accepts. Automaton has 17512 states and 52267 transitions. Word has length 39 [2019-12-18 17:20:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:51,993 INFO L462 AbstractCegarLoop]: Abstraction has 17512 states and 52267 transitions. [2019-12-18 17:20:51,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:20:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 17512 states and 52267 transitions. [2019-12-18 17:20:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:20:52,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:52,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:52,017 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:52,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:52,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-18 17:20:52,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:52,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544840115] [2019-12-18 17:20:52,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:52,065 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 17:20:52,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544840115] [2019-12-18 17:20:52,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:52,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:20:52,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292732864] [2019-12-18 17:20:52,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:20:52,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:52,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:20:52,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:20:52,066 INFO L87 Difference]: Start difference. First operand 17512 states and 52267 transitions. Second operand 5 states. [2019-12-18 17:20:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:52,143 INFO L93 Difference]: Finished difference Result 16301 states and 49521 transitions. [2019-12-18 17:20:52,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:20:52,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:20:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:52,172 INFO L225 Difference]: With dead ends: 16301 [2019-12-18 17:20:52,172 INFO L226 Difference]: Without dead ends: 16301 [2019-12-18 17:20:52,172 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 17:20:52,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16301 states. [2019-12-18 17:20:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16301 to 15517. [2019-12-18 17:20:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15517 states. [2019-12-18 17:20:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15517 states to 15517 states and 47407 transitions. [2019-12-18 17:20:52,514 INFO L78 Accepts]: Start accepts. Automaton has 15517 states and 47407 transitions. Word has length 40 [2019-12-18 17:20:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:52,515 INFO L462 AbstractCegarLoop]: Abstraction has 15517 states and 47407 transitions. [2019-12-18 17:20:52,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:20:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 15517 states and 47407 transitions. [2019-12-18 17:20:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:20:52,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:52,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:52,531 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:52,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1274465795, now seen corresponding path program 1 times [2019-12-18 17:20:52,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:52,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503336316] [2019-12-18 17:20:52,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:52,660 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 17:20:52,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503336316] [2019-12-18 17:20:52,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:52,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:20:52,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379211734] [2019-12-18 17:20:52,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:20:52,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:52,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:20:52,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:20:52,662 INFO L87 Difference]: Start difference. First operand 15517 states and 47407 transitions. Second operand 9 states. [2019-12-18 17:20:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:54,217 INFO L93 Difference]: Finished difference Result 85582 states and 256986 transitions. [2019-12-18 17:20:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 17:20:54,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 17:20:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:54,328 INFO L225 Difference]: With dead ends: 85582 [2019-12-18 17:20:54,328 INFO L226 Difference]: Without dead ends: 77550 [2019-12-18 17:20:54,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 17:20:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77550 states. [2019-12-18 17:20:54,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77550 to 16852. [2019-12-18 17:20:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16852 states. [2019-12-18 17:20:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16852 states to 16852 states and 51797 transitions. [2019-12-18 17:20:54,978 INFO L78 Accepts]: Start accepts. Automaton has 16852 states and 51797 transitions. Word has length 64 [2019-12-18 17:20:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:54,979 INFO L462 AbstractCegarLoop]: Abstraction has 16852 states and 51797 transitions. [2019-12-18 17:20:54,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:20:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 16852 states and 51797 transitions. [2019-12-18 17:20:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:20:54,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:54,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:54,996 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:54,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash 977977381, now seen corresponding path program 2 times [2019-12-18 17:20:54,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:54,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022415041] [2019-12-18 17:20:54,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:55,126 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 17:20:55,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022415041] [2019-12-18 17:20:55,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:55,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:20:55,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994470178] [2019-12-18 17:20:55,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:20:55,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:55,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:20:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:20:55,128 INFO L87 Difference]: Start difference. First operand 16852 states and 51797 transitions. Second operand 9 states. [2019-12-18 17:20:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:56,835 INFO L93 Difference]: Finished difference Result 98752 states and 294963 transitions. [2019-12-18 17:20:56,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 17:20:56,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 17:20:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:56,929 INFO L225 Difference]: With dead ends: 98752 [2019-12-18 17:20:56,930 INFO L226 Difference]: Without dead ends: 67988 [2019-12-18 17:20:56,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 17:20:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67988 states. [2019-12-18 17:20:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67988 to 18734. [2019-12-18 17:20:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18734 states. [2019-12-18 17:20:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18734 states to 18734 states and 57660 transitions. [2019-12-18 17:20:57,781 INFO L78 Accepts]: Start accepts. Automaton has 18734 states and 57660 transitions. Word has length 64 [2019-12-18 17:20:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:57,781 INFO L462 AbstractCegarLoop]: Abstraction has 18734 states and 57660 transitions. [2019-12-18 17:20:57,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:20:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 18734 states and 57660 transitions. [2019-12-18 17:20:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:20:57,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:57,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:57,800 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2145716829, now seen corresponding path program 3 times [2019-12-18 17:20:57,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:57,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404295320] [2019-12-18 17:20:57,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:57,877 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 17:20:57,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404295320] [2019-12-18 17:20:57,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:57,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:20:57,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748042938] [2019-12-18 17:20:57,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:20:57,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:20:57,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:20:57,879 INFO L87 Difference]: Start difference. First operand 18734 states and 57660 transitions. Second operand 7 states. [2019-12-18 17:20:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:58,472 INFO L93 Difference]: Finished difference Result 49627 states and 150323 transitions. [2019-12-18 17:20:58,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:20:58,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:20:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:58,553 INFO L225 Difference]: With dead ends: 49627 [2019-12-18 17:20:58,553 INFO L226 Difference]: Without dead ends: 38205 [2019-12-18 17:20:58,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:20:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38205 states. [2019-12-18 17:20:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38205 to 22755. [2019-12-18 17:20:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22755 states. [2019-12-18 17:20:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22755 states to 22755 states and 70086 transitions. [2019-12-18 17:20:59,058 INFO L78 Accepts]: Start accepts. Automaton has 22755 states and 70086 transitions. Word has length 64 [2019-12-18 17:20:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:59,058 INFO L462 AbstractCegarLoop]: Abstraction has 22755 states and 70086 transitions. [2019-12-18 17:20:59,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:20:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 22755 states and 70086 transitions. [2019-12-18 17:20:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:20:59,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:59,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:59,087 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:59,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:59,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1938623561, now seen corresponding path program 4 times [2019-12-18 17:20:59,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:59,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006128412] [2019-12-18 17:20:59,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:59,187 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 17:20:59,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006128412] [2019-12-18 17:20:59,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:59,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:20:59,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773326624] [2019-12-18 17:20:59,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:20:59,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:59,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:20:59,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:20:59,189 INFO L87 Difference]: Start difference. First operand 22755 states and 70086 transitions. Second operand 7 states. [2019-12-18 17:20:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:59,778 INFO L93 Difference]: Finished difference Result 47785 states and 143334 transitions. [2019-12-18 17:20:59,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:20:59,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:20:59,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:59,879 INFO L225 Difference]: With dead ends: 47785 [2019-12-18 17:20:59,879 INFO L226 Difference]: Without dead ends: 40903 [2019-12-18 17:20:59,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:21:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40903 states. [2019-12-18 17:21:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40903 to 23051. [2019-12-18 17:21:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23051 states. [2019-12-18 17:21:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23051 states to 23051 states and 70938 transitions. [2019-12-18 17:21:00,773 INFO L78 Accepts]: Start accepts. Automaton has 23051 states and 70938 transitions. Word has length 64 [2019-12-18 17:21:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:00,773 INFO L462 AbstractCegarLoop]: Abstraction has 23051 states and 70938 transitions. [2019-12-18 17:21:00,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:21:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 23051 states and 70938 transitions. [2019-12-18 17:21:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:21:00,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:00,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:21:00,807 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:00,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 987860387, now seen corresponding path program 5 times [2019-12-18 17:21:00,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:00,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393480995] [2019-12-18 17:21:00,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:00,881 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 17:21:00,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393480995] [2019-12-18 17:21:00,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:00,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:21:00,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221033925] [2019-12-18 17:21:00,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:21:00,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:21:00,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:21:00,883 INFO L87 Difference]: Start difference. First operand 23051 states and 70938 transitions. Second operand 3 states. [2019-12-18 17:21:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:00,950 INFO L93 Difference]: Finished difference Result 20176 states and 60955 transitions. [2019-12-18 17:21:00,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:21:00,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:21:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:00,979 INFO L225 Difference]: With dead ends: 20176 [2019-12-18 17:21:00,979 INFO L226 Difference]: Without dead ends: 20176 [2019-12-18 17:21:00,980 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 17:21:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20176 states. [2019-12-18 17:21:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20176 to 19286. [2019-12-18 17:21:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19286 states. [2019-12-18 17:21:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19286 states to 19286 states and 58189 transitions. [2019-12-18 17:21:01,281 INFO L78 Accepts]: Start accepts. Automaton has 19286 states and 58189 transitions. Word has length 64 [2019-12-18 17:21:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:01,282 INFO L462 AbstractCegarLoop]: Abstraction has 19286 states and 58189 transitions. [2019-12-18 17:21:01,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:21:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 19286 states and 58189 transitions. [2019-12-18 17:21:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:21:01,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:01,302 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 17:21:01,303 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:01,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash 995250140, now seen corresponding path program 1 times [2019-12-18 17:21:01,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:01,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92684809] [2019-12-18 17:21:01,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:01,367 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 17:21:01,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92684809] [2019-12-18 17:21:01,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:01,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:21:01,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922520314] [2019-12-18 17:21:01,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:21:01,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:21:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:21:01,369 INFO L87 Difference]: Start difference. First operand 19286 states and 58189 transitions. Second operand 5 states. [2019-12-18 17:21:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:01,728 INFO L93 Difference]: Finished difference Result 21087 states and 63168 transitions. [2019-12-18 17:21:01,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:21:01,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 17:21:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:01,758 INFO L225 Difference]: With dead ends: 21087 [2019-12-18 17:21:01,759 INFO L226 Difference]: Without dead ends: 21087 [2019-12-18 17:21:01,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:21:01,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21087 states. [2019-12-18 17:21:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21087 to 19568. [2019-12-18 17:21:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19568 states. [2019-12-18 17:21:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19568 states to 19568 states and 59029 transitions. [2019-12-18 17:21:02,060 INFO L78 Accepts]: Start accepts. Automaton has 19568 states and 59029 transitions. Word has length 65 [2019-12-18 17:21:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:02,060 INFO L462 AbstractCegarLoop]: Abstraction has 19568 states and 59029 transitions. [2019-12-18 17:21:02,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:21:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 19568 states and 59029 transitions. [2019-12-18 17:21:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:21:02,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:02,081 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 17:21:02,081 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:02,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1346443158, now seen corresponding path program 2 times [2019-12-18 17:21:02,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:02,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738855471] [2019-12-18 17:21:02,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:02,167 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 17:21:02,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738855471] [2019-12-18 17:21:02,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:02,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:21:02,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012125640] [2019-12-18 17:21:02,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:21:02,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:02,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:21:02,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:21:02,169 INFO L87 Difference]: Start difference. First operand 19568 states and 59029 transitions. Second operand 6 states. [2019-12-18 17:21:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:02,893 INFO L93 Difference]: Finished difference Result 35357 states and 104371 transitions. [2019-12-18 17:21:02,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:21:02,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 17:21:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:03,124 INFO L225 Difference]: With dead ends: 35357 [2019-12-18 17:21:03,124 INFO L226 Difference]: Without dead ends: 35137 [2019-12-18 17:21:03,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:21:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35137 states. [2019-12-18 17:21:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35137 to 26487. [2019-12-18 17:21:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26487 states. [2019-12-18 17:21:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26487 states to 26487 states and 79368 transitions. [2019-12-18 17:21:03,601 INFO L78 Accepts]: Start accepts. Automaton has 26487 states and 79368 transitions. Word has length 65 [2019-12-18 17:21:03,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:03,601 INFO L462 AbstractCegarLoop]: Abstraction has 26487 states and 79368 transitions. [2019-12-18 17:21:03,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:21:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 26487 states and 79368 transitions. [2019-12-18 17:21:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:21:03,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:03,627 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 17:21:03,627 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash 580016848, now seen corresponding path program 3 times [2019-12-18 17:21:03,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:03,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459851120] [2019-12-18 17:21:03,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:03,710 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 17:21:03,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459851120] [2019-12-18 17:21:03,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:03,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:21:03,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733229244] [2019-12-18 17:21:03,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:21:03,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:03,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:21:03,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:21:03,712 INFO L87 Difference]: Start difference. First operand 26487 states and 79368 transitions. Second operand 6 states. [2019-12-18 17:21:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:04,146 INFO L93 Difference]: Finished difference Result 28610 states and 85121 transitions. [2019-12-18 17:21:04,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:21:04,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 17:21:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:04,186 INFO L225 Difference]: With dead ends: 28610 [2019-12-18 17:21:04,186 INFO L226 Difference]: Without dead ends: 28610 [2019-12-18 17:21:04,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 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 17:21:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28610 states. [2019-12-18 17:21:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28610 to 26836. [2019-12-18 17:21:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26836 states. [2019-12-18 17:21:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26836 states to 26836 states and 80356 transitions. [2019-12-18 17:21:04,591 INFO L78 Accepts]: Start accepts. Automaton has 26836 states and 80356 transitions. Word has length 65 [2019-12-18 17:21:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:04,592 INFO L462 AbstractCegarLoop]: Abstraction has 26836 states and 80356 transitions. [2019-12-18 17:21:04,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:21:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 26836 states and 80356 transitions. [2019-12-18 17:21:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:21:04,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:04,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, 1, 1, 1, 1, 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 17:21:04,623 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash -102998324, now seen corresponding path program 4 times [2019-12-18 17:21:04,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:04,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742708619] [2019-12-18 17:21:04,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:04,726 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 17:21:04,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742708619] [2019-12-18 17:21:04,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:04,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:21:04,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193241389] [2019-12-18 17:21:04,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:21:04,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:04,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:21:04,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:21:04,729 INFO L87 Difference]: Start difference. First operand 26836 states and 80356 transitions. Second operand 7 states. [2019-12-18 17:21:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:05,561 INFO L93 Difference]: Finished difference Result 36374 states and 107098 transitions. [2019-12-18 17:21:05,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:21:05,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 17:21:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:05,613 INFO L225 Difference]: With dead ends: 36374 [2019-12-18 17:21:05,613 INFO L226 Difference]: Without dead ends: 36374 [2019-12-18 17:21:05,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:21:05,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36374 states. [2019-12-18 17:21:06,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36374 to 26290. [2019-12-18 17:21:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26290 states. [2019-12-18 17:21:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26290 states to 26290 states and 78809 transitions. [2019-12-18 17:21:06,330 INFO L78 Accepts]: Start accepts. Automaton has 26290 states and 78809 transitions. Word has length 65 [2019-12-18 17:21:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:06,330 INFO L462 AbstractCegarLoop]: Abstraction has 26290 states and 78809 transitions. [2019-12-18 17:21:06,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:21:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 26290 states and 78809 transitions. [2019-12-18 17:21:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:21:06,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:06,361 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 17:21:06,361 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:06,361 INFO L82 PathProgramCache]: Analyzing trace with hash 406391726, now seen corresponding path program 5 times [2019-12-18 17:21:06,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:06,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909614647] [2019-12-18 17:21:06,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:06,463 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 17:21:06,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909614647] [2019-12-18 17:21:06,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:06,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:21:06,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633537676] [2019-12-18 17:21:06,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:21:06,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:06,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:21:06,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:21:06,466 INFO L87 Difference]: Start difference. First operand 26290 states and 78809 transitions. Second operand 7 states. [2019-12-18 17:21:07,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:07,202 INFO L93 Difference]: Finished difference Result 48037 states and 141632 transitions. [2019-12-18 17:21:07,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:21:07,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 17:21:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:07,265 INFO L225 Difference]: With dead ends: 48037 [2019-12-18 17:21:07,265 INFO L226 Difference]: Without dead ends: 48037 [2019-12-18 17:21:07,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:21:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48037 states. [2019-12-18 17:21:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48037 to 26632. [2019-12-18 17:21:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2019-12-18 17:21:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 79917 transitions. [2019-12-18 17:21:07,829 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 79917 transitions. Word has length 65 [2019-12-18 17:21:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:07,829 INFO L462 AbstractCegarLoop]: Abstraction has 26632 states and 79917 transitions. [2019-12-18 17:21:07,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:21:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 79917 transitions. [2019-12-18 17:21:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:21:07,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:07,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:21:07,859 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:07,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1972220962, now seen corresponding path program 6 times [2019-12-18 17:21:07,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:07,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005073439] [2019-12-18 17:21:07,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:21:08,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005073439] [2019-12-18 17:21:08,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:08,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:21:08,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556869893] [2019-12-18 17:21:08,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:21:08,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:08,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:21:08,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:21:08,059 INFO L87 Difference]: Start difference. First operand 26632 states and 79917 transitions. Second operand 10 states. [2019-12-18 17:21:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:10,975 INFO L93 Difference]: Finished difference Result 46227 states and 136372 transitions. [2019-12-18 17:21:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:21:10,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 17:21:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:11,039 INFO L225 Difference]: With dead ends: 46227 [2019-12-18 17:21:11,039 INFO L226 Difference]: Without dead ends: 46059 [2019-12-18 17:21:11,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:21:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46059 states. [2019-12-18 17:21:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46059 to 28383. [2019-12-18 17:21:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28383 states. [2019-12-18 17:21:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28383 states to 28383 states and 84880 transitions. [2019-12-18 17:21:11,597 INFO L78 Accepts]: Start accepts. Automaton has 28383 states and 84880 transitions. Word has length 65 [2019-12-18 17:21:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:11,597 INFO L462 AbstractCegarLoop]: Abstraction has 28383 states and 84880 transitions. [2019-12-18 17:21:11,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:21:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 28383 states and 84880 transitions. [2019-12-18 17:21:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:21:11,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:11,627 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 17:21:11,627 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:11,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:11,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1532167548, now seen corresponding path program 7 times [2019-12-18 17:21:11,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:11,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990258367] [2019-12-18 17:21:11,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:11,686 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 17:21:11,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990258367] [2019-12-18 17:21:11,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:11,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:21:11,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631649058] [2019-12-18 17:21:11,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:21:11,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:11,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:21:11,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:21:11,688 INFO L87 Difference]: Start difference. First operand 28383 states and 84880 transitions. Second operand 3 states. [2019-12-18 17:21:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:11,796 INFO L93 Difference]: Finished difference Result 28383 states and 84879 transitions. [2019-12-18 17:21:11,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:21:11,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:21:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:11,835 INFO L225 Difference]: With dead ends: 28383 [2019-12-18 17:21:11,835 INFO L226 Difference]: Without dead ends: 28383 [2019-12-18 17:21:11,835 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 17:21:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28383 states. [2019-12-18 17:21:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28383 to 23040. [2019-12-18 17:21:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23040 states. [2019-12-18 17:21:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23040 states to 23040 states and 69435 transitions. [2019-12-18 17:21:12,224 INFO L78 Accepts]: Start accepts. Automaton has 23040 states and 69435 transitions. Word has length 65 [2019-12-18 17:21:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:12,224 INFO L462 AbstractCegarLoop]: Abstraction has 23040 states and 69435 transitions. [2019-12-18 17:21:12,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:21:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 23040 states and 69435 transitions. [2019-12-18 17:21:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:21:12,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:12,246 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 17:21:12,246 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:12,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:12,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1861098665, now seen corresponding path program 1 times [2019-12-18 17:21:12,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:12,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510504837] [2019-12-18 17:21:12,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:12,355 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 17:21:12,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510504837] [2019-12-18 17:21:12,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:12,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:21:12,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437892171] [2019-12-18 17:21:12,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:21:12,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:12,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:21:12,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:21:12,357 INFO L87 Difference]: Start difference. First operand 23040 states and 69435 transitions. Second operand 4 states. [2019-12-18 17:21:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:12,519 INFO L93 Difference]: Finished difference Result 26416 states and 79781 transitions. [2019-12-18 17:21:12,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:21:12,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 17:21:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:12,581 INFO L225 Difference]: With dead ends: 26416 [2019-12-18 17:21:12,581 INFO L226 Difference]: Without dead ends: 26416 [2019-12-18 17:21:12,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 17:21:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26416 states. [2019-12-18 17:21:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26416 to 22217. [2019-12-18 17:21:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22217 states. [2019-12-18 17:21:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22217 states to 22217 states and 67472 transitions. [2019-12-18 17:21:13,321 INFO L78 Accepts]: Start accepts. Automaton has 22217 states and 67472 transitions. Word has length 66 [2019-12-18 17:21:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:13,322 INFO L462 AbstractCegarLoop]: Abstraction has 22217 states and 67472 transitions. [2019-12-18 17:21:13,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:21:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 22217 states and 67472 transitions. [2019-12-18 17:21:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:21:13,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:13,345 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 17:21:13,345 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash -586454608, now seen corresponding path program 1 times [2019-12-18 17:21:13,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:13,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576964623] [2019-12-18 17:21:13,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:13,401 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 17:21:13,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576964623] [2019-12-18 17:21:13,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:13,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:21:13,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548844830] [2019-12-18 17:21:13,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:21:13,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:13,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:21:13,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:21:13,403 INFO L87 Difference]: Start difference. First operand 22217 states and 67472 transitions. Second operand 3 states. [2019-12-18 17:21:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:13,684 INFO L93 Difference]: Finished difference Result 29419 states and 89355 transitions. [2019-12-18 17:21:13,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:21:13,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 17:21:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:13,754 INFO L225 Difference]: With dead ends: 29419 [2019-12-18 17:21:13,754 INFO L226 Difference]: Without dead ends: 29419 [2019-12-18 17:21:13,755 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 17:21:13,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29419 states. [2019-12-18 17:21:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29419 to 22666. [2019-12-18 17:21:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22666 states. [2019-12-18 17:21:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22666 states to 22666 states and 68951 transitions. [2019-12-18 17:21:14,366 INFO L78 Accepts]: Start accepts. Automaton has 22666 states and 68951 transitions. Word has length 67 [2019-12-18 17:21:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:14,366 INFO L462 AbstractCegarLoop]: Abstraction has 22666 states and 68951 transitions. [2019-12-18 17:21:14,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:21:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 22666 states and 68951 transitions. [2019-12-18 17:21:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:21:14,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:14,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:21:14,393 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:14,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:14,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1786041058, now seen corresponding path program 1 times [2019-12-18 17:21:14,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:14,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183406875] [2019-12-18 17:21:14,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:14,501 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 17:21:14,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183406875] [2019-12-18 17:21:14,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:14,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:21:14,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310546449] [2019-12-18 17:21:14,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:21:14,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:14,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:21:14,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:21:14,503 INFO L87 Difference]: Start difference. First operand 22666 states and 68951 transitions. Second operand 9 states. [2019-12-18 17:21:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:15,914 INFO L93 Difference]: Finished difference Result 73689 states and 218297 transitions. [2019-12-18 17:21:15,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:21:15,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 17:21:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:16,005 INFO L225 Difference]: With dead ends: 73689 [2019-12-18 17:21:16,006 INFO L226 Difference]: Without dead ends: 65878 [2019-12-18 17:21:16,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:21:16,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65878 states. [2019-12-18 17:21:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65878 to 23398. [2019-12-18 17:21:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23398 states. [2019-12-18 17:21:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23398 states to 23398 states and 70962 transitions. [2019-12-18 17:21:16,644 INFO L78 Accepts]: Start accepts. Automaton has 23398 states and 70962 transitions. Word has length 67 [2019-12-18 17:21:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:16,644 INFO L462 AbstractCegarLoop]: Abstraction has 23398 states and 70962 transitions. [2019-12-18 17:21:16,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:21:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 23398 states and 70962 transitions. [2019-12-18 17:21:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:21:16,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:16,667 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 17:21:16,667 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:16,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:16,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1769776424, now seen corresponding path program 2 times [2019-12-18 17:21:16,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:16,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496395389] [2019-12-18 17:21:16,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:16,789 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 17:21:16,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496395389] [2019-12-18 17:21:16,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:16,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:21:16,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489546171] [2019-12-18 17:21:16,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:21:16,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:16,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:21:16,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:21:16,791 INFO L87 Difference]: Start difference. First operand 23398 states and 70962 transitions. Second operand 9 states. [2019-12-18 17:21:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:18,049 INFO L93 Difference]: Finished difference Result 61584 states and 182614 transitions. [2019-12-18 17:21:18,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:21:18,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 17:21:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:18,128 INFO L225 Difference]: With dead ends: 61584 [2019-12-18 17:21:18,128 INFO L226 Difference]: Without dead ends: 58888 [2019-12-18 17:21:18,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:21:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58888 states. [2019-12-18 17:21:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58888 to 22038. [2019-12-18 17:21:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22038 states. [2019-12-18 17:21:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22038 states to 22038 states and 66763 transitions. [2019-12-18 17:21:18,687 INFO L78 Accepts]: Start accepts. Automaton has 22038 states and 66763 transitions. Word has length 67 [2019-12-18 17:21:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:18,688 INFO L462 AbstractCegarLoop]: Abstraction has 22038 states and 66763 transitions. [2019-12-18 17:21:18,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:21:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 22038 states and 66763 transitions. [2019-12-18 17:21:18,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:21:18,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:18,713 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 17:21:18,713 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash 176666880, now seen corresponding path program 3 times [2019-12-18 17:21:18,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:18,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202876629] [2019-12-18 17:21:18,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:18,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 17:21:18,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202876629] [2019-12-18 17:21:18,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:18,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:21:18,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940463345] [2019-12-18 17:21:18,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:21:18,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:18,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:21:18,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:21:18,928 INFO L87 Difference]: Start difference. First operand 22038 states and 66763 transitions. Second operand 10 states. [2019-12-18 17:21:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:20,910 INFO L93 Difference]: Finished difference Result 48110 states and 145463 transitions. [2019-12-18 17:21:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 17:21:20,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 17:21:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:20,987 INFO L225 Difference]: With dead ends: 48110 [2019-12-18 17:21:20,987 INFO L226 Difference]: Without dead ends: 48110 [2019-12-18 17:21:20,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=727, Unknown=0, NotChecked=0, Total=992 [2019-12-18 17:21:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48110 states. [2019-12-18 17:21:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48110 to 24556. [2019-12-18 17:21:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24556 states. [2019-12-18 17:21:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24556 states to 24556 states and 74994 transitions. [2019-12-18 17:21:21,764 INFO L78 Accepts]: Start accepts. Automaton has 24556 states and 74994 transitions. Word has length 67 [2019-12-18 17:21:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:21,764 INFO L462 AbstractCegarLoop]: Abstraction has 24556 states and 74994 transitions. [2019-12-18 17:21:21,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:21:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 24556 states and 74994 transitions. [2019-12-18 17:21:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:21:21,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:21,788 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 17:21:21,789 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1904730590, now seen corresponding path program 2 times [2019-12-18 17:21:21,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:21,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407230788] [2019-12-18 17:21:21,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:21:21,910 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 17:21:21,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407230788] [2019-12-18 17:21:21,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:21:21,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:21:21,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939740337] [2019-12-18 17:21:21,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:21:21,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:21:21,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:21:21,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:21:21,912 INFO L87 Difference]: Start difference. First operand 24556 states and 74994 transitions. Second operand 6 states. [2019-12-18 17:21:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:21:22,084 INFO L93 Difference]: Finished difference Result 24132 states and 73449 transitions. [2019-12-18 17:21:22,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:21:22,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 17:21:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:21:22,134 INFO L225 Difference]: With dead ends: 24132 [2019-12-18 17:21:22,134 INFO L226 Difference]: Without dead ends: 24132 [2019-12-18 17:21:22,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:21:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24132 states. [2019-12-18 17:21:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24132 to 19156. [2019-12-18 17:21:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19156 states. [2019-12-18 17:21:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19156 states to 19156 states and 57653 transitions. [2019-12-18 17:21:22,459 INFO L78 Accepts]: Start accepts. Automaton has 19156 states and 57653 transitions. Word has length 67 [2019-12-18 17:21:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:21:22,460 INFO L462 AbstractCegarLoop]: Abstraction has 19156 states and 57653 transitions. [2019-12-18 17:21:22,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:21:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 19156 states and 57653 transitions. [2019-12-18 17:21:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:21:22,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:21:22,478 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 17:21:22,478 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:21:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:21:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-18 17:21:22,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:21:22,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187144345] [2019-12-18 17:21:22,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:21:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:21:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:21:22,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:21:22,596 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:21:22,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~y~0_33 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1001~0.base_51|)) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1001~0.base_51| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1001~0.base_51|) |v_ULTIMATE.start_main_~#t1001~0.offset_32| 0))) (= v_~main$tmp_guard1~0_50 0) (= 0 v_~a$read_delayed_var~0.base_8) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1001~0.base_51|) (= v_~a$mem_tmp~0_19 0) (= v_~a$r_buff1_thd3~0_279 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= |v_#valid_87| (store .cse0 |v_ULTIMATE.start_main_~#t1001~0.base_51| 1)) (= v_~a$r_buff0_thd3~0_364 0) (= v_~z~0_14 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1001~0.base_51| 4)) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_15) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t1001~0.offset_32|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~a$w_buff1_used~0_506) (= v_~a$r_buff1_thd0~0_160 0) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= v_~a$flush_delayed~0_30 0) (= 0 v_~x~0_130) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~weak$$choice2~0_108 0) (= v_~a~0_163 0) (= v_~__unbuffered_p2_EBX~0_61 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_~#t1002~0.base=|v_ULTIMATE.start_main_~#t1002~0.base_39|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ULTIMATE.start_main_~#t1003~0.offset=|v_ULTIMATE.start_main_~#t1003~0.offset_20|, ~a~0=v_~a~0_163, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_130, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ULTIMATE.start_main_~#t1003~0.base=|v_ULTIMATE.start_main_~#t1003~0.base_28|, ~y~0=v_~y~0_33, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_~#t1001~0.base=|v_ULTIMATE.start_main_~#t1001~0.base_51|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t1002~0.offset=|v_ULTIMATE.start_main_~#t1002~0.offset_19|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t1001~0.offset=|v_ULTIMATE.start_main_~#t1001~0.offset_32|, ~a$flush_delayed~0=v_~a$flush_delayed~0_30, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_14, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t1002~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1003~0.offset, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1003~0.base, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1001~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1002~0.offset, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1001~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 17:21:22,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~x~0_Out-2137007554 1) (= ~a$r_buff1_thd2~0_Out-2137007554 ~a$r_buff0_thd2~0_In-2137007554) (= ~a$r_buff1_thd1~0_Out-2137007554 ~a$r_buff0_thd1~0_In-2137007554) (= ~a$r_buff0_thd3~0_In-2137007554 ~a$r_buff1_thd3~0_Out-2137007554) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2137007554)) (= ~a$r_buff0_thd0~0_In-2137007554 ~a$r_buff1_thd0~0_Out-2137007554) (= 1 ~a$r_buff0_thd1~0_Out-2137007554)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2137007554, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2137007554, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2137007554, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2137007554, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2137007554} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-2137007554, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-2137007554, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-2137007554, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-2137007554, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2137007554, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2137007554, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2137007554, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-2137007554, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2137007554, ~x~0=~x~0_Out-2137007554} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 17:21:22,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1002~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1002~0.base_9|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1002~0.base_9| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1002~0.base_9|) (= |v_ULTIMATE.start_main_~#t1002~0.offset_7| 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1002~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1002~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1002~0.base_9|) |v_ULTIMATE.start_main_~#t1002~0.offset_7| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1002~0.offset=|v_ULTIMATE.start_main_~#t1002~0.offset_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1002~0.base=|v_ULTIMATE.start_main_~#t1002~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1002~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1002~0.base] because there is no mapped edge [2019-12-18 17:21:22,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1003~0.base_9| 1) |v_#valid_32|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1003~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1003~0.base_9| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1003~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1003~0.base_9|) |v_ULTIMATE.start_main_~#t1003~0.offset_8| 2)) |v_#memory_int_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1003~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1003~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1003~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1003~0.offset=|v_ULTIMATE.start_main_~#t1003~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1003~0.base=|v_ULTIMATE.start_main_~#t1003~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1003~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1003~0.base, #length] because there is no mapped edge [2019-12-18 17:21:22,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In830053092 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In830053092 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out830053092| |P1Thread1of1ForFork2_#t~ite10_Out830053092|))) (or (and (or .cse0 .cse1) (= ~a~0_In830053092 |P1Thread1of1ForFork2_#t~ite9_Out830053092|) .cse2) (and (not .cse1) (not .cse0) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out830053092| ~a$w_buff1~0_In830053092)))) InVars {~a~0=~a~0_In830053092, ~a$w_buff1~0=~a$w_buff1~0_In830053092, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In830053092, ~a$w_buff1_used~0=~a$w_buff1_used~0_In830053092} OutVars{~a~0=~a~0_In830053092, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out830053092|, ~a$w_buff1~0=~a$w_buff1~0_In830053092, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In830053092, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out830053092|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In830053092} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 17:21:22,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-373543101 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-373543101 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-373543101| ~a$w_buff0_used~0_In-373543101) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-373543101| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-373543101, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-373543101} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-373543101, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-373543101, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-373543101|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 17:21:22,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-577802914 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-577802914 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-577802914 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-577802914 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-577802914 |P1Thread1of1ForFork2_#t~ite12_Out-577802914|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-577802914| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-577802914, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-577802914, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-577802914, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-577802914} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-577802914, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-577802914, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-577802914, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-577802914|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-577802914} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 17:21:22,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1561274319 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out1561274319| |P2Thread1of1ForFork0_#t~ite20_Out1561274319|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1561274319 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In1561274319 256)) .cse0) (= (mod ~a$w_buff0_used~0_In1561274319 256) 0) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In1561274319 256))))) (= ~a$w_buff0~0_In1561274319 |P2Thread1of1ForFork0_#t~ite20_Out1561274319|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite21_Out1561274319| ~a$w_buff0~0_In1561274319) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In1561274319| |P2Thread1of1ForFork0_#t~ite20_Out1561274319|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1561274319, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1561274319, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1561274319, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1561274319, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1561274319, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1561274319|, ~weak$$choice2~0=~weak$$choice2~0_In1561274319} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1561274319|, ~a$w_buff0~0=~a$w_buff0~0_In1561274319, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1561274319, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1561274319, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1561274319, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1561274319|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1561274319, ~weak$$choice2~0=~weak$$choice2~0_In1561274319} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 17:21:22,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1223852802 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1223852802 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In1223852802 |P1Thread1of1ForFork2_#t~ite13_Out1223852802|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1223852802|) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1223852802, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1223852802} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1223852802, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1223852802, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1223852802|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 17:21:22,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In1597900410 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1597900410 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1597900410 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1597900410 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In1597900410 |P1Thread1of1ForFork2_#t~ite14_Out1597900410|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1597900410|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1597900410, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1597900410, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1597900410, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1597900410} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1597900410, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1597900410, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1597900410, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1597900410, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1597900410|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 17:21:22,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 17:21:22,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-334866591 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-334866591| |P2Thread1of1ForFork0_#t~ite23_Out-334866591|) (= ~a$w_buff1~0_In-334866591 |P2Thread1of1ForFork0_#t~ite24_Out-334866591|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-334866591 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-334866591 256) 0) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-334866591 256))) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-334866591 256))))) (= |P2Thread1of1ForFork0_#t~ite23_Out-334866591| ~a$w_buff1~0_In-334866591) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-334866591| |P2Thread1of1ForFork0_#t~ite24_Out-334866591|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-334866591, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-334866591|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-334866591, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-334866591, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-334866591, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-334866591, ~weak$$choice2~0=~weak$$choice2~0_In-334866591} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-334866591, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-334866591|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-334866591|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-334866591, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-334866591, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-334866591, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-334866591, ~weak$$choice2~0=~weak$$choice2~0_In-334866591} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 17:21:22,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1948733812 256)))) (or (and (= ~a$w_buff0_used~0_In1948733812 |P2Thread1of1ForFork0_#t~ite26_Out1948733812|) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out1948733812| |P2Thread1of1ForFork0_#t~ite26_Out1948733812|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1948733812 256) 0))) (or (= (mod ~a$w_buff0_used~0_In1948733812 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In1948733812 256)) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In1948733812 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out1948733812| ~a$w_buff0_used~0_In1948733812) (= |P2Thread1of1ForFork0_#t~ite26_In1948733812| |P2Thread1of1ForFork0_#t~ite26_Out1948733812|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1948733812|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1948733812, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1948733812, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1948733812, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1948733812, ~weak$$choice2~0=~weak$$choice2~0_In1948733812} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1948733812|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1948733812|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1948733812, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1948733812, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1948733812, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1948733812, ~weak$$choice2~0=~weak$$choice2~0_In1948733812} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 17:21:22,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 17:21:22,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 17:21:22,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In1381560688 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1381560688 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1381560688| ~a$w_buff1~0_In1381560688)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1381560688| ~a~0_In1381560688)))) InVars {~a~0=~a~0_In1381560688, ~a$w_buff1~0=~a$w_buff1~0_In1381560688, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1381560688, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1381560688} OutVars{~a~0=~a~0_In1381560688, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1381560688|, ~a$w_buff1~0=~a$w_buff1~0_In1381560688, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1381560688, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1381560688} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 17:21:22,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 17:21:22,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-724733654 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-724733654 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-724733654|)) (and (= ~a$w_buff0_used~0_In-724733654 |P2Thread1of1ForFork0_#t~ite40_Out-724733654|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-724733654, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-724733654} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-724733654|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-724733654, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-724733654} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 17:21:22,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-81417828 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-81417828 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-81417828| 0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-81417828| ~a$w_buff0_used~0_In-81417828) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-81417828, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-81417828} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-81417828|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-81417828, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-81417828} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 17:21:22,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-382385601 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-382385601 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-382385601 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-382385601 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-382385601|)) (and (= ~a$w_buff1_used~0_In-382385601 |P0Thread1of1ForFork1_#t~ite6_Out-382385601|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-382385601, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-382385601, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-382385601, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-382385601} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-382385601|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-382385601, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-382385601, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-382385601, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-382385601} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 17:21:22,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-1770275605 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1770275605 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-1770275605)) (and (= ~a$r_buff0_thd1~0_In-1770275605 ~a$r_buff0_thd1~0_Out-1770275605) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1770275605, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1770275605} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1770275605|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1770275605, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1770275605} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:21:22,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In1897261251 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1897261251 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1897261251 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1897261251 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1897261251| ~a$r_buff1_thd1~0_In1897261251) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1897261251|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1897261251, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1897261251, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1897261251, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1897261251} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1897261251|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1897261251, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1897261251, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1897261251, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1897261251} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:21:22,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:21:22,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In1862791587 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1862791587 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1862791587 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1862791587 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1862791587|)) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In1862791587 |P2Thread1of1ForFork0_#t~ite41_Out1862791587|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1862791587, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1862791587, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1862791587, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1862791587} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1862791587, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1862791587, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1862791587, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1862791587, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1862791587|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 17:21:22,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-607156470 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-607156470 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-607156470|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-607156470| ~a$r_buff0_thd3~0_In-607156470)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-607156470, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-607156470} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-607156470, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-607156470, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-607156470|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 17:21:22,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In-762719611 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-762719611 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-762719611 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-762719611 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-762719611| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In-762719611 |P2Thread1of1ForFork0_#t~ite43_Out-762719611|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-762719611, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-762719611, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-762719611, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-762719611} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-762719611|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-762719611, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-762719611, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-762719611, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-762719611} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 17:21:22,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 17:21:22,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:21:22,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1145469428| |ULTIMATE.start_main_#t~ite47_Out-1145469428|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1145469428 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1145469428 256)))) (or (and (not .cse0) (not .cse1) .cse2 (= ~a$w_buff1~0_In-1145469428 |ULTIMATE.start_main_#t~ite47_Out-1145469428|)) (and .cse2 (or .cse0 .cse1) (= ~a~0_In-1145469428 |ULTIMATE.start_main_#t~ite47_Out-1145469428|)))) InVars {~a~0=~a~0_In-1145469428, ~a$w_buff1~0=~a$w_buff1~0_In-1145469428, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1145469428, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1145469428} OutVars{~a~0=~a~0_In-1145469428, ~a$w_buff1~0=~a$w_buff1~0_In-1145469428, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1145469428|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1145469428, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1145469428|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1145469428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 17:21:22,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1621011921 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1621011921 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1621011921 |ULTIMATE.start_main_#t~ite49_Out-1621011921|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1621011921|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1621011921, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1621011921} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1621011921, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1621011921|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1621011921} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 17:21:22,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In2544323 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In2544323 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2544323 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In2544323 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out2544323|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In2544323 |ULTIMATE.start_main_#t~ite50_Out2544323|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2544323, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2544323, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2544323, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2544323} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2544323|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2544323, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2544323, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2544323, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2544323} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 17:21:22,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1030693478 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1030693478 256)))) (or (and (= ~a$r_buff0_thd0~0_In-1030693478 |ULTIMATE.start_main_#t~ite51_Out-1030693478|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1030693478|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1030693478, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1030693478} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1030693478|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1030693478, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1030693478} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 17:21:22,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-915411785 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-915411785 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-915411785 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-915411785 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-915411785|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In-915411785 |ULTIMATE.start_main_#t~ite52_Out-915411785|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-915411785, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-915411785, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-915411785, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-915411785} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-915411785|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-915411785, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-915411785, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-915411785, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-915411785} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 17:21:22,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_77 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:21:22,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:21:22 BasicIcfg [2019-12-18 17:21:22,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:21:22,724 INFO L168 Benchmark]: Toolchain (without parser) took 106336.09 ms. Allocated memory was 140.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 17:21:22,724 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 17:21:22,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.22 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 99.5 MB in the beginning and 155.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:21:22,725 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.50 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:21:22,726 INFO L168 Benchmark]: Boogie Preprocessor took 71.94 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:21:22,726 INFO L168 Benchmark]: RCFGBuilder took 838.55 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 100.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:21:22,726 INFO L168 Benchmark]: TraceAbstraction took 104556.52 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 17:21:22,728 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.22 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 99.5 MB in the beginning and 155.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.50 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.94 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 838.55 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 100.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104556.52 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7286 VarBasedMoverChecksPositive, 247 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 104.2s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 38.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8518 SDtfs, 11958 SDslu, 24863 SDs, 0 SdLazy, 15150 SolverSat, 681 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 75 SyntacticMatches, 28 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 498464 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1689 NumberOfCodeBlocks, 1689 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1587 ConstructedInterpolants, 0 QuantifiedInterpolants, 375684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...