/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:41:12,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:41:12,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:41:12,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:41:12,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:41:12,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:41:12,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:41:12,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:41:12,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:41:12,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:41:12,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:41:12,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:41:12,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:41:12,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:41:12,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:41:12,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:41:12,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:41:12,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:41:12,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:41:12,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:41:12,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:41:12,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:41:12,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:41:12,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:41:12,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:41:12,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:41:12,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:41:12,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:41:12,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:41:12,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:41:12,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:41:12,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:41:12,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:41:12,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:41:12,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:41:12,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:41:12,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:41:12,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:41:12,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:41:12,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:41:12,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:41:12,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:41:13,001 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:41:13,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:41:13,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:41:13,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:41:13,003 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:41:13,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:41:13,004 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:41:13,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:41:13,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:41:13,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:41:13,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:41:13,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:41:13,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:41:13,005 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:41:13,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:41:13,006 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:41:13,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:41:13,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:41:13,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:41:13,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:41:13,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:41:13,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:41:13,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:41:13,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:41:13,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:41:13,008 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:41:13,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:41:13,008 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:41:13,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:41:13,008 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:41:13,008 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:41:13,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:41:13,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:41:13,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:41:13,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:41:13,328 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:41:13,330 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i [2019-12-27 17:41:13,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4093836/fb87811ce63d4d2bad46d184defaa41d/FLAG1a139016f [2019-12-27 17:41:13,955 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:41:13,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i [2019-12-27 17:41:13,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4093836/fb87811ce63d4d2bad46d184defaa41d/FLAG1a139016f [2019-12-27 17:41:14,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4093836/fb87811ce63d4d2bad46d184defaa41d [2019-12-27 17:41:14,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:41:14,255 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:41:14,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:41:14,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:41:14,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:41:14,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:41:14" (1/1) ... [2019-12-27 17:41:14,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36da0348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:14, skipping insertion in model container [2019-12-27 17:41:14,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:41:14" (1/1) ... [2019-12-27 17:41:14,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:41:14,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:41:14,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:41:15,011 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:41:15,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:41:15,171 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:41:15,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15 WrapperNode [2019-12-27 17:41:15,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:41:15,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:41:15,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:41:15,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:41:15,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (1/1) ... [2019-12-27 17:41:15,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (1/1) ... [2019-12-27 17:41:15,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:41:15,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:41:15,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:41:15,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:41:15,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (1/1) ... [2019-12-27 17:41:15,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (1/1) ... [2019-12-27 17:41:15,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (1/1) ... [2019-12-27 17:41:15,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (1/1) ... [2019-12-27 17:41:15,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (1/1) ... [2019-12-27 17:41:15,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (1/1) ... [2019-12-27 17:41:15,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (1/1) ... [2019-12-27 17:41:15,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:41:15,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:41:15,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:41:15,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:41:15,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:41:15,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:41:15,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:41:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:41:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:41:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:41:15,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:41:15,412 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:41:15,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:41:15,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:41:15,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:41:15,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:41:15,417 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:41:16,596 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:41:16,596 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:41:16,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:41:16 BoogieIcfgContainer [2019-12-27 17:41:16,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:41:16,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:41:16,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:41:16,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:41:16,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:41:14" (1/3) ... [2019-12-27 17:41:16,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b775ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:41:16, skipping insertion in model container [2019-12-27 17:41:16,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:15" (2/3) ... [2019-12-27 17:41:16,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b775ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:41:16, skipping insertion in model container [2019-12-27 17:41:16,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:41:16" (3/3) ... [2019-12-27 17:41:16,613 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc.i [2019-12-27 17:41:16,623 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:41:16,623 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:41:16,634 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:41:16,635 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:41:16,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,804 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,806 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,819 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:16,837 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:41:16,859 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:41:16,860 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:41:16,860 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:41:16,860 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:41:16,860 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:41:16,860 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:41:16,860 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:41:16,861 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:41:16,883 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 17:41:16,885 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 17:41:17,066 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 17:41:17,067 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:41:17,103 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 17:41:17,190 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 17:41:17,326 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 17:41:17,326 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:41:17,349 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 17:41:17,397 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 17:41:17,398 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:41:22,554 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-12-27 17:41:24,666 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 17:41:24,771 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:41:24,882 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-27 17:41:24,882 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-27 17:41:24,888 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-27 17:41:39,138 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-27 17:41:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-27 17:41:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:41:39,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:39,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:41:39,148 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:39,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:39,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-27 17:41:39,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:39,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287745231] [2019-12-27 17:41:39,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:39,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287745231] [2019-12-27 17:41:39,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:39,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:41:39,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2111637350] [2019-12-27 17:41:39,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:39,405 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:39,416 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:41:39,416 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:39,420 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:39,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:39,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:39,435 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-27 17:41:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:40,957 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-27 17:41:40,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:40,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:41:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:44,591 INFO L225 Difference]: With dead ends: 116456 [2019-12-27 17:41:44,592 INFO L226 Difference]: Without dead ends: 114036 [2019-12-27 17:41:44,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-27 17:41:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-27 17:41:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-27 17:41:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-27 17:41:57,346 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-27 17:41:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:57,346 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-27 17:41:57,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:41:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-27 17:41:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:41:57,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:57,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:57,349 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:57,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:57,350 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-27 17:41:57,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:57,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285052256] [2019-12-27 17:41:57,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:57,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285052256] [2019-12-27 17:41:57,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:57,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:41:57,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1655537968] [2019-12-27 17:41:57,454 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:57,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:57,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:41:57,463 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:57,505 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:41:57,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:41:57,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:57,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:41:57,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:41:57,508 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 5 states. [2019-12-27 17:41:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:58,748 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-27 17:41:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:41:58,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 17:41:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:59,425 INFO L225 Difference]: With dead ends: 152998 [2019-12-27 17:41:59,426 INFO L226 Difference]: Without dead ends: 152998 [2019-12-27 17:41:59,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:10,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-27 17:42:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-27 17:42:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-27 17:42:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-27 17:42:13,722 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-27 17:42:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:13,722 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-27 17:42:13,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-27 17:42:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:42:13,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:13,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:13,728 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:13,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:13,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-27 17:42:13,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:13,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061752493] [2019-12-27 17:42:13,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:13,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061752493] [2019-12-27 17:42:13,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:13,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:42:13,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2127698736] [2019-12-27 17:42:13,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:13,834 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:13,835 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:42:13,835 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:13,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:13,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:42:13,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:42:13,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:42:13,838 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-27 17:42:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:20,201 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-27 17:42:20,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:20,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:42:20,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:20,681 INFO L225 Difference]: With dead ends: 198503 [2019-12-27 17:42:20,681 INFO L226 Difference]: Without dead ends: 198503 [2019-12-27 17:42:20,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-27 17:42:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-27 17:42:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-27 17:42:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-27 17:42:31,596 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-27 17:42:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:31,597 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-27 17:42:31,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:42:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-27 17:42:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:42:31,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:31,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:31,605 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:31,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-27 17:42:31,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:31,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209918879] [2019-12-27 17:42:31,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:31,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209918879] [2019-12-27 17:42:31,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:31,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:42:31,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1236057465] [2019-12-27 17:42:31,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:31,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:31,752 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 17:42:31,752 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:31,856 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:42:31,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:42:31,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:31,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:42:31,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:31,857 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 8 states. [2019-12-27 17:42:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:40,199 INFO L93 Difference]: Finished difference Result 252658 states and 902047 transitions. [2019-12-27 17:42:40,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:42:40,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-27 17:42:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:40,812 INFO L225 Difference]: With dead ends: 252658 [2019-12-27 17:42:40,812 INFO L226 Difference]: Without dead ends: 252658 [2019-12-27 17:42:40,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:42:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252658 states. [2019-12-27 17:42:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252658 to 183475. [2019-12-27 17:42:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183475 states. [2019-12-27 17:42:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183475 states to 183475 states and 667588 transitions. [2019-12-27 17:42:53,506 INFO L78 Accepts]: Start accepts. Automaton has 183475 states and 667588 transitions. Word has length 17 [2019-12-27 17:42:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:53,506 INFO L462 AbstractCegarLoop]: Abstraction has 183475 states and 667588 transitions. [2019-12-27 17:42:53,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:42:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 183475 states and 667588 transitions. [2019-12-27 17:42:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:42:53,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:53,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:53,531 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:53,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:53,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-27 17:42:53,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:53,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614008779] [2019-12-27 17:42:53,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:53,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614008779] [2019-12-27 17:42:53,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:53,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:42:53,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1441370534] [2019-12-27 17:42:53,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:53,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:53,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 17:42:53,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:53,790 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:42:53,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:53,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:53,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:53,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:53,792 INFO L87 Difference]: Start difference. First operand 183475 states and 667588 transitions. Second operand 9 states. [2019-12-27 17:43:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:02,507 INFO L93 Difference]: Finished difference Result 255390 states and 912359 transitions. [2019-12-27 17:43:02,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:43:02,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 17:43:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:03,115 INFO L225 Difference]: With dead ends: 255390 [2019-12-27 17:43:03,115 INFO L226 Difference]: Without dead ends: 255390 [2019-12-27 17:43:03,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255390 states. [2019-12-27 17:43:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255390 to 240862. [2019-12-27 17:43:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240862 states. [2019-12-27 17:43:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240862 states to 240862 states and 862677 transitions. [2019-12-27 17:43:15,749 INFO L78 Accepts]: Start accepts. Automaton has 240862 states and 862677 transitions. Word has length 25 [2019-12-27 17:43:15,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:15,751 INFO L462 AbstractCegarLoop]: Abstraction has 240862 states and 862677 transitions. [2019-12-27 17:43:15,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand 240862 states and 862677 transitions. [2019-12-27 17:43:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:43:15,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:15,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:15,773 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1942527613, now seen corresponding path program 1 times [2019-12-27 17:43:15,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:15,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625046480] [2019-12-27 17:43:15,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:15,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625046480] [2019-12-27 17:43:15,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:15,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:43:15,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1804278061] [2019-12-27 17:43:15,843 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:15,846 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:15,850 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:43:15,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:15,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:15,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:43:15,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:15,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:43:15,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:43:15,851 INFO L87 Difference]: Start difference. First operand 240862 states and 862677 transitions. Second operand 4 states. [2019-12-27 17:43:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:15,919 INFO L93 Difference]: Finished difference Result 14741 states and 40177 transitions. [2019-12-27 17:43:15,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:43:15,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 17:43:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:15,931 INFO L225 Difference]: With dead ends: 14741 [2019-12-27 17:43:15,932 INFO L226 Difference]: Without dead ends: 10693 [2019-12-27 17:43:15,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:43:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2019-12-27 17:43:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10653. [2019-12-27 17:43:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10653 states. [2019-12-27 17:43:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10653 states to 10653 states and 26288 transitions. [2019-12-27 17:43:16,055 INFO L78 Accepts]: Start accepts. Automaton has 10653 states and 26288 transitions. Word has length 25 [2019-12-27 17:43:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:16,055 INFO L462 AbstractCegarLoop]: Abstraction has 10653 states and 26288 transitions. [2019-12-27 17:43:16,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:43:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 10653 states and 26288 transitions. [2019-12-27 17:43:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 17:43:16,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:16,060 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-27 17:43:16,060 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-27 17:43:16,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:16,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027342572] [2019-12-27 17:43:16,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:16,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027342572] [2019-12-27 17:43:16,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:16,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:43:16,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [203966730] [2019-12-27 17:43:16,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:16,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:16,186 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 170 transitions. [2019-12-27 17:43:16,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:18,146 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:43:18,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:43:18,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:18,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:43:18,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:18,148 INFO L87 Difference]: Start difference. First operand 10653 states and 26288 transitions. Second operand 9 states. [2019-12-27 17:43:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:19,282 INFO L93 Difference]: Finished difference Result 11962 states and 29091 transitions. [2019-12-27 17:43:19,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:43:19,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 17:43:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:19,298 INFO L225 Difference]: With dead ends: 11962 [2019-12-27 17:43:19,298 INFO L226 Difference]: Without dead ends: 11914 [2019-12-27 17:43:19,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:43:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2019-12-27 17:43:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11586. [2019-12-27 17:43:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-27 17:43:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 28348 transitions. [2019-12-27 17:43:19,430 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 28348 transitions. Word has length 38 [2019-12-27 17:43:19,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:19,430 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 28348 transitions. [2019-12-27 17:43:19,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 28348 transitions. [2019-12-27 17:43:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:43:19,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:19,437 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] [2019-12-27 17:43:19,437 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:19,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-27 17:43:19,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:19,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403860670] [2019-12-27 17:43:19,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:19,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403860670] [2019-12-27 17:43:19,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:19,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:19,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074920064] [2019-12-27 17:43:19,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:19,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:19,659 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 206 transitions. [2019-12-27 17:43:19,660 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:19,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:43:19,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:43:19,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:43:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:43:19,745 INFO L87 Difference]: Start difference. First operand 11586 states and 28348 transitions. Second operand 10 states. [2019-12-27 17:43:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:21,294 INFO L93 Difference]: Finished difference Result 13314 states and 32232 transitions. [2019-12-27 17:43:21,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:43:21,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-12-27 17:43:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:21,312 INFO L225 Difference]: With dead ends: 13314 [2019-12-27 17:43:21,312 INFO L226 Difference]: Without dead ends: 13314 [2019-12-27 17:43:21,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:43:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13314 states. [2019-12-27 17:43:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13314 to 11791. [2019-12-27 17:43:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-27 17:43:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-27 17:43:21,470 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-27 17:43:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:21,470 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-27 17:43:21,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:43:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-27 17:43:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:43:21,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:21,479 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] [2019-12-27 17:43:21,479 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:21,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-27 17:43:21,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:21,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174798570] [2019-12-27 17:43:21,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:21,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-27 17:43:21,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174798570] [2019-12-27 17:43:21,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:21,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:21,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1633444986] [2019-12-27 17:43:21,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:21,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:21,616 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-27 17:43:21,617 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:21,617 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:21,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:43:21,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:21,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:43:21,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:43:21,618 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-27 17:43:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:22,542 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-27 17:43:22,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:43:22,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 17:43:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:22,560 INFO L225 Difference]: With dead ends: 13152 [2019-12-27 17:43:22,561 INFO L226 Difference]: Without dead ends: 13152 [2019-12-27 17:43:22,561 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-27 17:43:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-27 17:43:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-27 17:43:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-27 17:43:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-27 17:43:22,772 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-27 17:43:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:22,772 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-27 17:43:22,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:43:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-27 17:43:22,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:43:22,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:22,782 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] [2019-12-27 17:43:22,782 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:22,783 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-27 17:43:22,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:22,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869470740] [2019-12-27 17:43:22,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:22,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-27 17:43:22,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869470740] [2019-12-27 17:43:22,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:22,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:43:22,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520848041] [2019-12-27 17:43:22,875 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:22,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:22,914 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-27 17:43:22,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:22,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:22,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:43:22,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:43:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:43:22,916 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-27 17:43:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:22,979 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-27 17:43:22,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:43:22,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 17:43:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:22,985 INFO L225 Difference]: With dead ends: 5405 [2019-12-27 17:43:22,985 INFO L226 Difference]: Without dead ends: 5151 [2019-12-27 17:43:22,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:43:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-27 17:43:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-27 17:43:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-27 17:43:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-27 17:43:23,042 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 58 [2019-12-27 17:43:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:23,042 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-27 17:43:23,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:43:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-27 17:43:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:23,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:23,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:23,049 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-27 17:43:23,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:23,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217976849] [2019-12-27 17:43:23,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:23,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-27 17:43:23,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217976849] [2019-12-27 17:43:23,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:23,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:43:23,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58951841] [2019-12-27 17:43:23,151 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:23,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:23,313 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-27 17:43:23,313 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:23,314 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:23,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:23,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:23,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:23,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:23,315 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 6 states. [2019-12-27 17:43:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:24,104 INFO L93 Difference]: Finished difference Result 6626 states and 15449 transitions. [2019-12-27 17:43:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:43:24,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:43:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:24,113 INFO L225 Difference]: With dead ends: 6626 [2019-12-27 17:43:24,113 INFO L226 Difference]: Without dead ends: 6626 [2019-12-27 17:43:24,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:43:24,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-27 17:43:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6177. [2019-12-27 17:43:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6177 states. [2019-12-27 17:43:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 14495 transitions. [2019-12-27 17:43:24,185 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 14495 transitions. Word has length 94 [2019-12-27 17:43:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:24,185 INFO L462 AbstractCegarLoop]: Abstraction has 6177 states and 14495 transitions. [2019-12-27 17:43:24,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 14495 transitions. [2019-12-27 17:43:24,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:24,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:24,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:24,194 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:24,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:24,194 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-27 17:43:24,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:24,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742644947] [2019-12-27 17:43:24,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:24,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742644947] [2019-12-27 17:43:24,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:24,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:43:24,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1533377228] [2019-12-27 17:43:24,315 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:24,371 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:24,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 202 transitions. [2019-12-27 17:43:24,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:24,680 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:43:24,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:43:24,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:24,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:43:24,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:24,681 INFO L87 Difference]: Start difference. First operand 6177 states and 14495 transitions. Second operand 8 states. [2019-12-27 17:43:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:26,800 INFO L93 Difference]: Finished difference Result 12997 states and 28624 transitions. [2019-12-27 17:43:26,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:43:26,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 17:43:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:26,819 INFO L225 Difference]: With dead ends: 12997 [2019-12-27 17:43:26,819 INFO L226 Difference]: Without dead ends: 12997 [2019-12-27 17:43:26,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:43:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12997 states. [2019-12-27 17:43:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12997 to 10216. [2019-12-27 17:43:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10216 states. [2019-12-27 17:43:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10216 states to 10216 states and 22995 transitions. [2019-12-27 17:43:27,012 INFO L78 Accepts]: Start accepts. Automaton has 10216 states and 22995 transitions. Word has length 94 [2019-12-27 17:43:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:27,012 INFO L462 AbstractCegarLoop]: Abstraction has 10216 states and 22995 transitions. [2019-12-27 17:43:27,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:43:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 10216 states and 22995 transitions. [2019-12-27 17:43:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:27,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:27,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:27,031 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-27 17:43:27,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:27,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839290988] [2019-12-27 17:43:27,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:27,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839290988] [2019-12-27 17:43:27,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:27,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:27,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [88608271] [2019-12-27 17:43:27,145 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:27,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:27,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 185 transitions. [2019-12-27 17:43:27,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:27,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:43:27,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:43:27,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:27,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:43:27,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:43:27,309 INFO L87 Difference]: Start difference. First operand 10216 states and 22995 transitions. Second operand 5 states. [2019-12-27 17:43:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:27,772 INFO L93 Difference]: Finished difference Result 10999 states and 24590 transitions. [2019-12-27 17:43:27,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:43:27,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 17:43:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:27,784 INFO L225 Difference]: With dead ends: 10999 [2019-12-27 17:43:27,784 INFO L226 Difference]: Without dead ends: 10999 [2019-12-27 17:43:27,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10999 states. [2019-12-27 17:43:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10999 to 10435. [2019-12-27 17:43:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10435 states. [2019-12-27 17:43:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10435 states to 10435 states and 23490 transitions. [2019-12-27 17:43:27,937 INFO L78 Accepts]: Start accepts. Automaton has 10435 states and 23490 transitions. Word has length 94 [2019-12-27 17:43:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:27,937 INFO L462 AbstractCegarLoop]: Abstraction has 10435 states and 23490 transitions. [2019-12-27 17:43:27,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:43:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 10435 states and 23490 transitions. [2019-12-27 17:43:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:27,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:27,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:27,950 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:27,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:27,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-27 17:43:27,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:27,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587034203] [2019-12-27 17:43:27,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:28,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587034203] [2019-12-27 17:43:28,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:28,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:43:28,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [437463250] [2019-12-27 17:43:28,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:28,089 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:28,330 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 240 transitions. [2019-12-27 17:43:28,330 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:28,331 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:28,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:28,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:28,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:28,333 INFO L87 Difference]: Start difference. First operand 10435 states and 23490 transitions. Second operand 6 states. [2019-12-27 17:43:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:28,958 INFO L93 Difference]: Finished difference Result 10825 states and 24231 transitions. [2019-12-27 17:43:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:43:28,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:43:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:28,973 INFO L225 Difference]: With dead ends: 10825 [2019-12-27 17:43:28,974 INFO L226 Difference]: Without dead ends: 10825 [2019-12-27 17:43:28,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-27 17:43:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10825 states. [2019-12-27 17:43:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10825 to 10549. [2019-12-27 17:43:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10549 states. [2019-12-27 17:43:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10549 states to 10549 states and 23717 transitions. [2019-12-27 17:43:29,180 INFO L78 Accepts]: Start accepts. Automaton has 10549 states and 23717 transitions. Word has length 94 [2019-12-27 17:43:29,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:29,182 INFO L462 AbstractCegarLoop]: Abstraction has 10549 states and 23717 transitions. [2019-12-27 17:43:29,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10549 states and 23717 transitions. [2019-12-27 17:43:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:29,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:29,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:29,198 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:29,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:29,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-27 17:43:29,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:29,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558295905] [2019-12-27 17:43:29,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:29,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558295905] [2019-12-27 17:43:29,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:29,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:43:29,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [987155593] [2019-12-27 17:43:29,353 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:29,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:29,660 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 232 transitions. [2019-12-27 17:43:29,660 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:29,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:29,693 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:43:29,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:43:29,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:29,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:43:29,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:29,694 INFO L87 Difference]: Start difference. First operand 10549 states and 23717 transitions. Second operand 9 states. [2019-12-27 17:43:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:32,712 INFO L93 Difference]: Finished difference Result 38511 states and 86529 transitions. [2019-12-27 17:43:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 17:43:32,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 17:43:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:32,755 INFO L225 Difference]: With dead ends: 38511 [2019-12-27 17:43:32,755 INFO L226 Difference]: Without dead ends: 38511 [2019-12-27 17:43:32,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:43:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38511 states. [2019-12-27 17:43:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38511 to 15171. [2019-12-27 17:43:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15171 states. [2019-12-27 17:43:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15171 states to 15171 states and 34723 transitions. [2019-12-27 17:43:33,047 INFO L78 Accepts]: Start accepts. Automaton has 15171 states and 34723 transitions. Word has length 94 [2019-12-27 17:43:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:33,047 INFO L462 AbstractCegarLoop]: Abstraction has 15171 states and 34723 transitions. [2019-12-27 17:43:33,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 15171 states and 34723 transitions. [2019-12-27 17:43:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:33,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:33,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:33,062 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:33,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:33,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1949821147, now seen corresponding path program 6 times [2019-12-27 17:43:33,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:33,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796310312] [2019-12-27 17:43:33,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:33,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796310312] [2019-12-27 17:43:33,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:33,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:43:33,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1166776747] [2019-12-27 17:43:33,229 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:33,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:33,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 210 transitions. [2019-12-27 17:43:33,516 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:33,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:33,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:43:33,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:43:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:33,525 INFO L87 Difference]: Start difference. First operand 15171 states and 34723 transitions. Second operand 9 states. [2019-12-27 17:43:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:34,321 INFO L93 Difference]: Finished difference Result 24729 states and 56036 transitions. [2019-12-27 17:43:34,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:43:34,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 17:43:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:34,346 INFO L225 Difference]: With dead ends: 24729 [2019-12-27 17:43:34,346 INFO L226 Difference]: Without dead ends: 20642 [2019-12-27 17:43:34,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:43:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20642 states. [2019-12-27 17:43:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20642 to 17506. [2019-12-27 17:43:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17506 states. [2019-12-27 17:43:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17506 states to 17506 states and 39808 transitions. [2019-12-27 17:43:34,565 INFO L78 Accepts]: Start accepts. Automaton has 17506 states and 39808 transitions. Word has length 94 [2019-12-27 17:43:34,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:34,565 INFO L462 AbstractCegarLoop]: Abstraction has 17506 states and 39808 transitions. [2019-12-27 17:43:34,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 17506 states and 39808 transitions. [2019-12-27 17:43:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:34,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:34,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:34,586 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:34,586 INFO L82 PathProgramCache]: Analyzing trace with hash 644265771, now seen corresponding path program 7 times [2019-12-27 17:43:34,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:34,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797610607] [2019-12-27 17:43:34,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:34,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-27 17:43:34,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797610607] [2019-12-27 17:43:34,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:34,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:43:34,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [331534878] [2019-12-27 17:43:34,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:34,732 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:34,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 175 transitions. [2019-12-27 17:43:34,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:35,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:43:35,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:35,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:35,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:35,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:35,040 INFO L87 Difference]: Start difference. First operand 17506 states and 39808 transitions. Second operand 6 states. [2019-12-27 17:43:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:35,692 INFO L93 Difference]: Finished difference Result 18442 states and 41645 transitions. [2019-12-27 17:43:35,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:43:35,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:43:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:35,713 INFO L225 Difference]: With dead ends: 18442 [2019-12-27 17:43:35,713 INFO L226 Difference]: Without dead ends: 18442 [2019-12-27 17:43:35,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18442 states. [2019-12-27 17:43:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18442 to 17445. [2019-12-27 17:43:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17445 states. [2019-12-27 17:43:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17445 states to 17445 states and 39663 transitions. [2019-12-27 17:43:35,915 INFO L78 Accepts]: Start accepts. Automaton has 17445 states and 39663 transitions. Word has length 94 [2019-12-27 17:43:35,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:35,915 INFO L462 AbstractCegarLoop]: Abstraction has 17445 states and 39663 transitions. [2019-12-27 17:43:35,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17445 states and 39663 transitions. [2019-12-27 17:43:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:35,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:35,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:35,936 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash 724908229, now seen corresponding path program 8 times [2019-12-27 17:43:35,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:35,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333839416] [2019-12-27 17:43:35,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:36,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333839416] [2019-12-27 17:43:36,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:36,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:43:36,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [75664083] [2019-12-27 17:43:36,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:36,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:36,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 200 transitions. [2019-12-27 17:43:36,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:36,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:36,394 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:43:36,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:43:36,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:36,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:43:36,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:36,396 INFO L87 Difference]: Start difference. First operand 17445 states and 39663 transitions. Second operand 9 states. [2019-12-27 17:43:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:39,069 INFO L93 Difference]: Finished difference Result 25296 states and 56170 transitions. [2019-12-27 17:43:39,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:43:39,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 17:43:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:39,100 INFO L225 Difference]: With dead ends: 25296 [2019-12-27 17:43:39,100 INFO L226 Difference]: Without dead ends: 25296 [2019-12-27 17:43:39,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-12-27 17:43:39,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25296 states. [2019-12-27 17:43:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25296 to 17462. [2019-12-27 17:43:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17462 states. [2019-12-27 17:43:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17462 states to 17462 states and 39726 transitions. [2019-12-27 17:43:39,354 INFO L78 Accepts]: Start accepts. Automaton has 17462 states and 39726 transitions. Word has length 94 [2019-12-27 17:43:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:39,355 INFO L462 AbstractCegarLoop]: Abstraction has 17462 states and 39726 transitions. [2019-12-27 17:43:39,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 17462 states and 39726 transitions. [2019-12-27 17:43:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:39,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:39,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:39,372 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:39,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1986577122, now seen corresponding path program 1 times [2019-12-27 17:43:39,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:39,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590326229] [2019-12-27 17:43:39,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:39,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590326229] [2019-12-27 17:43:39,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:39,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:43:39,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368745570] [2019-12-27 17:43:39,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:39,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:39,795 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 228 transitions. [2019-12-27 17:43:39,796 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:39,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:39,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:39,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:43:39,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:39,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:43:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:39,855 INFO L87 Difference]: Start difference. First operand 17462 states and 39726 transitions. Second operand 8 states. [2019-12-27 17:43:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:41,030 INFO L93 Difference]: Finished difference Result 19067 states and 42988 transitions. [2019-12-27 17:43:41,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:43:41,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-27 17:43:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:41,056 INFO L225 Difference]: With dead ends: 19067 [2019-12-27 17:43:41,056 INFO L226 Difference]: Without dead ends: 19067 [2019-12-27 17:43:41,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:43:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19067 states. [2019-12-27 17:43:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19067 to 17543. [2019-12-27 17:43:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17543 states. [2019-12-27 17:43:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17543 states to 17543 states and 39915 transitions. [2019-12-27 17:43:41,351 INFO L78 Accepts]: Start accepts. Automaton has 17543 states and 39915 transitions. Word has length 95 [2019-12-27 17:43:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:41,351 INFO L462 AbstractCegarLoop]: Abstraction has 17543 states and 39915 transitions. [2019-12-27 17:43:41,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:43:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 17543 states and 39915 transitions. [2019-12-27 17:43:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:41,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:41,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:41,370 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:41,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1103429564, now seen corresponding path program 2 times [2019-12-27 17:43:41,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:41,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919457646] [2019-12-27 17:43:41,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:41,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919457646] [2019-12-27 17:43:41,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:41,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:41,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969036643] [2019-12-27 17:43:41,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:41,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:41,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 185 transitions. [2019-12-27 17:43:41,784 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:41,786 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:43:41,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:43:41,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:41,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:43:41,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:41,787 INFO L87 Difference]: Start difference. First operand 17543 states and 39915 transitions. Second operand 9 states. [2019-12-27 17:43:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:43,312 INFO L93 Difference]: Finished difference Result 25547 states and 57857 transitions. [2019-12-27 17:43:43,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 17:43:43,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-27 17:43:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:43,341 INFO L225 Difference]: With dead ends: 25547 [2019-12-27 17:43:43,341 INFO L226 Difference]: Without dead ends: 25547 [2019-12-27 17:43:43,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:43:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25547 states. [2019-12-27 17:43:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25547 to 20431. [2019-12-27 17:43:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20431 states. [2019-12-27 17:43:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20431 states to 20431 states and 46685 transitions. [2019-12-27 17:43:43,607 INFO L78 Accepts]: Start accepts. Automaton has 20431 states and 46685 transitions. Word has length 95 [2019-12-27 17:43:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:43,607 INFO L462 AbstractCegarLoop]: Abstraction has 20431 states and 46685 transitions. [2019-12-27 17:43:43,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 20431 states and 46685 transitions. [2019-12-27 17:43:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:43,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:43,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:43,627 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:43,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-27 17:43:43,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:43,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439609141] [2019-12-27 17:43:43,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:43,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439609141] [2019-12-27 17:43:43,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:43,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:43:43,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [423091959] [2019-12-27 17:43:43,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:43,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:44,086 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 162 transitions. [2019-12-27 17:43:44,087 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:44,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:43:44,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:43:44,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:44,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:43:44,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:44,106 INFO L87 Difference]: Start difference. First operand 20431 states and 46685 transitions. Second operand 11 states. [2019-12-27 17:43:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:45,818 INFO L93 Difference]: Finished difference Result 41580 states and 94036 transitions. [2019-12-27 17:43:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 17:43:45,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-27 17:43:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:45,856 INFO L225 Difference]: With dead ends: 41580 [2019-12-27 17:43:45,857 INFO L226 Difference]: Without dead ends: 32688 [2019-12-27 17:43:45,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 17:43:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32688 states. [2019-12-27 17:43:46,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32688 to 26133. [2019-12-27 17:43:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26133 states. [2019-12-27 17:43:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26133 states to 26133 states and 60612 transitions. [2019-12-27 17:43:46,191 INFO L78 Accepts]: Start accepts. Automaton has 26133 states and 60612 transitions. Word has length 96 [2019-12-27 17:43:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:46,191 INFO L462 AbstractCegarLoop]: Abstraction has 26133 states and 60612 transitions. [2019-12-27 17:43:46,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:43:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 26133 states and 60612 transitions. [2019-12-27 17:43:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:46,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:46,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:46,214 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:46,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1923547038, now seen corresponding path program 2 times [2019-12-27 17:43:46,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:46,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338531082] [2019-12-27 17:43:46,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:46,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338531082] [2019-12-27 17:43:46,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:46,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:46,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661448832] [2019-12-27 17:43:46,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:46,390 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:46,718 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 215 transitions. [2019-12-27 17:43:46,718 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:46,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 17:43:46,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:43:46,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:43:46,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:43:46,806 INFO L87 Difference]: Start difference. First operand 26133 states and 60612 transitions. Second operand 14 states. [2019-12-27 17:43:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:49,636 INFO L93 Difference]: Finished difference Result 52822 states and 119556 transitions. [2019-12-27 17:43:49,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 17:43:49,636 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 17:43:49,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:49,693 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 17:43:49,694 INFO L226 Difference]: Without dead ends: 49703 [2019-12-27 17:43:49,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=625, Invalid=3157, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 17:43:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49703 states. [2019-12-27 17:43:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49703 to 33612. [2019-12-27 17:43:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33612 states. [2019-12-27 17:43:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33612 states to 33612 states and 78481 transitions. [2019-12-27 17:43:50,387 INFO L78 Accepts]: Start accepts. Automaton has 33612 states and 78481 transitions. Word has length 96 [2019-12-27 17:43:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:50,388 INFO L462 AbstractCegarLoop]: Abstraction has 33612 states and 78481 transitions. [2019-12-27 17:43:50,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:43:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 33612 states and 78481 transitions. [2019-12-27 17:43:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:50,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:50,418 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:50,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1937169854, now seen corresponding path program 3 times [2019-12-27 17:43:50,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:50,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399437117] [2019-12-27 17:43:50,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:50,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399437117] [2019-12-27 17:43:50,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:50,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:50,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331211481] [2019-12-27 17:43:50,585 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:50,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:50,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 220 transitions. [2019-12-27 17:43:50,812 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:50,843 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:43:50,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:43:50,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:50,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:43:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:43:50,845 INFO L87 Difference]: Start difference. First operand 33612 states and 78481 transitions. Second operand 12 states. [2019-12-27 17:43:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:54,369 INFO L93 Difference]: Finished difference Result 81240 states and 183406 transitions. [2019-12-27 17:43:54,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 17:43:54,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 17:43:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:54,458 INFO L225 Difference]: With dead ends: 81240 [2019-12-27 17:43:54,458 INFO L226 Difference]: Without dead ends: 77967 [2019-12-27 17:43:54,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=543, Invalid=3617, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 17:43:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77967 states. [2019-12-27 17:43:55,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77967 to 46835. [2019-12-27 17:43:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46835 states. [2019-12-27 17:43:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46835 states to 46835 states and 110733 transitions. [2019-12-27 17:43:55,287 INFO L78 Accepts]: Start accepts. Automaton has 46835 states and 110733 transitions. Word has length 96 [2019-12-27 17:43:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:55,287 INFO L462 AbstractCegarLoop]: Abstraction has 46835 states and 110733 transitions. [2019-12-27 17:43:55,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:43:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 46835 states and 110733 transitions. [2019-12-27 17:43:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:55,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:55,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:55,329 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2126356347, now seen corresponding path program 1 times [2019-12-27 17:43:55,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:55,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887072361] [2019-12-27 17:43:55,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:55,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887072361] [2019-12-27 17:43:55,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:55,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:43:55,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842543915] [2019-12-27 17:43:55,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:55,598 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:55,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 216 transitions. [2019-12-27 17:43:55,988 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:56,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:56,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:56,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:43:56,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:43:56,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:56,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:43:56,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:43:56,122 INFO L87 Difference]: Start difference. First operand 46835 states and 110733 transitions. Second operand 15 states. [2019-12-27 17:44:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:04,004 INFO L93 Difference]: Finished difference Result 86353 states and 199719 transitions. [2019-12-27 17:44:04,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 17:44:04,004 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 17:44:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:04,096 INFO L225 Difference]: With dead ends: 86353 [2019-12-27 17:44:04,096 INFO L226 Difference]: Without dead ends: 86353 [2019-12-27 17:44:04,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1571 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=738, Invalid=4092, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 17:44:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86353 states. [2019-12-27 17:44:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86353 to 63179. [2019-12-27 17:44:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63179 states. [2019-12-27 17:44:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63179 states to 63179 states and 149919 transitions. [2019-12-27 17:44:05,159 INFO L78 Accepts]: Start accepts. Automaton has 63179 states and 149919 transitions. Word has length 96 [2019-12-27 17:44:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:05,160 INFO L462 AbstractCegarLoop]: Abstraction has 63179 states and 149919 transitions. [2019-12-27 17:44:05,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:44:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 63179 states and 149919 transitions. [2019-12-27 17:44:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:05,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:05,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:05,223 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:05,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:05,223 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 4 times [2019-12-27 17:44:05,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:05,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337474244] [2019-12-27 17:44:05,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:05,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337474244] [2019-12-27 17:44:05,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:05,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:44:05,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [949900524] [2019-12-27 17:44:05,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:05,427 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:05,855 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 147 transitions. [2019-12-27 17:44:05,855 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:05,867 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:44:05,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:44:05,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:44:05,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:44:05,868 INFO L87 Difference]: Start difference. First operand 63179 states and 149919 transitions. Second operand 10 states. [2019-12-27 17:44:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:06,850 INFO L93 Difference]: Finished difference Result 84597 states and 197563 transitions. [2019-12-27 17:44:06,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 17:44:06,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 17:44:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:06,959 INFO L225 Difference]: With dead ends: 84597 [2019-12-27 17:44:06,960 INFO L226 Difference]: Without dead ends: 83714 [2019-12-27 17:44:06,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:44:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83714 states. [2019-12-27 17:44:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83714 to 63190. [2019-12-27 17:44:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63190 states. [2019-12-27 17:44:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63190 states to 63190 states and 149935 transitions. [2019-12-27 17:44:08,497 INFO L78 Accepts]: Start accepts. Automaton has 63190 states and 149935 transitions. Word has length 96 [2019-12-27 17:44:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:08,498 INFO L462 AbstractCegarLoop]: Abstraction has 63190 states and 149935 transitions. [2019-12-27 17:44:08,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:44:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 63190 states and 149935 transitions. [2019-12-27 17:44:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:08,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:08,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:08,567 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:08,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 5 times [2019-12-27 17:44:08,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:08,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399844058] [2019-12-27 17:44:08,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:08,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399844058] [2019-12-27 17:44:08,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:08,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:44:08,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2124937082] [2019-12-27 17:44:08,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:08,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:08,956 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 185 transitions. [2019-12-27 17:44:08,956 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:09,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:44:09,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:44:09,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:09,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:44:09,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:44:09,013 INFO L87 Difference]: Start difference. First operand 63190 states and 149935 transitions. Second operand 14 states. [2019-12-27 17:44:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:09,916 INFO L93 Difference]: Finished difference Result 73880 states and 174376 transitions. [2019-12-27 17:44:09,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:44:09,922 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 17:44:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:10,018 INFO L225 Difference]: With dead ends: 73880 [2019-12-27 17:44:10,018 INFO L226 Difference]: Without dead ends: 73841 [2019-12-27 17:44:10,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:44:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73841 states. [2019-12-27 17:44:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73841 to 69781. [2019-12-27 17:44:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69781 states. [2019-12-27 17:44:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69781 states to 69781 states and 165627 transitions. [2019-12-27 17:44:11,391 INFO L78 Accepts]: Start accepts. Automaton has 69781 states and 165627 transitions. Word has length 96 [2019-12-27 17:44:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:11,392 INFO L462 AbstractCegarLoop]: Abstraction has 69781 states and 165627 transitions. [2019-12-27 17:44:11,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:44:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 69781 states and 165627 transitions. [2019-12-27 17:44:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:11,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:11,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:11,470 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:11,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:11,471 INFO L82 PathProgramCache]: Analyzing trace with hash -720700797, now seen corresponding path program 2 times [2019-12-27 17:44:11,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:11,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062308784] [2019-12-27 17:44:11,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:11,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062308784] [2019-12-27 17:44:11,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:11,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:44:11,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260503865] [2019-12-27 17:44:11,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:11,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:11,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 166 transitions. [2019-12-27 17:44:11,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:11,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:44:11,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:44:11,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:11,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:44:11,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:44:11,760 INFO L87 Difference]: Start difference. First operand 69781 states and 165627 transitions. Second operand 3 states. [2019-12-27 17:44:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:12,092 INFO L93 Difference]: Finished difference Result 69781 states and 165626 transitions. [2019-12-27 17:44:12,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:44:12,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-27 17:44:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:12,200 INFO L225 Difference]: With dead ends: 69781 [2019-12-27 17:44:12,200 INFO L226 Difference]: Without dead ends: 69781 [2019-12-27 17:44:12,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:44:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69781 states. [2019-12-27 17:44:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69781 to 63077. [2019-12-27 17:44:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63077 states. [2019-12-27 17:44:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63077 states to 63077 states and 150185 transitions. [2019-12-27 17:44:13,433 INFO L78 Accepts]: Start accepts. Automaton has 63077 states and 150185 transitions. Word has length 96 [2019-12-27 17:44:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:13,433 INFO L462 AbstractCegarLoop]: Abstraction has 63077 states and 150185 transitions. [2019-12-27 17:44:13,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:44:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 63077 states and 150185 transitions. [2019-12-27 17:44:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:13,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:13,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:13,493 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:13,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:13,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1030610182, now seen corresponding path program 6 times [2019-12-27 17:44:13,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:13,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147920946] [2019-12-27 17:44:13,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:13,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147920946] [2019-12-27 17:44:13,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:13,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:44:13,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1875762308] [2019-12-27 17:44:13,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:13,650 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:13,824 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 276 transitions. [2019-12-27 17:44:13,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:13,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:44:13,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:44:13,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:13,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:44:13,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:44:13,886 INFO L87 Difference]: Start difference. First operand 63077 states and 150185 transitions. Second operand 14 states. [2019-12-27 17:44:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:17,602 INFO L93 Difference]: Finished difference Result 93187 states and 215908 transitions. [2019-12-27 17:44:17,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-27 17:44:17,602 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 17:44:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:17,769 INFO L225 Difference]: With dead ends: 93187 [2019-12-27 17:44:17,769 INFO L226 Difference]: Without dead ends: 91653 [2019-12-27 17:44:17,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2442 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=936, Invalid=5870, Unknown=0, NotChecked=0, Total=6806 [2019-12-27 17:44:17,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91653 states. [2019-12-27 17:44:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91653 to 59775. [2019-12-27 17:44:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59775 states. [2019-12-27 17:44:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59775 states to 59775 states and 142554 transitions. [2019-12-27 17:44:18,802 INFO L78 Accepts]: Start accepts. Automaton has 59775 states and 142554 transitions. Word has length 96 [2019-12-27 17:44:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:18,802 INFO L462 AbstractCegarLoop]: Abstraction has 59775 states and 142554 transitions. [2019-12-27 17:44:18,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:44:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 59775 states and 142554 transitions. [2019-12-27 17:44:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:18,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:18,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:18,867 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:18,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:18,868 INFO L82 PathProgramCache]: Analyzing trace with hash -82268492, now seen corresponding path program 7 times [2019-12-27 17:44:18,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:18,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877247676] [2019-12-27 17:44:18,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:18,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877247676] [2019-12-27 17:44:18,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:18,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:44:18,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [308867181] [2019-12-27 17:44:18,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:18,971 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:19,163 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 174 transitions. [2019-12-27 17:44:19,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:19,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:44:19,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:44:19,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:19,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:44:19,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:44:19,166 INFO L87 Difference]: Start difference. First operand 59775 states and 142554 transitions. Second operand 6 states. [2019-12-27 17:44:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:20,350 INFO L93 Difference]: Finished difference Result 60880 states and 144748 transitions. [2019-12-27 17:44:20,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:44:20,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 17:44:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:20,421 INFO L225 Difference]: With dead ends: 60880 [2019-12-27 17:44:20,421 INFO L226 Difference]: Without dead ends: 60880 [2019-12-27 17:44:20,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:44:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60880 states. [2019-12-27 17:44:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60880 to 60012. [2019-12-27 17:44:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60012 states. [2019-12-27 17:44:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60012 states to 60012 states and 143040 transitions. [2019-12-27 17:44:21,160 INFO L78 Accepts]: Start accepts. Automaton has 60012 states and 143040 transitions. Word has length 96 [2019-12-27 17:44:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:21,160 INFO L462 AbstractCegarLoop]: Abstraction has 60012 states and 143040 transitions. [2019-12-27 17:44:21,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:44:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 60012 states and 143040 transitions. [2019-12-27 17:44:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:21,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:21,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:21,220 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:21,220 INFO L82 PathProgramCache]: Analyzing trace with hash 681291876, now seen corresponding path program 8 times [2019-12-27 17:44:21,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:21,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224577808] [2019-12-27 17:44:21,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:21,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224577808] [2019-12-27 17:44:21,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:21,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:44:21,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1809390504] [2019-12-27 17:44:21,388 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:21,414 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:21,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 318 transitions. [2019-12-27 17:44:21,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:21,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:44:21,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:44:21,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:44:21,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:44:21,642 INFO L87 Difference]: Start difference. First operand 60012 states and 143040 transitions. Second operand 10 states. [2019-12-27 17:44:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:23,123 INFO L93 Difference]: Finished difference Result 87129 states and 203682 transitions. [2019-12-27 17:44:23,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:44:23,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 17:44:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:23,236 INFO L225 Difference]: With dead ends: 87129 [2019-12-27 17:44:23,236 INFO L226 Difference]: Without dead ends: 84531 [2019-12-27 17:44:23,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:44:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84531 states. [2019-12-27 17:44:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84531 to 67784. [2019-12-27 17:44:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67784 states. [2019-12-27 17:44:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67784 states to 67784 states and 161669 transitions. [2019-12-27 17:44:24,316 INFO L78 Accepts]: Start accepts. Automaton has 67784 states and 161669 transitions. Word has length 96 [2019-12-27 17:44:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:24,317 INFO L462 AbstractCegarLoop]: Abstraction has 67784 states and 161669 transitions. [2019-12-27 17:44:24,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:44:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 67784 states and 161669 transitions. [2019-12-27 17:44:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:24,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:24,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:24,387 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:24,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:24,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1560206146, now seen corresponding path program 9 times [2019-12-27 17:44:24,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:24,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751021530] [2019-12-27 17:44:24,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:24,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751021530] [2019-12-27 17:44:24,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:24,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:44:24,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2104103251] [2019-12-27 17:44:24,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:24,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:24,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 201 transitions. [2019-12-27 17:44:24,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:24,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:44:24,824 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:44:24,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:44:24,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:24,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:44:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:44:24,826 INFO L87 Difference]: Start difference. First operand 67784 states and 161669 transitions. Second operand 12 states. [2019-12-27 17:44:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:26,894 INFO L93 Difference]: Finished difference Result 77712 states and 181923 transitions. [2019-12-27 17:44:26,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 17:44:26,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 17:44:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:27,010 INFO L225 Difference]: With dead ends: 77712 [2019-12-27 17:44:27,011 INFO L226 Difference]: Without dead ends: 77712 [2019-12-27 17:44:27,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:44:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77712 states. [2019-12-27 17:44:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77712 to 64245. [2019-12-27 17:44:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64245 states. [2019-12-27 17:44:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64245 states to 64245 states and 152042 transitions. [2019-12-27 17:44:27,930 INFO L78 Accepts]: Start accepts. Automaton has 64245 states and 152042 transitions. Word has length 96 [2019-12-27 17:44:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:27,930 INFO L462 AbstractCegarLoop]: Abstraction has 64245 states and 152042 transitions. [2019-12-27 17:44:27,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:44:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 64245 states and 152042 transitions. [2019-12-27 17:44:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:27,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:27,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:27,990 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1028793228, now seen corresponding path program 10 times [2019-12-27 17:44:27,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:27,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371726353] [2019-12-27 17:44:27,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:28,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371726353] [2019-12-27 17:44:28,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:28,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:44:28,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995366028] [2019-12-27 17:44:28,113 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:28,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:28,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 204 transitions. [2019-12-27 17:44:28,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:28,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:44:28,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:44:28,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:44:28,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:44:28,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:28,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:44:28,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:44:28,420 INFO L87 Difference]: Start difference. First operand 64245 states and 152042 transitions. Second operand 7 states. [2019-12-27 17:44:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:29,032 INFO L93 Difference]: Finished difference Result 58334 states and 138713 transitions. [2019-12-27 17:44:29,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:44:29,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-27 17:44:29,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:29,107 INFO L225 Difference]: With dead ends: 58334 [2019-12-27 17:44:29,107 INFO L226 Difference]: Without dead ends: 58334 [2019-12-27 17:44:29,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:44:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58334 states. [2019-12-27 17:44:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58334 to 58006. [2019-12-27 17:44:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58006 states. [2019-12-27 17:44:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58006 states to 58006 states and 138075 transitions. [2019-12-27 17:44:30,089 INFO L78 Accepts]: Start accepts. Automaton has 58006 states and 138075 transitions. Word has length 96 [2019-12-27 17:44:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:30,089 INFO L462 AbstractCegarLoop]: Abstraction has 58006 states and 138075 transitions. [2019-12-27 17:44:30,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:44:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 58006 states and 138075 transitions. [2019-12-27 17:44:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:30,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:30,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:30,147 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:30,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash 488459720, now seen corresponding path program 11 times [2019-12-27 17:44:30,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:30,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552165411] [2019-12-27 17:44:30,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:30,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552165411] [2019-12-27 17:44:30,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:30,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 17:44:30,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1001527415] [2019-12-27 17:44:30,480 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:30,498 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:30,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 250 transitions. [2019-12-27 17:44:30,664 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:30,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:44:30,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 17:44:30,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:30,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 17:44:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:44:30,840 INFO L87 Difference]: Start difference. First operand 58006 states and 138075 transitions. Second operand 22 states. [2019-12-27 17:44:30,970 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 17:44:34,735 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-27 17:44:34,902 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-27 17:44:37,236 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 Received shutdown request... [2019-12-27 17:44:42,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-12-27 17:44:42,292 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 17:44:42,298 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 17:44:42,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:44:42 BasicIcfg [2019-12-27 17:44:42,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:44:42,300 INFO L168 Benchmark]: Toolchain (without parser) took 208045.36 ms. Allocated memory was 144.7 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 17:44:42,300 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:44:42,301 INFO L168 Benchmark]: CACSL2BoogieTranslator took 915.92 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 153.4 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:42,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.20 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 149.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:42,301 INFO L168 Benchmark]: Boogie Preprocessor took 70.74 ms. Allocated memory is still 202.4 MB. Free memory was 149.4 MB in the beginning and 146.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:42,302 INFO L168 Benchmark]: RCFGBuilder took 1261.04 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 146.6 MB in the beginning and 191.4 MB in the end (delta: -44.7 MB). Peak memory consumption was 66.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:42,302 INFO L168 Benchmark]: TraceAbstraction took 205698.95 ms. Allocated memory was 234.9 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 189.9 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 17:44:42,305 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 915.92 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 153.4 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.20 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 149.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.74 ms. Allocated memory is still 202.4 MB. Free memory was 149.4 MB in the beginning and 146.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1261.04 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 146.6 MB in the beginning and 191.4 MB in the end (delta: -44.7 MB). Peak memory consumption was 66.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205698.95 ms. Allocated memory was 234.9 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 189.9 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.0s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.0s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (58006states) and FLOYD_HOARE automaton (currently 109 states, 22 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (58006states) and FLOYD_HOARE automaton (currently 109 states, 22 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 205.4s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 89.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15943 SDtfs, 24212 SDslu, 72976 SDs, 0 SdLazy, 39276 SolverSat, 2067 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1048 GetRequests, 283 SyntacticMatches, 51 SemanticMatches, 713 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12554 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240862occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 317852 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2487 NumberOfCodeBlocks, 2487 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2454 ConstructedInterpolants, 0 QuantifiedInterpolants, 729558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 could not prove your program: Timeout Completed graceful shutdown