/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:55:18,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:55:18,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:55:18,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:55:18,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:55:18,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:55:18,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:55:18,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:55:18,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:55:18,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:55:18,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:55:18,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:55:18,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:55:18,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:55:18,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:55:18,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:55:18,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:55:18,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:55:18,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:55:18,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:55:18,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:55:18,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:55:18,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:55:18,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:55:18,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:55:18,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:55:18,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:55:18,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:55:18,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:55:18,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:55:18,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:55:18,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:55:18,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:55:18,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:55:18,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:55:18,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:55:18,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:55:18,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:55:18,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:55:18,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:55:18,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:55:18,271 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:55:18,302 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:55:18,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:55:18,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:55:18,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:55:18,312 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:55:18,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:55:18,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:55:18,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:55:18,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:55:18,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:55:18,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:55:18,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:55:18,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:55:18,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:55:18,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:55:18,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:55:18,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:55:18,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:55:18,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:55:18,318 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:55:18,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:55:18,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:55:18,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:55:18,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:55:18,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:55:18,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:55:18,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:55:18,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:55:18,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:55:18,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:55:18,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:55:18,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:55:18,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:55:18,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:55:18,601 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:55:18,602 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i [2019-12-18 12:55:18,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac135d37f/44b2ae1bd55a4c3f920edd8dd8d59d05/FLAG26e94b53d [2019-12-18 12:55:19,246 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:55:19,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i [2019-12-18 12:55:19,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac135d37f/44b2ae1bd55a4c3f920edd8dd8d59d05/FLAG26e94b53d [2019-12-18 12:55:19,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac135d37f/44b2ae1bd55a4c3f920edd8dd8d59d05 [2019-12-18 12:55:19,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:55:19,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:55:19,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:55:19,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:55:19,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:55:19,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:55:19" (1/1) ... [2019-12-18 12:55:19,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127092cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:19, skipping insertion in model container [2019-12-18 12:55:19,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:55:19" (1/1) ... [2019-12-18 12:55:19,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:55:19,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:55:20,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:55:20,161 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:55:20,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:55:20,332 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:55:20,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20 WrapperNode [2019-12-18 12:55:20,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:55:20,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:55:20,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:55:20,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:55:20,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (1/1) ... [2019-12-18 12:55:20,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (1/1) ... [2019-12-18 12:55:20,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:55:20,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:55:20,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:55:20,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:55:20,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (1/1) ... [2019-12-18 12:55:20,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (1/1) ... [2019-12-18 12:55:20,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (1/1) ... [2019-12-18 12:55:20,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (1/1) ... [2019-12-18 12:55:20,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (1/1) ... [2019-12-18 12:55:20,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (1/1) ... [2019-12-18 12:55:20,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (1/1) ... [2019-12-18 12:55:20,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:55:20,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:55:20,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:55:20,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:55:20,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (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 12:55:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:55:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:55:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:55:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:55:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:55:20,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:55:20,522 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:55:20,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:55:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:55:20,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:55:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:55:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:55:20,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:55:20,527 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 12:55:21,301 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:55:21,301 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:55:21,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:55:21 BoogieIcfgContainer [2019-12-18 12:55:21,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:55:21,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:55:21,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:55:21,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:55:21,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:55:19" (1/3) ... [2019-12-18 12:55:21,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b282c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:55:21, skipping insertion in model container [2019-12-18 12:55:21,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:20" (2/3) ... [2019-12-18 12:55:21,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b282c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:55:21, skipping insertion in model container [2019-12-18 12:55:21,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:55:21" (3/3) ... [2019-12-18 12:55:21,316 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc.i [2019-12-18 12:55:21,326 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:55:21,327 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:55:21,344 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:55:21,345 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:55:21,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,420 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,449 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,451 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,464 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,465 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:55:21,484 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:55:21,504 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:55:21,505 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:55:21,505 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:55:21,505 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:55:21,505 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:55:21,505 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:55:21,506 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:55:21,506 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:55:21,522 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 12:55:21,524 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:55:21,630 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:55:21,630 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:55:21,653 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:55:21,679 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:55:21,771 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:55:21,771 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:55:21,784 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:55:21,809 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:55:21,811 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:55:27,230 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 12:55:27,352 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:55:27,644 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-18 12:55:27,644 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 12:55:27,648 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-18 12:55:49,551 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-18 12:55:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-18 12:55:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:55:49,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:49,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:55:49,559 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 12:55:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-18 12:55:49,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:49,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700850385] [2019-12-18 12:55:49,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:49,784 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 12:55:49,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700850385] [2019-12-18 12:55:49,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:49,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:55:49,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661714496] [2019-12-18 12:55:49,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:49,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:49,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:49,804 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-18 12:55:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:53,556 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-18 12:55:53,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:53,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:55:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:54,147 INFO L225 Difference]: With dead ends: 121140 [2019-12-18 12:55:54,147 INFO L226 Difference]: Without dead ends: 107958 [2019-12-18 12:55:54,150 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 12:55:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-18 12:56:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-18 12:56:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-18 12:56:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-18 12:56:01,809 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-18 12:56:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:01,809 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-18 12:56:01,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-18 12:56:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:56:01,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:01,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:01,814 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 12:56:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-18 12:56:01,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:01,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127425583] [2019-12-18 12:56:01,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:01,918 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 12:56:01,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127425583] [2019-12-18 12:56:01,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:01,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:01,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911593686] [2019-12-18 12:56:01,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:01,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:01,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:01,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:01,923 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-18 12:56:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:07,233 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-18 12:56:07,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:07,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:56:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:07,986 INFO L225 Difference]: With dead ends: 172022 [2019-12-18 12:56:07,986 INFO L226 Difference]: Without dead ends: 171924 [2019-12-18 12:56:07,987 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 12:56:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-18 12:56:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-18 12:56:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-18 12:56:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-18 12:56:21,137 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-18 12:56:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:21,138 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-18 12:56:21,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-18 12:56:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:56:21,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:21,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:21,144 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 12:56:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-18 12:56:21,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:21,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478651310] [2019-12-18 12:56:21,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:21,220 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 12:56:21,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478651310] [2019-12-18 12:56:21,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:21,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:21,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937867092] [2019-12-18 12:56:21,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:21,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:21,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:21,223 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-18 12:56:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:21,350 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-18 12:56:21,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:21,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:56:21,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:26,027 INFO L225 Difference]: With dead ends: 33388 [2019-12-18 12:56:26,028 INFO L226 Difference]: Without dead ends: 33388 [2019-12-18 12:56:26,028 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 12:56:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-18 12:56:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-18 12:56:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-18 12:56:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-18 12:56:26,654 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-18 12:56:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:26,654 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-18 12:56:26,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-18 12:56:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:56:26,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:26,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:26,658 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 12:56:26,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:26,658 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-18 12:56:26,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:26,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434751213] [2019-12-18 12:56:26,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:26,743 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 12:56:26,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434751213] [2019-12-18 12:56:26,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:26,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:26,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24361312] [2019-12-18 12:56:26,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:26,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:26,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:26,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:26,746 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-18 12:56:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:26,963 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-18 12:56:26,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:26,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:56:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:27,065 INFO L225 Difference]: With dead ends: 52822 [2019-12-18 12:56:27,066 INFO L226 Difference]: Without dead ends: 52822 [2019-12-18 12:56:27,066 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 12:56:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-18 12:56:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-18 12:56:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-18 12:56:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-18 12:56:27,835 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-18 12:56:27,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:27,836 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-18 12:56:27,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-18 12:56:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:56:27,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:27,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:27,840 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 12:56:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-18 12:56:27,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:27,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041785312] [2019-12-18 12:56:27,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:27,916 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 12:56:27,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041785312] [2019-12-18 12:56:27,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:27,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:27,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346924979] [2019-12-18 12:56:27,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:27,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:27,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:27,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:27,918 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-18 12:56:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:28,331 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-18 12:56:28,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:28,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:56:28,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:28,404 INFO L225 Difference]: With dead ends: 46903 [2019-12-18 12:56:28,404 INFO L226 Difference]: Without dead ends: 46903 [2019-12-18 12:56:28,404 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 12:56:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-18 12:56:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-18 12:56:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 12:56:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-18 12:56:29,446 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-18 12:56:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:29,447 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-18 12:56:29,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-18 12:56:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:56:29,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:29,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:29,451 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 12:56:29,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-18 12:56:29,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:29,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471815953] [2019-12-18 12:56:29,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:29,520 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 12:56:29,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471815953] [2019-12-18 12:56:29,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:29,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:29,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057387537] [2019-12-18 12:56:29,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:29,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:29,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:29,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:29,523 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-18 12:56:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:29,865 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-18 12:56:29,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:29,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:56:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:29,947 INFO L225 Difference]: With dead ends: 51478 [2019-12-18 12:56:29,947 INFO L226 Difference]: Without dead ends: 51478 [2019-12-18 12:56:29,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 12:56:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-18 12:56:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-18 12:56:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-18 12:56:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-18 12:56:30,778 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-18 12:56:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:30,778 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-18 12:56:30,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-18 12:56:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:56:30,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:30,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] [2019-12-18 12:56:30,788 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 12:56:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-18 12:56:30,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:30,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420069421] [2019-12-18 12:56:30,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:30,873 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 12:56:30,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420069421] [2019-12-18 12:56:30,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:30,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:30,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641156143] [2019-12-18 12:56:30,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:56:30,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:56:30,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:30,877 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-18 12:56:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:31,814 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-18 12:56:31,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:56:31,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:56:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:31,911 INFO L225 Difference]: With dead ends: 61264 [2019-12-18 12:56:31,911 INFO L226 Difference]: Without dead ends: 61250 [2019-12-18 12:56:31,911 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 12:56:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-18 12:56:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-18 12:56:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-18 12:56:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-18 12:56:32,810 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-18 12:56:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:32,811 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-18 12:56:32,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:56:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-18 12:56:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:56:32,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:32,821 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 12:56:32,821 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 12:56:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:32,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-18 12:56:32,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:32,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387732584] [2019-12-18 12:56:32,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:32,887 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 12:56:32,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387732584] [2019-12-18 12:56:32,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:32,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:32,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862711867] [2019-12-18 12:56:32,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:56:32,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:32,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:56:32,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:32,889 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-18 12:56:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:33,498 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-18 12:56:33,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:56:33,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:56:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:33,605 INFO L225 Difference]: With dead ends: 63752 [2019-12-18 12:56:33,605 INFO L226 Difference]: Without dead ends: 63738 [2019-12-18 12:56:33,605 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 12:56:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-18 12:56:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-18 12:56:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-18 12:56:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-18 12:56:34,992 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-18 12:56:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:34,992 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-18 12:56:34,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:56:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-18 12:56:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:56:35,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:35,004 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 12:56:35,004 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 12:56:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-18 12:56:35,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:35,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947988551] [2019-12-18 12:56:35,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:35,053 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 12:56:35,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947988551] [2019-12-18 12:56:35,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:35,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:35,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340996230] [2019-12-18 12:56:35,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:35,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:35,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:35,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:35,055 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-18 12:56:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:35,134 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-18 12:56:35,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:56:35,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:56:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:35,165 INFO L225 Difference]: With dead ends: 17193 [2019-12-18 12:56:35,165 INFO L226 Difference]: Without dead ends: 17193 [2019-12-18 12:56:35,165 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 12:56:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-18 12:56:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-18 12:56:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-18 12:56:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-18 12:56:35,411 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-18 12:56:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:35,412 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-18 12:56:35,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-18 12:56:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:56:35,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:35,424 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] [2019-12-18 12:56:35,424 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 12:56:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-18 12:56:35,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:35,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682411110] [2019-12-18 12:56:35,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:35,483 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 12:56:35,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682411110] [2019-12-18 12:56:35,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:35,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:35,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385975809] [2019-12-18 12:56:35,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:56:35,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:35,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:56:35,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:35,485 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-18 12:56:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:35,812 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-18 12:56:35,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:56:35,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 12:56:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:35,842 INFO L225 Difference]: With dead ends: 21613 [2019-12-18 12:56:35,842 INFO L226 Difference]: Without dead ends: 21613 [2019-12-18 12:56:35,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-18 12:56:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-18 12:56:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-18 12:56:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-18 12:56:36,185 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-18 12:56:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:36,185 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-18 12:56:36,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:56:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-18 12:56:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:56:36,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:36,202 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 12:56:36,202 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 12:56:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-18 12:56:36,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:36,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167075665] [2019-12-18 12:56:36,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:36,291 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 12:56:36,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167075665] [2019-12-18 12:56:36,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:36,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:36,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017625642] [2019-12-18 12:56:36,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:56:36,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:36,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:56:36,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:36,293 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-18 12:56:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:36,669 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-18 12:56:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:56:36,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:56:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:36,709 INFO L225 Difference]: With dead ends: 23624 [2019-12-18 12:56:36,709 INFO L226 Difference]: Without dead ends: 23624 [2019-12-18 12:56:36,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-18 12:56:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-18 12:56:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-18 12:56:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-18 12:56:37,011 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-18 12:56:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:37,011 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-18 12:56:37,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:56:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-18 12:56:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:56:37,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:37,030 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] [2019-12-18 12:56:37,031 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 12:56:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:37,031 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-18 12:56:37,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:37,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44835294] [2019-12-18 12:56:37,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:37,122 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 12:56:37,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44835294] [2019-12-18 12:56:37,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:37,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:56:37,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000887968] [2019-12-18 12:56:37,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:56:37,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:37,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:56:37,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:56:37,124 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-18 12:56:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:37,827 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-18 12:56:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:56:37,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 12:56:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:37,866 INFO L225 Difference]: With dead ends: 27031 [2019-12-18 12:56:37,866 INFO L226 Difference]: Without dead ends: 27031 [2019-12-18 12:56:37,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:56:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-18 12:56:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-18 12:56:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-18 12:56:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-18 12:56:38,220 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-18 12:56:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:38,220 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-18 12:56:38,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:56:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-18 12:56:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:56:38,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:38,242 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 12:56:38,243 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 12:56:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-18 12:56:38,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:38,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023015479] [2019-12-18 12:56:38,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:38,583 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 12:56:38,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023015479] [2019-12-18 12:56:38,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:38,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:56:38,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869570095] [2019-12-18 12:56:38,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:38,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:38,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:38,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:38,585 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 7 states. [2019-12-18 12:56:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:39,415 INFO L93 Difference]: Finished difference Result 29297 states and 87381 transitions. [2019-12-18 12:56:39,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:56:39,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 12:56:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:39,473 INFO L225 Difference]: With dead ends: 29297 [2019-12-18 12:56:39,474 INFO L226 Difference]: Without dead ends: 29297 [2019-12-18 12:56:39,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:56:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29297 states. [2019-12-18 12:56:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29297 to 20970. [2019-12-18 12:56:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20970 states. [2019-12-18 12:56:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20970 states to 20970 states and 63763 transitions. [2019-12-18 12:56:39,852 INFO L78 Accepts]: Start accepts. Automaton has 20970 states and 63763 transitions. Word has length 34 [2019-12-18 12:56:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:39,853 INFO L462 AbstractCegarLoop]: Abstraction has 20970 states and 63763 transitions. [2019-12-18 12:56:39,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 20970 states and 63763 transitions. [2019-12-18 12:56:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 12:56:39,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:39,872 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] [2019-12-18 12:56:39,872 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 12:56:39,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:39,872 INFO L82 PathProgramCache]: Analyzing trace with hash -475634225, now seen corresponding path program 1 times [2019-12-18 12:56:39,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:39,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709313262] [2019-12-18 12:56:39,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:40,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709313262] [2019-12-18 12:56:40,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:40,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:56:40,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150548437] [2019-12-18 12:56:40,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:56:40,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:40,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:56:40,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:56:40,052 INFO L87 Difference]: Start difference. First operand 20970 states and 63763 transitions. Second operand 8 states. [2019-12-18 12:56:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:41,044 INFO L93 Difference]: Finished difference Result 28597 states and 85038 transitions. [2019-12-18 12:56:41,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:56:41,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-18 12:56:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:41,091 INFO L225 Difference]: With dead ends: 28597 [2019-12-18 12:56:41,091 INFO L226 Difference]: Without dead ends: 28597 [2019-12-18 12:56:41,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:56:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28597 states. [2019-12-18 12:56:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28597 to 18528. [2019-12-18 12:56:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18528 states. [2019-12-18 12:56:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18528 states to 18528 states and 56415 transitions. [2019-12-18 12:56:41,451 INFO L78 Accepts]: Start accepts. Automaton has 18528 states and 56415 transitions. Word has length 38 [2019-12-18 12:56:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:41,452 INFO L462 AbstractCegarLoop]: Abstraction has 18528 states and 56415 transitions. [2019-12-18 12:56:41,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:56:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 18528 states and 56415 transitions. [2019-12-18 12:56:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 12:56:41,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:41,471 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] [2019-12-18 12:56:41,471 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 12:56:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1454822857, now seen corresponding path program 2 times [2019-12-18 12:56:41,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:41,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131397851] [2019-12-18 12:56:41,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:41,575 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 12:56:41,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131397851] [2019-12-18 12:56:41,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:41,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:56:41,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025109424] [2019-12-18 12:56:41,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:41,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:41,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:41,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:41,577 INFO L87 Difference]: Start difference. First operand 18528 states and 56415 transitions. Second operand 7 states. [2019-12-18 12:56:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:42,430 INFO L93 Difference]: Finished difference Result 24433 states and 73054 transitions. [2019-12-18 12:56:42,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:56:42,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-18 12:56:42,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:42,472 INFO L225 Difference]: With dead ends: 24433 [2019-12-18 12:56:42,472 INFO L226 Difference]: Without dead ends: 24433 [2019-12-18 12:56:42,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:56:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24433 states. [2019-12-18 12:56:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24433 to 17844. [2019-12-18 12:56:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17844 states. [2019-12-18 12:56:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17844 states to 17844 states and 54566 transitions. [2019-12-18 12:56:42,783 INFO L78 Accepts]: Start accepts. Automaton has 17844 states and 54566 transitions. Word has length 38 [2019-12-18 12:56:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:42,783 INFO L462 AbstractCegarLoop]: Abstraction has 17844 states and 54566 transitions. [2019-12-18 12:56:42,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 17844 states and 54566 transitions. [2019-12-18 12:56:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:56:42,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:42,804 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 12:56:42,804 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 12:56:42,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:42,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-18 12:56:42,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:42,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293170908] [2019-12-18 12:56:42,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:42,860 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 12:56:42,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293170908] [2019-12-18 12:56:42,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:42,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:56:42,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475680250] [2019-12-18 12:56:42,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:42,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:42,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:42,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:42,862 INFO L87 Difference]: Start difference. First operand 17844 states and 54566 transitions. Second operand 3 states. [2019-12-18 12:56:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:42,930 INFO L93 Difference]: Finished difference Result 17843 states and 54564 transitions. [2019-12-18 12:56:42,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:42,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:56:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:42,962 INFO L225 Difference]: With dead ends: 17843 [2019-12-18 12:56:42,963 INFO L226 Difference]: Without dead ends: 17843 [2019-12-18 12:56:42,963 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 12:56:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17843 states. [2019-12-18 12:56:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17843 to 17843. [2019-12-18 12:56:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17843 states. [2019-12-18 12:56:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17843 states to 17843 states and 54564 transitions. [2019-12-18 12:56:43,385 INFO L78 Accepts]: Start accepts. Automaton has 17843 states and 54564 transitions. Word has length 39 [2019-12-18 12:56:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:43,385 INFO L462 AbstractCegarLoop]: Abstraction has 17843 states and 54564 transitions. [2019-12-18 12:56:43,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 17843 states and 54564 transitions. [2019-12-18 12:56:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:56:43,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:43,408 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 12:56:43,408 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 12:56:43,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:43,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-18 12:56:43,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:43,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202464000] [2019-12-18 12:56:43,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:43,499 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 12:56:43,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202464000] [2019-12-18 12:56:43,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:43,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:56:43,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128294471] [2019-12-18 12:56:43,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:56:43,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:56:43,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:43,501 INFO L87 Difference]: Start difference. First operand 17843 states and 54564 transitions. Second operand 5 states. [2019-12-18 12:56:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:44,126 INFO L93 Difference]: Finished difference Result 25586 states and 77360 transitions. [2019-12-18 12:56:44,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:56:44,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:56:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:44,163 INFO L225 Difference]: With dead ends: 25586 [2019-12-18 12:56:44,163 INFO L226 Difference]: Without dead ends: 25586 [2019-12-18 12:56:44,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 12:56:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25586 states. [2019-12-18 12:56:44,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25586 to 23742. [2019-12-18 12:56:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23742 states. [2019-12-18 12:56:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23742 states to 23742 states and 72302 transitions. [2019-12-18 12:56:44,515 INFO L78 Accepts]: Start accepts. Automaton has 23742 states and 72302 transitions. Word has length 40 [2019-12-18 12:56:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:44,515 INFO L462 AbstractCegarLoop]: Abstraction has 23742 states and 72302 transitions. [2019-12-18 12:56:44,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:56:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 23742 states and 72302 transitions. [2019-12-18 12:56:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:56:44,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:44,536 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 12:56:44,536 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 12:56:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:44,536 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-18 12:56:44,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:44,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985912615] [2019-12-18 12:56:44,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:44,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985912615] [2019-12-18 12:56:44,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:44,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:56:44,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925070422] [2019-12-18 12:56:44,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:56:44,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:56:44,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:44,599 INFO L87 Difference]: Start difference. First operand 23742 states and 72302 transitions. Second operand 5 states. [2019-12-18 12:56:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:44,713 INFO L93 Difference]: Finished difference Result 22357 states and 69069 transitions. [2019-12-18 12:56:44,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:44,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:56:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:44,746 INFO L225 Difference]: With dead ends: 22357 [2019-12-18 12:56:44,746 INFO L226 Difference]: Without dead ends: 22357 [2019-12-18 12:56:44,747 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 12:56:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22357 states. [2019-12-18 12:56:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22357 to 21433. [2019-12-18 12:56:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21433 states. [2019-12-18 12:56:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21433 states to 21433 states and 66576 transitions. [2019-12-18 12:56:45,071 INFO L78 Accepts]: Start accepts. Automaton has 21433 states and 66576 transitions. Word has length 40 [2019-12-18 12:56:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:45,072 INFO L462 AbstractCegarLoop]: Abstraction has 21433 states and 66576 transitions. [2019-12-18 12:56:45,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:56:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 21433 states and 66576 transitions. [2019-12-18 12:56:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:56:45,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:45,091 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] [2019-12-18 12:56:45,092 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 12:56:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:45,092 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-18 12:56:45,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:45,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822951091] [2019-12-18 12:56:45,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:45,178 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 12:56:45,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822951091] [2019-12-18 12:56:45,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:45,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:56:45,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515848623] [2019-12-18 12:56:45,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:45,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:45,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:45,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:45,180 INFO L87 Difference]: Start difference. First operand 21433 states and 66576 transitions. Second operand 7 states. [2019-12-18 12:56:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:45,683 INFO L93 Difference]: Finished difference Result 62178 states and 192107 transitions. [2019-12-18 12:56:45,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:56:45,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:56:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:45,750 INFO L225 Difference]: With dead ends: 62178 [2019-12-18 12:56:45,751 INFO L226 Difference]: Without dead ends: 47621 [2019-12-18 12:56:45,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:56:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47621 states. [2019-12-18 12:56:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47621 to 24994. [2019-12-18 12:56:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24994 states. [2019-12-18 12:56:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24994 states to 24994 states and 78149 transitions. [2019-12-18 12:56:46,318 INFO L78 Accepts]: Start accepts. Automaton has 24994 states and 78149 transitions. Word has length 63 [2019-12-18 12:56:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:46,319 INFO L462 AbstractCegarLoop]: Abstraction has 24994 states and 78149 transitions. [2019-12-18 12:56:46,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 24994 states and 78149 transitions. [2019-12-18 12:56:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:56:46,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:46,346 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] [2019-12-18 12:56:46,346 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 12:56:46,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-18 12:56:46,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:46,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126758257] [2019-12-18 12:56:46,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:46,429 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 12:56:46,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126758257] [2019-12-18 12:56:46,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:46,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:56:46,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456212870] [2019-12-18 12:56:46,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:46,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:46,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:46,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:46,432 INFO L87 Difference]: Start difference. First operand 24994 states and 78149 transitions. Second operand 7 states. [2019-12-18 12:56:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:47,200 INFO L93 Difference]: Finished difference Result 68494 states and 210324 transitions. [2019-12-18 12:56:47,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:56:47,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:56:47,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:47,331 INFO L225 Difference]: With dead ends: 68494 [2019-12-18 12:56:47,332 INFO L226 Difference]: Without dead ends: 48573 [2019-12-18 12:56:47,332 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 12:56:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48573 states. [2019-12-18 12:56:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48573 to 28837. [2019-12-18 12:56:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28837 states. [2019-12-18 12:56:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28837 states to 28837 states and 89809 transitions. [2019-12-18 12:56:48,235 INFO L78 Accepts]: Start accepts. Automaton has 28837 states and 89809 transitions. Word has length 63 [2019-12-18 12:56:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:48,235 INFO L462 AbstractCegarLoop]: Abstraction has 28837 states and 89809 transitions. [2019-12-18 12:56:48,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 28837 states and 89809 transitions. [2019-12-18 12:56:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:56:48,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:48,267 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] [2019-12-18 12:56:48,267 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 12:56:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-18 12:56:48,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:48,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448334165] [2019-12-18 12:56:48,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:48,341 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 12:56:48,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448334165] [2019-12-18 12:56:48,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:48,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:56:48,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034230519] [2019-12-18 12:56:48,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:48,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:48,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:48,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:48,343 INFO L87 Difference]: Start difference. First operand 28837 states and 89809 transitions. Second operand 7 states. [2019-12-18 12:56:49,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:49,043 INFO L93 Difference]: Finished difference Result 59882 states and 183863 transitions. [2019-12-18 12:56:49,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:56:49,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:56:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:49,187 INFO L225 Difference]: With dead ends: 59882 [2019-12-18 12:56:49,188 INFO L226 Difference]: Without dead ends: 52801 [2019-12-18 12:56:49,190 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 12:56:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52801 states. [2019-12-18 12:56:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52801 to 29145. [2019-12-18 12:56:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29145 states. [2019-12-18 12:56:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29145 states to 29145 states and 90760 transitions. [2019-12-18 12:56:49,993 INFO L78 Accepts]: Start accepts. Automaton has 29145 states and 90760 transitions. Word has length 63 [2019-12-18 12:56:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:49,993 INFO L462 AbstractCegarLoop]: Abstraction has 29145 states and 90760 transitions. [2019-12-18 12:56:49,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 29145 states and 90760 transitions. [2019-12-18 12:56:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:56:50,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:50,025 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] [2019-12-18 12:56:50,025 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 12:56:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:50,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-18 12:56:50,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:50,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281438956] [2019-12-18 12:56:50,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:50,125 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 12:56:50,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281438956] [2019-12-18 12:56:50,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:50,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:56:50,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27024239] [2019-12-18 12:56:50,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:50,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:50,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:50,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:50,129 INFO L87 Difference]: Start difference. First operand 29145 states and 90760 transitions. Second operand 7 states. [2019-12-18 12:56:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:51,229 INFO L93 Difference]: Finished difference Result 38133 states and 116396 transitions. [2019-12-18 12:56:51,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:56:51,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:56:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:51,290 INFO L225 Difference]: With dead ends: 38133 [2019-12-18 12:56:51,290 INFO L226 Difference]: Without dead ends: 37909 [2019-12-18 12:56:51,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:56:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37909 states. [2019-12-18 12:56:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37909 to 31933. [2019-12-18 12:56:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31933 states. [2019-12-18 12:56:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31933 states to 31933 states and 99059 transitions. [2019-12-18 12:56:52,027 INFO L78 Accepts]: Start accepts. Automaton has 31933 states and 99059 transitions. Word has length 63 [2019-12-18 12:56:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:52,028 INFO L462 AbstractCegarLoop]: Abstraction has 31933 states and 99059 transitions. [2019-12-18 12:56:52,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 31933 states and 99059 transitions. [2019-12-18 12:56:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:56:52,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:52,064 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] [2019-12-18 12:56:52,064 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 12:56:52,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:52,064 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-18 12:56:52,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:52,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099873228] [2019-12-18 12:56:52,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:52,195 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 12:56:52,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099873228] [2019-12-18 12:56:52,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:52,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:56:52,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717355188] [2019-12-18 12:56:52,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:56:52,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:52,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:56:52,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:56:52,198 INFO L87 Difference]: Start difference. First operand 31933 states and 99059 transitions. Second operand 9 states. [2019-12-18 12:56:54,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:54,028 INFO L93 Difference]: Finished difference Result 56528 states and 170527 transitions. [2019-12-18 12:56:54,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:56:54,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:56:54,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:54,115 INFO L225 Difference]: With dead ends: 56528 [2019-12-18 12:56:54,115 INFO L226 Difference]: Without dead ends: 56253 [2019-12-18 12:56:54,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:56:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56253 states. [2019-12-18 12:56:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56253 to 36206. [2019-12-18 12:56:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36206 states. [2019-12-18 12:56:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36206 states to 36206 states and 111853 transitions. [2019-12-18 12:56:54,847 INFO L78 Accepts]: Start accepts. Automaton has 36206 states and 111853 transitions. Word has length 63 [2019-12-18 12:56:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:54,847 INFO L462 AbstractCegarLoop]: Abstraction has 36206 states and 111853 transitions. [2019-12-18 12:56:54,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:56:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 36206 states and 111853 transitions. [2019-12-18 12:56:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:56:54,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:54,887 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] [2019-12-18 12:56:54,888 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 12:56:54,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:54,888 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-18 12:56:54,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:54,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976942126] [2019-12-18 12:56:54,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:54,993 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 12:56:54,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976942126] [2019-12-18 12:56:54,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:54,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:56:54,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488073076] [2019-12-18 12:56:54,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:54,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:54,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:54,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:54,996 INFO L87 Difference]: Start difference. First operand 36206 states and 111853 transitions. Second operand 7 states. [2019-12-18 12:56:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:55,965 INFO L93 Difference]: Finished difference Result 59580 states and 181765 transitions. [2019-12-18 12:56:55,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:56:55,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:56:55,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:56,056 INFO L225 Difference]: With dead ends: 59580 [2019-12-18 12:56:56,056 INFO L226 Difference]: Without dead ends: 59360 [2019-12-18 12:56:56,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:56:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59360 states. [2019-12-18 12:56:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59360 to 40559. [2019-12-18 12:56:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40559 states. [2019-12-18 12:56:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40559 states to 40559 states and 125233 transitions. [2019-12-18 12:56:57,097 INFO L78 Accepts]: Start accepts. Automaton has 40559 states and 125233 transitions. Word has length 63 [2019-12-18 12:56:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:57,097 INFO L462 AbstractCegarLoop]: Abstraction has 40559 states and 125233 transitions. [2019-12-18 12:56:57,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 40559 states and 125233 transitions. [2019-12-18 12:56:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:56:57,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:57,142 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] [2019-12-18 12:56:57,142 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 12:56:57,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:57,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-18 12:56:57,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:57,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756974132] [2019-12-18 12:56:57,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:57,268 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 12:56:57,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756974132] [2019-12-18 12:56:57,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:57,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:56:57,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800835158] [2019-12-18 12:56:57,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:56:57,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:57,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:56:57,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:56:57,270 INFO L87 Difference]: Start difference. First operand 40559 states and 125233 transitions. Second operand 9 states. [2019-12-18 12:56:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:58,649 INFO L93 Difference]: Finished difference Result 60977 states and 185679 transitions. [2019-12-18 12:56:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:56:58,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:56:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:58,745 INFO L225 Difference]: With dead ends: 60977 [2019-12-18 12:56:58,746 INFO L226 Difference]: Without dead ends: 60725 [2019-12-18 12:56:58,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:56:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60725 states. [2019-12-18 12:56:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60725 to 41461. [2019-12-18 12:56:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41461 states. [2019-12-18 12:56:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41461 states to 41461 states and 127870 transitions. [2019-12-18 12:56:59,552 INFO L78 Accepts]: Start accepts. Automaton has 41461 states and 127870 transitions. Word has length 63 [2019-12-18 12:56:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:59,553 INFO L462 AbstractCegarLoop]: Abstraction has 41461 states and 127870 transitions. [2019-12-18 12:56:59,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:56:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 41461 states and 127870 transitions. [2019-12-18 12:56:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:56:59,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:59,598 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] [2019-12-18 12:56:59,599 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 12:56:59,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:59,599 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-18 12:56:59,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:59,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436639281] [2019-12-18 12:56:59,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:59,737 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 12:56:59,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436639281] [2019-12-18 12:56:59,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:59,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:56:59,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816924862] [2019-12-18 12:56:59,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:56:59,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:56:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:56:59,740 INFO L87 Difference]: Start difference. First operand 41461 states and 127870 transitions. Second operand 9 states. [2019-12-18 12:57:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:02,044 INFO L93 Difference]: Finished difference Result 58913 states and 177959 transitions. [2019-12-18 12:57:02,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:57:02,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:57:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:02,135 INFO L225 Difference]: With dead ends: 58913 [2019-12-18 12:57:02,135 INFO L226 Difference]: Without dead ends: 58913 [2019-12-18 12:57:02,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:57:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58913 states. [2019-12-18 12:57:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58913 to 40747. [2019-12-18 12:57:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40747 states. [2019-12-18 12:57:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40747 states to 40747 states and 125775 transitions. [2019-12-18 12:57:02,919 INFO L78 Accepts]: Start accepts. Automaton has 40747 states and 125775 transitions. Word has length 63 [2019-12-18 12:57:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:02,920 INFO L462 AbstractCegarLoop]: Abstraction has 40747 states and 125775 transitions. [2019-12-18 12:57:02,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:57:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40747 states and 125775 transitions. [2019-12-18 12:57:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:02,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:02,963 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] [2019-12-18 12:57:02,963 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 12:57:02,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:02,963 INFO L82 PathProgramCache]: Analyzing trace with hash 194134925, now seen corresponding path program 9 times [2019-12-18 12:57:02,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:02,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283081394] [2019-12-18 12:57:02,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:03,074 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 12:57:03,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283081394] [2019-12-18 12:57:03,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:03,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:57:03,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557607873] [2019-12-18 12:57:03,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:57:03,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:03,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:57:03,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:57:03,076 INFO L87 Difference]: Start difference. First operand 40747 states and 125775 transitions. Second operand 8 states. [2019-12-18 12:57:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:04,183 INFO L93 Difference]: Finished difference Result 56530 states and 172606 transitions. [2019-12-18 12:57:04,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:57:04,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:57:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:04,274 INFO L225 Difference]: With dead ends: 56530 [2019-12-18 12:57:04,274 INFO L226 Difference]: Without dead ends: 56530 [2019-12-18 12:57:04,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:57:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56530 states. [2019-12-18 12:57:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56530 to 40097. [2019-12-18 12:57:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40097 states. [2019-12-18 12:57:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40097 states to 40097 states and 123782 transitions. [2019-12-18 12:57:05,064 INFO L78 Accepts]: Start accepts. Automaton has 40097 states and 123782 transitions. Word has length 63 [2019-12-18 12:57:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:05,064 INFO L462 AbstractCegarLoop]: Abstraction has 40097 states and 123782 transitions. [2019-12-18 12:57:05,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:57:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 40097 states and 123782 transitions. [2019-12-18 12:57:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:05,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:05,112 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] [2019-12-18 12:57:05,112 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 12:57:05,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:05,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1930988027, now seen corresponding path program 10 times [2019-12-18 12:57:05,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:05,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75186021] [2019-12-18 12:57:05,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:05,601 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 12:57:05,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75186021] [2019-12-18 12:57:05,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:05,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:57:05,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547214406] [2019-12-18 12:57:05,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:57:05,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:05,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:57:05,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:57:05,603 INFO L87 Difference]: Start difference. First operand 40097 states and 123782 transitions. Second operand 10 states. [2019-12-18 12:57:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:07,170 INFO L93 Difference]: Finished difference Result 57378 states and 175206 transitions. [2019-12-18 12:57:07,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:57:07,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-18 12:57:07,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:07,256 INFO L225 Difference]: With dead ends: 57378 [2019-12-18 12:57:07,257 INFO L226 Difference]: Without dead ends: 57378 [2019-12-18 12:57:07,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:57:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57378 states. [2019-12-18 12:57:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57378 to 37834. [2019-12-18 12:57:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37834 states. [2019-12-18 12:57:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37834 states to 37834 states and 117029 transitions. [2019-12-18 12:57:08,011 INFO L78 Accepts]: Start accepts. Automaton has 37834 states and 117029 transitions. Word has length 63 [2019-12-18 12:57:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:08,011 INFO L462 AbstractCegarLoop]: Abstraction has 37834 states and 117029 transitions. [2019-12-18 12:57:08,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:57:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 37834 states and 117029 transitions. [2019-12-18 12:57:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:08,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:08,051 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] [2019-12-18 12:57:08,051 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 12:57:08,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:08,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1638823163, now seen corresponding path program 11 times [2019-12-18 12:57:08,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:08,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596219603] [2019-12-18 12:57:08,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:08,150 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 12:57:08,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596219603] [2019-12-18 12:57:08,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:08,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:57:08,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913375583] [2019-12-18 12:57:08,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:57:08,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:08,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:57:08,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:08,152 INFO L87 Difference]: Start difference. First operand 37834 states and 117029 transitions. Second operand 7 states. [2019-12-18 12:57:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:08,981 INFO L93 Difference]: Finished difference Result 59133 states and 180206 transitions. [2019-12-18 12:57:08,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:57:08,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:57:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:09,077 INFO L225 Difference]: With dead ends: 59133 [2019-12-18 12:57:09,077 INFO L226 Difference]: Without dead ends: 59133 [2019-12-18 12:57:09,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59133 states. [2019-12-18 12:57:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59133 to 39796. [2019-12-18 12:57:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39796 states. [2019-12-18 12:57:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39796 states to 39796 states and 123046 transitions. [2019-12-18 12:57:09,833 INFO L78 Accepts]: Start accepts. Automaton has 39796 states and 123046 transitions. Word has length 63 [2019-12-18 12:57:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:09,833 INFO L462 AbstractCegarLoop]: Abstraction has 39796 states and 123046 transitions. [2019-12-18 12:57:09,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:57:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 39796 states and 123046 transitions. [2019-12-18 12:57:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:09,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:09,877 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] [2019-12-18 12:57:09,878 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 12:57:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:09,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1952090881, now seen corresponding path program 12 times [2019-12-18 12:57:09,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:09,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493496604] [2019-12-18 12:57:09,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:10,303 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-18 12:57:10,339 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 12:57:10,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493496604] [2019-12-18 12:57:10,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:10,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:57:10,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72487552] [2019-12-18 12:57:10,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:57:10,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:10,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:57:10,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:57:10,343 INFO L87 Difference]: Start difference. First operand 39796 states and 123046 transitions. Second operand 8 states. [2019-12-18 12:57:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:11,334 INFO L93 Difference]: Finished difference Result 58630 states and 178786 transitions. [2019-12-18 12:57:11,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:57:11,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:57:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:11,422 INFO L225 Difference]: With dead ends: 58630 [2019-12-18 12:57:11,422 INFO L226 Difference]: Without dead ends: 58630 [2019-12-18 12:57:11,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:57:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58630 states. [2019-12-18 12:57:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58630 to 38373. [2019-12-18 12:57:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38373 states. [2019-12-18 12:57:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38373 states to 38373 states and 118770 transitions. [2019-12-18 12:57:12,173 INFO L78 Accepts]: Start accepts. Automaton has 38373 states and 118770 transitions. Word has length 63 [2019-12-18 12:57:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:12,173 INFO L462 AbstractCegarLoop]: Abstraction has 38373 states and 118770 transitions. [2019-12-18 12:57:12,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:57:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 38373 states and 118770 transitions. [2019-12-18 12:57:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:12,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:12,214 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] [2019-12-18 12:57:12,215 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 12:57:12,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:12,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1981956519, now seen corresponding path program 13 times [2019-12-18 12:57:12,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:12,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92650981] [2019-12-18 12:57:12,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:12,349 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 12:57:12,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92650981] [2019-12-18 12:57:12,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:12,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:57:12,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121643932] [2019-12-18 12:57:12,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:57:12,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:12,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:57:12,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:57:12,351 INFO L87 Difference]: Start difference. First operand 38373 states and 118770 transitions. Second operand 10 states. [2019-12-18 12:57:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:14,157 INFO L93 Difference]: Finished difference Result 62485 states and 188462 transitions. [2019-12-18 12:57:14,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:57:14,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-18 12:57:14,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:14,256 INFO L225 Difference]: With dead ends: 62485 [2019-12-18 12:57:14,256 INFO L226 Difference]: Without dead ends: 62485 [2019-12-18 12:57:14,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:57:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62485 states. [2019-12-18 12:57:14,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62485 to 38757. [2019-12-18 12:57:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38757 states. [2019-12-18 12:57:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38757 states to 38757 states and 120110 transitions. [2019-12-18 12:57:15,050 INFO L78 Accepts]: Start accepts. Automaton has 38757 states and 120110 transitions. Word has length 63 [2019-12-18 12:57:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:15,050 INFO L462 AbstractCegarLoop]: Abstraction has 38757 states and 120110 transitions. [2019-12-18 12:57:15,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:57:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 38757 states and 120110 transitions. [2019-12-18 12:57:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:15,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:15,093 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] [2019-12-18 12:57:15,093 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 12:57:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1745238685, now seen corresponding path program 14 times [2019-12-18 12:57:15,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:15,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058444746] [2019-12-18 12:57:15,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:15,570 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 12:57:15,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058444746] [2019-12-18 12:57:15,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:15,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:57:15,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304268742] [2019-12-18 12:57:15,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:57:15,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:15,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:57:15,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:57:15,574 INFO L87 Difference]: Start difference. First operand 38757 states and 120110 transitions. Second operand 8 states. [2019-12-18 12:57:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:16,627 INFO L93 Difference]: Finished difference Result 52809 states and 161626 transitions. [2019-12-18 12:57:16,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:57:16,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:57:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:16,710 INFO L225 Difference]: With dead ends: 52809 [2019-12-18 12:57:16,710 INFO L226 Difference]: Without dead ends: 52753 [2019-12-18 12:57:16,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:57:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52753 states. [2019-12-18 12:57:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52753 to 38009. [2019-12-18 12:57:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38009 states. [2019-12-18 12:57:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38009 states to 38009 states and 117050 transitions. [2019-12-18 12:57:17,430 INFO L78 Accepts]: Start accepts. Automaton has 38009 states and 117050 transitions. Word has length 63 [2019-12-18 12:57:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:17,430 INFO L462 AbstractCegarLoop]: Abstraction has 38009 states and 117050 transitions. [2019-12-18 12:57:17,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:57:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 38009 states and 117050 transitions. [2019-12-18 12:57:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:17,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:17,472 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] [2019-12-18 12:57:17,472 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 12:57:17,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1876409601, now seen corresponding path program 15 times [2019-12-18 12:57:17,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:17,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523042672] [2019-12-18 12:57:17,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:17,562 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 12:57:17,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523042672] [2019-12-18 12:57:17,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:17,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:57:17,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520687252] [2019-12-18 12:57:17,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:57:17,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:17,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:57:17,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:17,564 INFO L87 Difference]: Start difference. First operand 38009 states and 117050 transitions. Second operand 7 states. [2019-12-18 12:57:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:18,720 INFO L93 Difference]: Finished difference Result 57017 states and 174298 transitions. [2019-12-18 12:57:18,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:57:18,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:57:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:18,806 INFO L225 Difference]: With dead ends: 57017 [2019-12-18 12:57:18,806 INFO L226 Difference]: Without dead ends: 57017 [2019-12-18 12:57:18,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:57:18,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57017 states. [2019-12-18 12:57:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57017 to 40165. [2019-12-18 12:57:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40165 states. [2019-12-18 12:57:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40165 states to 40165 states and 123968 transitions. [2019-12-18 12:57:19,532 INFO L78 Accepts]: Start accepts. Automaton has 40165 states and 123968 transitions. Word has length 63 [2019-12-18 12:57:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:19,532 INFO L462 AbstractCegarLoop]: Abstraction has 40165 states and 123968 transitions. [2019-12-18 12:57:19,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:57:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 40165 states and 123968 transitions. [2019-12-18 12:57:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:19,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:19,575 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] [2019-12-18 12:57:19,575 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 12:57:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1937295543, now seen corresponding path program 16 times [2019-12-18 12:57:19,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:19,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480092690] [2019-12-18 12:57:19,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:19,682 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 12:57:19,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480092690] [2019-12-18 12:57:19,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:19,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:19,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209593105] [2019-12-18 12:57:19,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:57:19,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:19,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:57:19,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:57:19,686 INFO L87 Difference]: Start difference. First operand 40165 states and 123968 transitions. Second operand 9 states. [2019-12-18 12:57:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:21,156 INFO L93 Difference]: Finished difference Result 61349 states and 186801 transitions. [2019-12-18 12:57:21,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:57:21,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:57:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:21,252 INFO L225 Difference]: With dead ends: 61349 [2019-12-18 12:57:21,252 INFO L226 Difference]: Without dead ends: 61349 [2019-12-18 12:57:21,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:57:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61349 states. [2019-12-18 12:57:21,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61349 to 40967. [2019-12-18 12:57:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40967 states. [2019-12-18 12:57:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40967 states to 40967 states and 126257 transitions. [2019-12-18 12:57:22,080 INFO L78 Accepts]: Start accepts. Automaton has 40967 states and 126257 transitions. Word has length 63 [2019-12-18 12:57:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:22,080 INFO L462 AbstractCegarLoop]: Abstraction has 40967 states and 126257 transitions. [2019-12-18 12:57:22,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:57:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 40967 states and 126257 transitions. [2019-12-18 12:57:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:22,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:22,125 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] [2019-12-18 12:57:22,125 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 12:57:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1351537083, now seen corresponding path program 17 times [2019-12-18 12:57:22,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:22,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761269220] [2019-12-18 12:57:22,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:22,253 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 12:57:22,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761269220] [2019-12-18 12:57:22,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:22,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:57:22,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333657032] [2019-12-18 12:57:22,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:57:22,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:22,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:57:22,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:57:22,255 INFO L87 Difference]: Start difference. First operand 40967 states and 126257 transitions. Second operand 10 states. [2019-12-18 12:57:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:23,634 INFO L93 Difference]: Finished difference Result 61410 states and 186954 transitions. [2019-12-18 12:57:23,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:57:23,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-18 12:57:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:23,732 INFO L225 Difference]: With dead ends: 61410 [2019-12-18 12:57:23,733 INFO L226 Difference]: Without dead ends: 61410 [2019-12-18 12:57:23,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:57:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61410 states. [2019-12-18 12:57:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61410 to 39861. [2019-12-18 12:57:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39861 states. [2019-12-18 12:57:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39861 states to 39861 states and 123087 transitions. [2019-12-18 12:57:24,524 INFO L78 Accepts]: Start accepts. Automaton has 39861 states and 123087 transitions. Word has length 63 [2019-12-18 12:57:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:24,524 INFO L462 AbstractCegarLoop]: Abstraction has 39861 states and 123087 transitions. [2019-12-18 12:57:24,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:57:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 39861 states and 123087 transitions. [2019-12-18 12:57:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:24,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:24,565 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] [2019-12-18 12:57:24,565 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 12:57:24,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:24,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1012741715, now seen corresponding path program 18 times [2019-12-18 12:57:24,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:24,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946246186] [2019-12-18 12:57:24,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:24,658 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 12:57:24,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946246186] [2019-12-18 12:57:24,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:24,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:57:24,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255343213] [2019-12-18 12:57:24,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:57:24,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:24,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:57:24,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:57:24,659 INFO L87 Difference]: Start difference. First operand 39861 states and 123087 transitions. Second operand 8 states. [2019-12-18 12:57:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:26,018 INFO L93 Difference]: Finished difference Result 61665 states and 189977 transitions. [2019-12-18 12:57:26,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:57:26,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:57:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:26,118 INFO L225 Difference]: With dead ends: 61665 [2019-12-18 12:57:26,118 INFO L226 Difference]: Without dead ends: 61665 [2019-12-18 12:57:26,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:57:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61665 states. [2019-12-18 12:57:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61665 to 39341. [2019-12-18 12:57:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39341 states. [2019-12-18 12:57:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39341 states to 39341 states and 121306 transitions. [2019-12-18 12:57:26,885 INFO L78 Accepts]: Start accepts. Automaton has 39341 states and 121306 transitions. Word has length 63 [2019-12-18 12:57:26,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:26,885 INFO L462 AbstractCegarLoop]: Abstraction has 39341 states and 121306 transitions. [2019-12-18 12:57:26,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:57:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 39341 states and 121306 transitions. [2019-12-18 12:57:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:26,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:26,930 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] [2019-12-18 12:57:26,930 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:26,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:26,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1879007009, now seen corresponding path program 19 times [2019-12-18 12:57:26,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:26,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336382185] [2019-12-18 12:57:26,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:26,981 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 12:57:26,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336382185] [2019-12-18 12:57:26,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:26,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:26,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525048110] [2019-12-18 12:57:26,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:26,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:26,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:26,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:26,983 INFO L87 Difference]: Start difference. First operand 39341 states and 121306 transitions. Second operand 4 states. [2019-12-18 12:57:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:27,186 INFO L93 Difference]: Finished difference Result 68365 states and 210868 transitions. [2019-12-18 12:57:27,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:57:27,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-18 12:57:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:27,234 INFO L225 Difference]: With dead ends: 68365 [2019-12-18 12:57:27,235 INFO L226 Difference]: Without dead ends: 31711 [2019-12-18 12:57:27,235 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 12:57:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31711 states. [2019-12-18 12:57:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31711 to 31711. [2019-12-18 12:57:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31711 states. [2019-12-18 12:57:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31711 states to 31711 states and 97714 transitions. [2019-12-18 12:57:27,768 INFO L78 Accepts]: Start accepts. Automaton has 31711 states and 97714 transitions. Word has length 63 [2019-12-18 12:57:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:27,768 INFO L462 AbstractCegarLoop]: Abstraction has 31711 states and 97714 transitions. [2019-12-18 12:57:27,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 31711 states and 97714 transitions. [2019-12-18 12:57:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:27,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:27,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:27,803 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:27,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:27,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2023139907, now seen corresponding path program 20 times [2019-12-18 12:57:27,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:27,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196755963] [2019-12-18 12:57:27,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:27,866 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 12:57:27,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196755963] [2019-12-18 12:57:27,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:27,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:57:27,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158875822] [2019-12-18 12:57:27,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:57:27,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:27,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:57:27,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:27,868 INFO L87 Difference]: Start difference. First operand 31711 states and 97714 transitions. Second operand 7 states. [2019-12-18 12:57:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:28,461 INFO L93 Difference]: Finished difference Result 77019 states and 234862 transitions. [2019-12-18 12:57:28,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:57:28,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:57:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:28,559 INFO L225 Difference]: With dead ends: 77019 [2019-12-18 12:57:28,560 INFO L226 Difference]: Without dead ends: 65298 [2019-12-18 12:57:28,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:57:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65298 states. [2019-12-18 12:57:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65298 to 31588. [2019-12-18 12:57:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31588 states. [2019-12-18 12:57:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31588 states to 31588 states and 97154 transitions. [2019-12-18 12:57:29,591 INFO L78 Accepts]: Start accepts. Automaton has 31588 states and 97154 transitions. Word has length 63 [2019-12-18 12:57:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:29,591 INFO L462 AbstractCegarLoop]: Abstraction has 31588 states and 97154 transitions. [2019-12-18 12:57:29,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:57:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 31588 states and 97154 transitions. [2019-12-18 12:57:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:29,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:29,626 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] [2019-12-18 12:57:29,627 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:29,627 INFO L82 PathProgramCache]: Analyzing trace with hash -94392515, now seen corresponding path program 21 times [2019-12-18 12:57:29,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:29,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825611482] [2019-12-18 12:57:29,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:29,671 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 12:57:29,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825611482] [2019-12-18 12:57:29,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:29,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:29,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904698539] [2019-12-18 12:57:29,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:29,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:29,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:29,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:29,673 INFO L87 Difference]: Start difference. First operand 31588 states and 97154 transitions. Second operand 3 states. [2019-12-18 12:57:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:29,822 INFO L93 Difference]: Finished difference Result 54484 states and 167043 transitions. [2019-12-18 12:57:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:29,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-18 12:57:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:29,858 INFO L225 Difference]: With dead ends: 54484 [2019-12-18 12:57:29,858 INFO L226 Difference]: Without dead ends: 23970 [2019-12-18 12:57:29,858 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 12:57:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23970 states. [2019-12-18 12:57:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23970 to 23970. [2019-12-18 12:57:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23970 states. [2019-12-18 12:57:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23970 states to 23970 states and 72854 transitions. [2019-12-18 12:57:30,213 INFO L78 Accepts]: Start accepts. Automaton has 23970 states and 72854 transitions. Word has length 63 [2019-12-18 12:57:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:30,213 INFO L462 AbstractCegarLoop]: Abstraction has 23970 states and 72854 transitions. [2019-12-18 12:57:30,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 23970 states and 72854 transitions. [2019-12-18 12:57:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:30,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:30,236 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 12:57:30,236 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1205251063, now seen corresponding path program 1 times [2019-12-18 12:57:30,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:30,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63526663] [2019-12-18 12:57:30,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:30,303 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 12:57:30,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63526663] [2019-12-18 12:57:30,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:30,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:57:30,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556637479] [2019-12-18 12:57:30,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:57:30,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:30,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:57:30,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:57:30,305 INFO L87 Difference]: Start difference. First operand 23970 states and 72854 transitions. Second operand 6 states. [2019-12-18 12:57:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:30,936 INFO L93 Difference]: Finished difference Result 30938 states and 92950 transitions. [2019-12-18 12:57:30,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:57:30,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 12:57:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:30,978 INFO L225 Difference]: With dead ends: 30938 [2019-12-18 12:57:30,978 INFO L226 Difference]: Without dead ends: 30938 [2019-12-18 12:57:30,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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 12:57:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30938 states. [2019-12-18 12:57:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30938 to 24660. [2019-12-18 12:57:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24660 states. [2019-12-18 12:57:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24660 states to 24660 states and 74873 transitions. [2019-12-18 12:57:31,392 INFO L78 Accepts]: Start accepts. Automaton has 24660 states and 74873 transitions. Word has length 64 [2019-12-18 12:57:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:31,392 INFO L462 AbstractCegarLoop]: Abstraction has 24660 states and 74873 transitions. [2019-12-18 12:57:31,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:57:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 24660 states and 74873 transitions. [2019-12-18 12:57:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:31,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:31,418 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 12:57:31,418 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash 230927717, now seen corresponding path program 2 times [2019-12-18 12:57:31,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:31,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511340882] [2019-12-18 12:57:31,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:31,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511340882] [2019-12-18 12:57:31,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:31,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:57:31,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549917541] [2019-12-18 12:57:31,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:57:31,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:31,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:57:31,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:57:31,633 INFO L87 Difference]: Start difference. First operand 24660 states and 74873 transitions. Second operand 10 states. [2019-12-18 12:57:32,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:32,910 INFO L93 Difference]: Finished difference Result 36645 states and 110267 transitions. [2019-12-18 12:57:32,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:57:32,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-18 12:57:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:32,950 INFO L225 Difference]: With dead ends: 36645 [2019-12-18 12:57:32,951 INFO L226 Difference]: Without dead ends: 29293 [2019-12-18 12:57:32,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:57:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29293 states. [2019-12-18 12:57:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29293 to 25196. [2019-12-18 12:57:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25196 states. [2019-12-18 12:57:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25196 states to 25196 states and 76399 transitions. [2019-12-18 12:57:33,356 INFO L78 Accepts]: Start accepts. Automaton has 25196 states and 76399 transitions. Word has length 64 [2019-12-18 12:57:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:33,357 INFO L462 AbstractCegarLoop]: Abstraction has 25196 states and 76399 transitions. [2019-12-18 12:57:33,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:57:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 25196 states and 76399 transitions. [2019-12-18 12:57:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:33,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:33,384 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 12:57:33,385 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:33,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:33,385 INFO L82 PathProgramCache]: Analyzing trace with hash -477512813, now seen corresponding path program 3 times [2019-12-18 12:57:33,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:33,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138676398] [2019-12-18 12:57:33,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:33,594 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 12:57:33,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138676398] [2019-12-18 12:57:33,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:33,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:33,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472671264] [2019-12-18 12:57:33,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:33,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:33,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:33,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:33,595 INFO L87 Difference]: Start difference. First operand 25196 states and 76399 transitions. Second operand 11 states. [2019-12-18 12:57:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:35,274 INFO L93 Difference]: Finished difference Result 40199 states and 119760 transitions. [2019-12-18 12:57:35,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:57:35,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-18 12:57:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:35,321 INFO L225 Difference]: With dead ends: 40199 [2019-12-18 12:57:35,321 INFO L226 Difference]: Without dead ends: 34505 [2019-12-18 12:57:35,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:57:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34505 states. [2019-12-18 12:57:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34505 to 25269. [2019-12-18 12:57:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25269 states. [2019-12-18 12:57:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25269 states to 25269 states and 76455 transitions. [2019-12-18 12:57:35,754 INFO L78 Accepts]: Start accepts. Automaton has 25269 states and 76455 transitions. Word has length 64 [2019-12-18 12:57:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:35,754 INFO L462 AbstractCegarLoop]: Abstraction has 25269 states and 76455 transitions. [2019-12-18 12:57:35,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 25269 states and 76455 transitions. [2019-12-18 12:57:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:35,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:35,779 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 12:57:35,779 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:35,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:35,779 INFO L82 PathProgramCache]: Analyzing trace with hash -524839499, now seen corresponding path program 4 times [2019-12-18 12:57:35,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:35,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356557401] [2019-12-18 12:57:35,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:35,947 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 12:57:35,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356557401] [2019-12-18 12:57:35,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:35,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:35,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652624126] [2019-12-18 12:57:35,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:35,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:35,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:35,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:35,949 INFO L87 Difference]: Start difference. First operand 25269 states and 76455 transitions. Second operand 11 states. [2019-12-18 12:57:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:36,816 INFO L93 Difference]: Finished difference Result 31350 states and 93789 transitions. [2019-12-18 12:57:36,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:57:36,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-18 12:57:36,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:36,858 INFO L225 Difference]: With dead ends: 31350 [2019-12-18 12:57:36,858 INFO L226 Difference]: Without dead ends: 28838 [2019-12-18 12:57:36,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:57:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28838 states. [2019-12-18 12:57:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28838 to 23015. [2019-12-18 12:57:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23015 states. [2019-12-18 12:57:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23015 states to 23015 states and 69066 transitions. [2019-12-18 12:57:37,250 INFO L78 Accepts]: Start accepts. Automaton has 23015 states and 69066 transitions. Word has length 64 [2019-12-18 12:57:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:37,250 INFO L462 AbstractCegarLoop]: Abstraction has 23015 states and 69066 transitions. [2019-12-18 12:57:37,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 23015 states and 69066 transitions. [2019-12-18 12:57:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:37,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:37,274 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 12:57:37,274 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:37,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:37,274 INFO L82 PathProgramCache]: Analyzing trace with hash -481369909, now seen corresponding path program 5 times [2019-12-18 12:57:37,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:37,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386929347] [2019-12-18 12:57:37,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:37,461 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 12:57:37,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386929347] [2019-12-18 12:57:37,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:37,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:57:37,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771018507] [2019-12-18 12:57:37,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:37,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:37,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:37,463 INFO L87 Difference]: Start difference. First operand 23015 states and 69066 transitions. Second operand 11 states. [2019-12-18 12:57:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:38,475 INFO L93 Difference]: Finished difference Result 34841 states and 102801 transitions. [2019-12-18 12:57:38,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:57:38,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-18 12:57:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:38,522 INFO L225 Difference]: With dead ends: 34841 [2019-12-18 12:57:38,523 INFO L226 Difference]: Without dead ends: 34841 [2019-12-18 12:57:38,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:57:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34841 states. [2019-12-18 12:57:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34841 to 22791. [2019-12-18 12:57:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22791 states. [2019-12-18 12:57:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22791 states to 22791 states and 68305 transitions. [2019-12-18 12:57:38,957 INFO L78 Accepts]: Start accepts. Automaton has 22791 states and 68305 transitions. Word has length 64 [2019-12-18 12:57:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:38,958 INFO L462 AbstractCegarLoop]: Abstraction has 22791 states and 68305 transitions. [2019-12-18 12:57:38,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 22791 states and 68305 transitions. [2019-12-18 12:57:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:38,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:38,983 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 12:57:38,983 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:38,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:38,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2110292585, now seen corresponding path program 6 times [2019-12-18 12:57:38,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:38,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042772289] [2019-12-18 12:57:38,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:39,142 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 12:57:39,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042772289] [2019-12-18 12:57:39,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:39,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:39,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184902861] [2019-12-18 12:57:39,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:39,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:39,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:39,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:39,144 INFO L87 Difference]: Start difference. First operand 22791 states and 68305 transitions. Second operand 11 states. [2019-12-18 12:57:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:40,044 INFO L93 Difference]: Finished difference Result 27030 states and 79610 transitions. [2019-12-18 12:57:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:57:40,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-18 12:57:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:40,076 INFO L225 Difference]: With dead ends: 27030 [2019-12-18 12:57:40,077 INFO L226 Difference]: Without dead ends: 22982 [2019-12-18 12:57:40,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:57:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22982 states. [2019-12-18 12:57:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22982 to 21115. [2019-12-18 12:57:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21115 states. [2019-12-18 12:57:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21115 states to 21115 states and 62977 transitions. [2019-12-18 12:57:40,534 INFO L78 Accepts]: Start accepts. Automaton has 21115 states and 62977 transitions. Word has length 64 [2019-12-18 12:57:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:40,534 INFO L462 AbstractCegarLoop]: Abstraction has 21115 states and 62977 transitions. [2019-12-18 12:57:40,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 21115 states and 62977 transitions. [2019-12-18 12:57:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:57:40,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:40,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, 1, 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 12:57:40,556 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash 117680357, now seen corresponding path program 7 times [2019-12-18 12:57:40,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:40,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807017438] [2019-12-18 12:57:40,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:40,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807017438] [2019-12-18 12:57:40,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:40,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:40,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568589594] [2019-12-18 12:57:40,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:40,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:40,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:40,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:40,594 INFO L87 Difference]: Start difference. First operand 21115 states and 62977 transitions. Second operand 3 states. [2019-12-18 12:57:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:40,651 INFO L93 Difference]: Finished difference Result 21114 states and 62975 transitions. [2019-12-18 12:57:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:40,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:57:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:40,680 INFO L225 Difference]: With dead ends: 21114 [2019-12-18 12:57:40,680 INFO L226 Difference]: Without dead ends: 21114 [2019-12-18 12:57:40,680 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 12:57:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21114 states. [2019-12-18 12:57:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21114 to 17771. [2019-12-18 12:57:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17771 states. [2019-12-18 12:57:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17771 states to 17771 states and 53510 transitions. [2019-12-18 12:57:40,971 INFO L78 Accepts]: Start accepts. Automaton has 17771 states and 53510 transitions. Word has length 64 [2019-12-18 12:57:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:40,971 INFO L462 AbstractCegarLoop]: Abstraction has 17771 states and 53510 transitions. [2019-12-18 12:57:40,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 17771 states and 53510 transitions. [2019-12-18 12:57:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:40,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:40,989 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 12:57:40,989 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash 51203325, now seen corresponding path program 1 times [2019-12-18 12:57:40,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:40,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827432772] [2019-12-18 12:57:40,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:41,062 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 12:57:41,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827432772] [2019-12-18 12:57:41,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:41,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:57:41,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957986589] [2019-12-18 12:57:41,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:57:41,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:41,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:57:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:41,063 INFO L87 Difference]: Start difference. First operand 17771 states and 53510 transitions. Second operand 7 states. [2019-12-18 12:57:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:41,895 INFO L93 Difference]: Finished difference Result 24274 states and 71925 transitions. [2019-12-18 12:57:41,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:57:41,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:57:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:41,930 INFO L225 Difference]: With dead ends: 24274 [2019-12-18 12:57:41,930 INFO L226 Difference]: Without dead ends: 24274 [2019-12-18 12:57:41,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24274 states. [2019-12-18 12:57:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24274 to 17561. [2019-12-18 12:57:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17561 states. [2019-12-18 12:57:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17561 states to 17561 states and 52945 transitions. [2019-12-18 12:57:42,241 INFO L78 Accepts]: Start accepts. Automaton has 17561 states and 52945 transitions. Word has length 65 [2019-12-18 12:57:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:42,241 INFO L462 AbstractCegarLoop]: Abstraction has 17561 states and 52945 transitions. [2019-12-18 12:57:42,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:57:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 17561 states and 52945 transitions. [2019-12-18 12:57:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:42,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:42,259 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash -330874671, now seen corresponding path program 2 times [2019-12-18 12:57:42,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:42,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894404148] [2019-12-18 12:57:42,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:42,393 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 12:57:42,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894404148] [2019-12-18 12:57:42,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:42,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:42,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710134428] [2019-12-18 12:57:42,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:42,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:42,394 INFO L87 Difference]: Start difference. First operand 17561 states and 52945 transitions. Second operand 11 states. [2019-12-18 12:57:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:43,197 INFO L93 Difference]: Finished difference Result 21358 states and 63600 transitions. [2019-12-18 12:57:43,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:57:43,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:57:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:43,223 INFO L225 Difference]: With dead ends: 21358 [2019-12-18 12:57:43,223 INFO L226 Difference]: Without dead ends: 18110 [2019-12-18 12:57:43,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:57:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18110 states. [2019-12-18 12:57:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18110 to 14549. [2019-12-18 12:57:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14549 states. [2019-12-18 12:57:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14549 states to 14549 states and 44102 transitions. [2019-12-18 12:57:43,473 INFO L78 Accepts]: Start accepts. Automaton has 14549 states and 44102 transitions. Word has length 65 [2019-12-18 12:57:43,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:43,473 INFO L462 AbstractCegarLoop]: Abstraction has 14549 states and 44102 transitions. [2019-12-18 12:57:43,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 14549 states and 44102 transitions. [2019-12-18 12:57:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:57:43,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:43,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:43,487 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:43,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:43,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1019867375, now seen corresponding path program 3 times [2019-12-18 12:57:43,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:43,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237629807] [2019-12-18 12:57:43,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:43,561 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 12:57:43,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237629807] [2019-12-18 12:57:43,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:43,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:43,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162748894] [2019-12-18 12:57:43,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:43,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:43,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:43,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:43,563 INFO L87 Difference]: Start difference. First operand 14549 states and 44102 transitions. Second operand 4 states. [2019-12-18 12:57:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:43,720 INFO L93 Difference]: Finished difference Result 17403 states and 52419 transitions. [2019-12-18 12:57:43,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:43,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 12:57:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:43,762 INFO L225 Difference]: With dead ends: 17403 [2019-12-18 12:57:43,762 INFO L226 Difference]: Without dead ends: 17403 [2019-12-18 12:57:43,763 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 12:57:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17403 states. [2019-12-18 12:57:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17403 to 14657. [2019-12-18 12:57:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14657 states. [2019-12-18 12:57:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14657 states to 14657 states and 44541 transitions. [2019-12-18 12:57:44,186 INFO L78 Accepts]: Start accepts. Automaton has 14657 states and 44541 transitions. Word has length 65 [2019-12-18 12:57:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:44,186 INFO L462 AbstractCegarLoop]: Abstraction has 14657 states and 44541 transitions. [2019-12-18 12:57:44,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 14657 states and 44541 transitions. [2019-12-18 12:57:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:57:44,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:44,202 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 12:57:44,202 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 1 times [2019-12-18 12:57:44,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:44,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047489784] [2019-12-18 12:57:44,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:44,691 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 12:57:44,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047489784] [2019-12-18 12:57:44,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:44,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 12:57:44,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084018375] [2019-12-18 12:57:44,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 12:57:44,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:44,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 12:57:44,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:57:44,692 INFO L87 Difference]: Start difference. First operand 14657 states and 44541 transitions. Second operand 17 states. [2019-12-18 12:57:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:47,319 INFO L93 Difference]: Finished difference Result 18821 states and 56019 transitions. [2019-12-18 12:57:47,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 12:57:47,320 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 12:57:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:47,455 INFO L225 Difference]: With dead ends: 18821 [2019-12-18 12:57:47,455 INFO L226 Difference]: Without dead ends: 18322 [2019-12-18 12:57:47,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=321, Invalid=1401, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 12:57:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18322 states. [2019-12-18 12:57:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18322 to 14579. [2019-12-18 12:57:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14579 states. [2019-12-18 12:57:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14579 states to 14579 states and 44337 transitions. [2019-12-18 12:57:47,697 INFO L78 Accepts]: Start accepts. Automaton has 14579 states and 44337 transitions. Word has length 66 [2019-12-18 12:57:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:47,697 INFO L462 AbstractCegarLoop]: Abstraction has 14579 states and 44337 transitions. [2019-12-18 12:57:47,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 12:57:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 14579 states and 44337 transitions. [2019-12-18 12:57:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:57:47,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:47,712 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 12:57:47,713 INFO L410 AbstractCegarLoop]: === Iteration 51 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2033523235, now seen corresponding path program 2 times [2019-12-18 12:57:47,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:47,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009858436] [2019-12-18 12:57:47,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:47,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009858436] [2019-12-18 12:57:47,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:47,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:47,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212252580] [2019-12-18 12:57:47,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:57:47,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:47,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:57:47,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:57:47,851 INFO L87 Difference]: Start difference. First operand 14579 states and 44337 transitions. Second operand 11 states. [2019-12-18 12:57:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:48,940 INFO L93 Difference]: Finished difference Result 17472 states and 52316 transitions. [2019-12-18 12:57:48,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:57:48,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:57:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:48,965 INFO L225 Difference]: With dead ends: 17472 [2019-12-18 12:57:48,965 INFO L226 Difference]: Without dead ends: 17081 [2019-12-18 12:57:48,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:57:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17081 states. [2019-12-18 12:57:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17081 to 14395. [2019-12-18 12:57:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14395 states. [2019-12-18 12:57:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14395 states to 14395 states and 43871 transitions. [2019-12-18 12:57:49,216 INFO L78 Accepts]: Start accepts. Automaton has 14395 states and 43871 transitions. Word has length 66 [2019-12-18 12:57:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:49,216 INFO L462 AbstractCegarLoop]: Abstraction has 14395 states and 43871 transitions. [2019-12-18 12:57:49,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:57:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 14395 states and 43871 transitions. [2019-12-18 12:57:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:57:49,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:49,232 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 12:57:49,233 INFO L410 AbstractCegarLoop]: === Iteration 52 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:49,233 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 3 times [2019-12-18 12:57:49,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:49,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004131748] [2019-12-18 12:57:49,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:57:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:57:49,335 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:57:49,336 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:57:49,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= 0 |v_ULTIMATE.start_main_~#t657~0.offset_16|) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t657~0.base_22|) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t657~0.base_22| 4)) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t657~0.base_22| 1) |v_#valid_69|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t657~0.base_22|)) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t657~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t657~0.base_22|) |v_ULTIMATE.start_main_~#t657~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t658~0.offset=|v_ULTIMATE.start_main_~#t658~0.offset_14|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, ULTIMATE.start_main_~#t659~0.base=|v_ULTIMATE.start_main_~#t659~0.base_17|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_~#t658~0.base=|v_ULTIMATE.start_main_~#t658~0.base_19|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, ULTIMATE.start_main_~#t657~0.base=|v_ULTIMATE.start_main_~#t657~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t657~0.offset=|v_ULTIMATE.start_main_~#t657~0.offset_16|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ULTIMATE.start_main_~#t659~0.offset=|v_ULTIMATE.start_main_~#t659~0.offset_14|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t658~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t659~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t658~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t657~0.base, ULTIMATE.start_main_~#t657~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t659~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:57:49,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:57:49,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t658~0.base_11| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t658~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t658~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t658~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t658~0.base_11|) |v_ULTIMATE.start_main_~#t658~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t658~0.base_11| 1) |v_#valid_31|) (= 0 |v_ULTIMATE.start_main_~#t658~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t658~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t658~0.offset=|v_ULTIMATE.start_main_~#t658~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t658~0.base=|v_ULTIMATE.start_main_~#t658~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t658~0.offset, ULTIMATE.start_main_~#t658~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:57:49,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t659~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t659~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t659~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t659~0.base_12|) |v_ULTIMATE.start_main_~#t659~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t659~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t659~0.base_12| 0)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t659~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t659~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t659~0.offset=|v_ULTIMATE.start_main_~#t659~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t659~0.base=|v_ULTIMATE.start_main_~#t659~0.base_12|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t659~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t659~0.base, #length] because there is no mapped edge [2019-12-18 12:57:49,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-231741572 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-231741572 256) 0)) (.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out-231741572| |P1Thread1of1ForFork2_#t~ite9_Out-231741572|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out-231741572| ~z$w_buff1~0_In-231741572)) (and (or .cse2 .cse0) (= ~z~0_In-231741572 |P1Thread1of1ForFork2_#t~ite9_Out-231741572|) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-231741572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-231741572, ~z$w_buff1~0=~z$w_buff1~0_In-231741572, ~z~0=~z~0_In-231741572} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-231741572|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-231741572, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-231741572|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-231741572, ~z$w_buff1~0=~z$w_buff1~0_In-231741572, ~z~0=~z~0_In-231741572} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:57:49,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-371632376 256)))) (or (and (= ~z$w_buff1~0_In-371632376 |P2Thread1of1ForFork0_#t~ite23_Out-371632376|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-371632376 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-371632376 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-371632376 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-371632376 256))))) (= |P2Thread1of1ForFork0_#t~ite23_Out-371632376| |P2Thread1of1ForFork0_#t~ite24_Out-371632376|)) (and (not .cse0) (= ~z$w_buff1~0_In-371632376 |P2Thread1of1ForFork0_#t~ite24_Out-371632376|) (= |P2Thread1of1ForFork0_#t~ite23_In-371632376| |P2Thread1of1ForFork0_#t~ite23_Out-371632376|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-371632376, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-371632376, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-371632376|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-371632376, ~z$w_buff1~0=~z$w_buff1~0_In-371632376, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-371632376, ~weak$$choice2~0=~weak$$choice2~0_In-371632376} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-371632376, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-371632376|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-371632376, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-371632376|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-371632376, ~z$w_buff1~0=~z$w_buff1~0_In-371632376, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-371632376, ~weak$$choice2~0=~weak$$choice2~0_In-371632376} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:57:49,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1219968154 256))) (.cse4 (= (mod ~weak$$choice2~0_In-1219968154 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1219968154 256))) (.cse5 (= |P2Thread1of1ForFork0_#t~ite29_Out-1219968154| |P2Thread1of1ForFork0_#t~ite30_Out-1219968154|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1219968154 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1219968154 256) 0))) (or (and (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out-1219968154| ~z$w_buff1_used~0_In-1219968154) (or (and .cse0 .cse1) (and .cse2 .cse1) .cse3) .cse4 .cse5) (and (= |P2Thread1of1ForFork0_#t~ite30_Out-1219968154| ~z$w_buff1_used~0_In-1219968154) (= |P2Thread1of1ForFork0_#t~ite29_Out-1219968154| |P2Thread1of1ForFork0_#t~ite29_In-1219968154|) (not .cse4))) (= |P2Thread1of1ForFork0_#t~ite28_In-1219968154| |P2Thread1of1ForFork0_#t~ite28_Out-1219968154|)) (let ((.cse6 (not .cse1))) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1219968154| 0) (not .cse3) .cse4 (or (not .cse0) .cse6) .cse5 (= |P2Thread1of1ForFork0_#t~ite29_Out-1219968154| |P2Thread1of1ForFork0_#t~ite28_Out-1219968154|) (or (not .cse2) .cse6))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-1219968154|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1219968154, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1219968154, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1219968154, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1219968154, ~weak$$choice2~0=~weak$$choice2~0_In-1219968154, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1219968154|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1219968154|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1219968154, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1219968154, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1219968154, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1219968154, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1219968154|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1219968154|, ~weak$$choice2~0=~weak$$choice2~0_In-1219968154} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:57:49,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:57:49,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:57:49,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1948733812| |P2Thread1of1ForFork0_#t~ite39_Out1948733812|)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1948733812 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1948733812 256)))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1948733812| ~z$w_buff1~0_In1948733812)) (and .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1948733812| ~z~0_In1948733812) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1948733812, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1948733812, ~z$w_buff1~0=~z$w_buff1~0_In1948733812, ~z~0=~z~0_In1948733812} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1948733812|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1948733812|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1948733812, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1948733812, ~z$w_buff1~0=~z$w_buff1~0_In1948733812, ~z~0=~z~0_In1948733812} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:57:49,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1092965914 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1092965914 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1092965914| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1092965914| ~z$w_buff0_used~0_In1092965914)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1092965914, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1092965914} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1092965914, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1092965914|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1092965914} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:57:49,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1561274319 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1561274319 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1561274319 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1561274319 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1561274319 |P2Thread1of1ForFork0_#t~ite41_Out1561274319|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1561274319|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1561274319, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1561274319, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1561274319, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1561274319} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1561274319, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1561274319, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1561274319, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1561274319, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1561274319|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:57:49,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1120811678 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1120811678 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1120811678| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1120811678| ~z$r_buff0_thd3~0_In1120811678) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1120811678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1120811678} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1120811678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1120811678, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1120811678|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:57:49,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In358547662 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In358547662 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In358547662 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In358547662 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out358547662| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite43_Out358547662| ~z$r_buff1_thd3~0_In358547662) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In358547662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In358547662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In358547662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In358547662} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out358547662|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In358547662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In358547662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In358547662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In358547662} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:57:49,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:57:49,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1405791537 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1405791537 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1405791537 |P0Thread1of1ForFork1_#t~ite5_Out-1405791537|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1405791537|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405791537, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1405791537} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1405791537|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405791537, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1405791537} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:57:49,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-1705109664 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1705109664 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1705109664 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1705109664 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1705109664| ~z$w_buff1_used~0_In-1705109664) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1705109664| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1705109664, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1705109664, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1705109664, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1705109664} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1705109664, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1705109664|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1705109664, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1705109664, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1705109664} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:57:49,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1405352889 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1405352889 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out-1405352889 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out-1405352889 ~z$r_buff0_thd1~0_In-1405352889)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405352889, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1405352889} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405352889, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1405352889|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1405352889} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:57:49,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-26649412 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-26649412 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-26649412 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-26649412 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-26649412| ~z$r_buff1_thd1~0_In-26649412)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-26649412| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-26649412, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-26649412, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-26649412, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-26649412} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-26649412|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-26649412, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-26649412, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-26649412, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-26649412} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:57:49,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:57:49,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-585184111 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-585184111 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-585184111|)) (and (= ~z$w_buff0_used~0_In-585184111 |P1Thread1of1ForFork2_#t~ite11_Out-585184111|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-585184111, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-585184111} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-585184111, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-585184111|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-585184111} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:57:49,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1957860564 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In1957860564 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1957860564 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1957860564 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1957860564|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1957860564 |P1Thread1of1ForFork2_#t~ite12_Out1957860564|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1957860564, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1957860564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1957860564, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1957860564} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1957860564, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1957860564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1957860564, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1957860564|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1957860564} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:57:49,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In460486293 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In460486293 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In460486293 |P1Thread1of1ForFork2_#t~ite13_Out460486293|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out460486293| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In460486293, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In460486293} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In460486293, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out460486293|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In460486293} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:57:49,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-2137007554 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-2137007554 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2137007554 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2137007554 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-2137007554| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out-2137007554| ~z$r_buff1_thd2~0_In-2137007554)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137007554, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2137007554, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137007554, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2137007554} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137007554, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2137007554, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137007554, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2137007554|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2137007554} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:57:49,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:57:49,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:57:49,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In165603225 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In165603225 256)))) (or (and (= ~z$w_buff1~0_In165603225 |ULTIMATE.start_main_#t~ite47_Out165603225|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In165603225 |ULTIMATE.start_main_#t~ite47_Out165603225|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In165603225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In165603225, ~z$w_buff1~0=~z$w_buff1~0_In165603225, ~z~0=~z~0_In165603225} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In165603225, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out165603225|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In165603225, ~z$w_buff1~0=~z$w_buff1~0_In165603225, ~z~0=~z~0_In165603225} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:57:49,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 12:57:49,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1759863203 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1759863203 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1759863203| ~z$w_buff0_used~0_In1759863203) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1759863203| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1759863203, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1759863203} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1759863203, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1759863203, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1759863203|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:57:49,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-762719611 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-762719611 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-762719611 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-762719611 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-762719611| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite50_Out-762719611| ~z$w_buff1_used~0_In-762719611) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-762719611, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-762719611, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-762719611, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-762719611} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-762719611|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-762719611, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-762719611, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-762719611, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-762719611} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:57:49,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In470386229 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In470386229 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out470386229|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In470386229 |ULTIMATE.start_main_#t~ite51_Out470386229|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In470386229, ~z$w_buff0_used~0=~z$w_buff0_used~0_In470386229} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In470386229, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out470386229|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In470386229} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:57:49,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1535689847 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1535689847 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1535689847 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1535689847 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1535689847|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1535689847 |ULTIMATE.start_main_#t~ite52_Out-1535689847|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1535689847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1535689847, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1535689847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1535689847} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1535689847|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1535689847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1535689847, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1535689847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1535689847} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:57:49,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:57:49,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:57:49 BasicIcfg [2019-12-18 12:57:49,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:57:49,466 INFO L168 Benchmark]: Toolchain (without parser) took 149926.35 ms. Allocated memory was 146.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 102.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 12:57:49,470 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.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 12:57:49,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.04 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.7 MB in the beginning and 157.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:57:49,471 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.06 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:57:49,471 INFO L168 Benchmark]: Boogie Preprocessor took 37.96 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:57:49,471 INFO L168 Benchmark]: RCFGBuilder took 860.42 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 102.8 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:57:49,472 INFO L168 Benchmark]: TraceAbstraction took 148158.71 ms. Allocated memory was 204.5 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 102.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 12:57:49,476 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.04 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.7 MB in the beginning and 157.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.06 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.96 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 860.42 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 102.8 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 148158.71 ms. Allocated memory was 204.5 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 102.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 147.8s, OverallIterations: 52, TraceHistogramMax: 1, AutomataDifference: 61.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 13582 SDtfs, 16746 SDslu, 43548 SDs, 0 SdLazy, 30071 SolverSat, 783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 141 SyntacticMatches, 57 SemanticMatches, 574 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 49.9s AutomataMinimizationTime, 51 MinimizatonAttempts, 555036 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2623 NumberOfCodeBlocks, 2623 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2506 ConstructedInterpolants, 0 QuantifiedInterpolants, 640976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 51 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...