/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:02:28,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:02:28,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:02:28,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:02:28,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:02:28,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:02:28,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:02:28,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:02:28,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:02:28,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:02:28,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:02:28,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:02:28,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:02:28,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:02:28,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:02:28,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:02:28,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:02:28,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:02:28,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:02:28,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:02:28,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:02:28,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:02:28,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:02:28,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:02:28,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:02:28,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:02:28,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:02:28,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:02:28,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:02:28,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:02:28,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:02:28,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:02:28,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:02:28,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:02:28,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:02:28,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:02:28,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:02:28,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:02:28,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:02:28,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:02:28,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:02:28,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:02:28,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:02:28,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:02:28,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:02:28,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:02:28,645 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:02:28,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:02:28,646 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:02:28,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:02:28,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:02:28,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:02:28,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:02:28,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:02:28,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:02:28,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:02:28,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:02:28,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:02:28,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:02:28,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:02:28,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:02:28,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:02:28,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:02:28,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:02:28,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:02:28,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:02:28,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:02:28,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:02:28,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:02:28,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:02:28,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:02:28,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:02:28,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:02:28,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:02:28,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:02:28,972 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:02:28,973 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-18 18:02:29,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717fa24b1/2fffd6bd3f8f47cd9db41246aaf63c30/FLAG0fbb0f8be [2019-12-18 18:02:29,606 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:02:29,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i [2019-12-18 18:02:29,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717fa24b1/2fffd6bd3f8f47cd9db41246aaf63c30/FLAG0fbb0f8be [2019-12-18 18:02:29,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717fa24b1/2fffd6bd3f8f47cd9db41246aaf63c30 [2019-12-18 18:02:29,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:02:29,907 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:02:29,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:02:29,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:02:29,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:02:29,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:02:29" (1/1) ... [2019-12-18 18:02:29,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45be7259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:29, skipping insertion in model container [2019-12-18 18:02:29,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:02:29" (1/1) ... [2019-12-18 18:02:29,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:02:29,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:02:30,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:02:30,727 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:02:30,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:02:30,897 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:02:30,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30 WrapperNode [2019-12-18 18:02:30,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:02:30,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:02:30,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:02:30,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:02:30,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (1/1) ... [2019-12-18 18:02:30,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (1/1) ... [2019-12-18 18:02:30,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:02:30,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:02:30,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:02:30,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:02:30,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (1/1) ... [2019-12-18 18:02:30,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (1/1) ... [2019-12-18 18:02:30,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (1/1) ... [2019-12-18 18:02:30,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (1/1) ... [2019-12-18 18:02:31,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (1/1) ... [2019-12-18 18:02:31,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (1/1) ... [2019-12-18 18:02:31,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (1/1) ... [2019-12-18 18:02:31,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:02:31,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:02:31,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:02:31,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:02:31,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:02:31,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:02:31,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:02:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:02:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:02:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:02:31,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:02:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:02:31,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:02:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:02:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:02:31,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:02:31,154 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:02:32,239 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:02:32,239 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:02:32,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:02:32 BoogieIcfgContainer [2019-12-18 18:02:32,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:02:32,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:02:32,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:02:32,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:02:32,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:02:29" (1/3) ... [2019-12-18 18:02:32,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb1ff69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:02:32, skipping insertion in model container [2019-12-18 18:02:32,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:30" (2/3) ... [2019-12-18 18:02:32,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb1ff69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:02:32, skipping insertion in model container [2019-12-18 18:02:32,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:02:32" (3/3) ... [2019-12-18 18:02:32,253 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc.i [2019-12-18 18:02:32,264 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:02:32,265 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:02:32,277 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:02:32,278 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:02:32,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,341 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,376 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,376 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,425 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,434 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,437 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,438 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:32,458 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:02:32,480 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:02:32,480 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:02:32,480 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:02:32,481 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:02:32,481 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:02:32,481 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:02:32,481 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:02:32,481 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:02:32,511 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 18:02:32,514 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 18:02:32,727 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 18:02:32,727 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:02:32,773 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. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 18:02:32,897 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 18:02:33,056 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 18:02:33,056 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:02:33,090 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. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 18:02:33,161 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 18:02:33,162 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:02:40,402 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 18:02:40,795 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 18:02:40,909 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 18:02:41,012 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-18 18:02:41,013 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-18 18:02:41,016 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-18 18:02:55,192 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-18 18:02:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-18 18:02:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:02:55,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:55,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:02:55,205 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:55,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-18 18:02:55,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:55,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246250699] [2019-12-18 18:02:55,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:02:55,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246250699] [2019-12-18 18:02:55,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:55,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:02:55,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571311888] [2019-12-18 18:02:55,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:02:55,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:02:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:02:55,478 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-18 18:02:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:58,918 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-18 18:02:58,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:02:58,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:02:58,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:59,557 INFO L225 Difference]: With dead ends: 116456 [2019-12-18 18:02:59,558 INFO L226 Difference]: Without dead ends: 114036 [2019-12-18 18:02:59,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:03:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-18 18:03:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-18 18:03:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-18 18:03:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-18 18:03:11,467 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-18 18:03:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:11,468 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-18 18:03:11,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:03:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-18 18:03:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:03:11,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:11,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:11,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-18 18:03:11,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:11,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379398371] [2019-12-18 18:03:11,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:11,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379398371] [2019-12-18 18:03:11,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:11,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:03:11,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982383650] [2019-12-18 18:03:11,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:03:11,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:11,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:03:11,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:03:11,600 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-18 18:03:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:12,652 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-18 18:03:12,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:03:12,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:03:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:18,217 INFO L225 Difference]: With dead ends: 152998 [2019-12-18 18:03:18,217 INFO L226 Difference]: Without dead ends: 152998 [2019-12-18 18:03:18,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-18 18:03:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-18 18:03:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-18 18:03:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-18 18:03:26,711 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-18 18:03:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:26,711 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-18 18:03:26,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:03:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-18 18:03:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:03:26,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:26,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:26,714 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-18 18:03:26,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:26,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556452303] [2019-12-18 18:03:26,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:26,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556452303] [2019-12-18 18:03:26,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:26,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:03:26,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362978816] [2019-12-18 18:03:26,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:03:26,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:26,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:03:26,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:03:26,803 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-18 18:03:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:33,183 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-18 18:03:33,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:03:33,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:03:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:33,663 INFO L225 Difference]: With dead ends: 198503 [2019-12-18 18:03:33,664 INFO L226 Difference]: Without dead ends: 198503 [2019-12-18 18:03:33,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-18 18:03:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-18 18:03:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-18 18:03:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-18 18:03:43,659 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-18 18:03:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:43,659 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-18 18:03:43,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:03:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-18 18:03:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 18:03:43,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:43,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:43,666 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:43,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:43,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-18 18:03:43,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:43,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045065265] [2019-12-18 18:03:43,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:43,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045065265] [2019-12-18 18:03:43,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:43,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:03:43,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879665168] [2019-12-18 18:03:43,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:03:43,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:43,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:03:43,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:43,806 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 5 states. [2019-12-18 18:03:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:51,976 INFO L93 Difference]: Finished difference Result 244942 states and 875227 transitions. [2019-12-18 18:03:51,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:03:51,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 18:03:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:52,573 INFO L225 Difference]: With dead ends: 244942 [2019-12-18 18:03:52,573 INFO L226 Difference]: Without dead ends: 244942 [2019-12-18 18:03:52,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:03:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244942 states. [2019-12-18 18:04:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244942 to 183475. [2019-12-18 18:04:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183475 states. [2019-12-18 18:04:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183475 states to 183475 states and 667588 transitions. [2019-12-18 18:04:04,071 INFO L78 Accepts]: Start accepts. Automaton has 183475 states and 667588 transitions. Word has length 17 [2019-12-18 18:04:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:04,071 INFO L462 AbstractCegarLoop]: Abstraction has 183475 states and 667588 transitions. [2019-12-18 18:04:04,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 183475 states and 667588 transitions. [2019-12-18 18:04:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:04:04,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:04,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:04,094 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:04,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-18 18:04:04,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:04,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000938547] [2019-12-18 18:04:04,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:04,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000938547] [2019-12-18 18:04:04,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:04,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:04:04,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295044022] [2019-12-18 18:04:04,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:04,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:04,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:04,208 INFO L87 Difference]: Start difference. First operand 183475 states and 667588 transitions. Second operand 5 states. [2019-12-18 18:04:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:07,293 INFO L93 Difference]: Finished difference Result 255390 states and 912359 transitions. [2019-12-18 18:04:07,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:04:07,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 18:04:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:07,929 INFO L225 Difference]: With dead ends: 255390 [2019-12-18 18:04:07,929 INFO L226 Difference]: Without dead ends: 255390 [2019-12-18 18:04:07,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255390 states. [2019-12-18 18:04:25,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255390 to 240862. [2019-12-18 18:04:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240862 states. [2019-12-18 18:04:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240862 states to 240862 states and 862677 transitions. [2019-12-18 18:04:25,721 INFO L78 Accepts]: Start accepts. Automaton has 240862 states and 862677 transitions. Word has length 25 [2019-12-18 18:04:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:25,723 INFO L462 AbstractCegarLoop]: Abstraction has 240862 states and 862677 transitions. [2019-12-18 18:04:25,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 240862 states and 862677 transitions. [2019-12-18 18:04:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:04:25,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:25,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:25,750 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:25,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1942527613, now seen corresponding path program 1 times [2019-12-18 18:04:25,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:25,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083406233] [2019-12-18 18:04:25,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:25,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083406233] [2019-12-18 18:04:25,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:25,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:04:25,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706360611] [2019-12-18 18:04:25,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:04:25,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:25,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:04:25,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:04:25,840 INFO L87 Difference]: Start difference. First operand 240862 states and 862677 transitions. Second operand 4 states. [2019-12-18 18:04:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:25,918 INFO L93 Difference]: Finished difference Result 14741 states and 40177 transitions. [2019-12-18 18:04:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:04:25,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:04:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:25,931 INFO L225 Difference]: With dead ends: 14741 [2019-12-18 18:04:25,931 INFO L226 Difference]: Without dead ends: 10693 [2019-12-18 18:04:25,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2019-12-18 18:04:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10653. [2019-12-18 18:04:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10653 states. [2019-12-18 18:04:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10653 states to 10653 states and 26288 transitions. [2019-12-18 18:04:27,409 INFO L78 Accepts]: Start accepts. Automaton has 10653 states and 26288 transitions. Word has length 25 [2019-12-18 18:04:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:27,409 INFO L462 AbstractCegarLoop]: Abstraction has 10653 states and 26288 transitions. [2019-12-18 18:04:27,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:04:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10653 states and 26288 transitions. [2019-12-18 18:04:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 18:04:27,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:27,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:27,414 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:27,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-18 18:04:27,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:27,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302870081] [2019-12-18 18:04:27,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:27,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302870081] [2019-12-18 18:04:27,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:27,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:04:27,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574869914] [2019-12-18 18:04:27,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:27,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:27,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:27,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:27,527 INFO L87 Difference]: Start difference. First operand 10653 states and 26288 transitions. Second operand 6 states. [2019-12-18 18:04:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:28,534 INFO L93 Difference]: Finished difference Result 11962 states and 29091 transitions. [2019-12-18 18:04:28,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:28,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-18 18:04:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:28,550 INFO L225 Difference]: With dead ends: 11962 [2019-12-18 18:04:28,550 INFO L226 Difference]: Without dead ends: 11914 [2019-12-18 18:04:28,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2019-12-18 18:04:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11586. [2019-12-18 18:04:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-18 18:04:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 28348 transitions. [2019-12-18 18:04:28,687 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 28348 transitions. Word has length 38 [2019-12-18 18:04:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:28,688 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 28348 transitions. [2019-12-18 18:04:28,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 28348 transitions. [2019-12-18 18:04:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 18:04:28,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:28,695 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-18 18:04:28,695 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:28,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:28,695 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-18 18:04:28,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:28,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345110447] [2019-12-18 18:04:28,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:28,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345110447] [2019-12-18 18:04:28,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:28,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:28,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698873385] [2019-12-18 18:04:28,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:28,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:28,798 INFO L87 Difference]: Start difference. First operand 11586 states and 28348 transitions. Second operand 7 states. [2019-12-18 18:04:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:30,089 INFO L93 Difference]: Finished difference Result 13314 states and 32232 transitions. [2019-12-18 18:04:30,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:04:30,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 18:04:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:30,109 INFO L225 Difference]: With dead ends: 13314 [2019-12-18 18:04:30,109 INFO L226 Difference]: Without dead ends: 13314 [2019-12-18 18:04:30,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:04:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13314 states. [2019-12-18 18:04:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13314 to 11791. [2019-12-18 18:04:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-18 18:04:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-18 18:04:30,256 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-18 18:04:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:30,256 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-18 18:04:30,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-18 18:04:30,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 18:04:30,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:30,265 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-18 18:04:30,265 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:30,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:30,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-18 18:04:30,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:30,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047666274] [2019-12-18 18:04:30,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:30,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047666274] [2019-12-18 18:04:30,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:30,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:30,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771677977] [2019-12-18 18:04:30,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:30,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:30,372 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-18 18:04:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:31,292 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-18 18:04:31,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:04:31,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 18:04:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:31,308 INFO L225 Difference]: With dead ends: 13152 [2019-12-18 18:04:31,309 INFO L226 Difference]: Without dead ends: 13152 [2019-12-18 18:04:31,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-18 18:04:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-18 18:04:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-18 18:04:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-18 18:04:31,471 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-18 18:04:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:31,472 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-18 18:04:31,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-18 18:04:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 18:04:31,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:31,481 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-18 18:04:31,481 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:31,482 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-18 18:04:31,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:31,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205719265] [2019-12-18 18:04:31,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:33,521 WARN L192 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 18:04:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:33,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205719265] [2019-12-18 18:04:33,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:33,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:04:33,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536069029] [2019-12-18 18:04:33,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:33,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:33,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:33,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:33,553 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-18 18:04:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:33,606 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-18 18:04:33,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:04:33,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 18:04:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:33,612 INFO L225 Difference]: With dead ends: 5405 [2019-12-18 18:04:33,612 INFO L226 Difference]: Without dead ends: 5151 [2019-12-18 18:04:33,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-18 18:04:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-18 18:04:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-18 18:04:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-18 18:04:33,667 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 58 [2019-12-18 18:04:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:33,667 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-18 18:04:33,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-18 18:04:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:33,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:33,674 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-18 18:04:33,674 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-18 18:04:33,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:33,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94919603] [2019-12-18 18:04:33,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:33,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94919603] [2019-12-18 18:04:33,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:33,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:33,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536625042] [2019-12-18 18:04:33,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:33,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:33,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:33,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:33,802 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 6 states. [2019-12-18 18:04:34,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:34,649 INFO L93 Difference]: Finished difference Result 6626 states and 15449 transitions. [2019-12-18 18:04:34,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:04:34,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 18:04:34,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:34,657 INFO L225 Difference]: With dead ends: 6626 [2019-12-18 18:04:34,657 INFO L226 Difference]: Without dead ends: 6626 [2019-12-18 18:04:34,657 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-18 18:04:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-18 18:04:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6177. [2019-12-18 18:04:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6177 states. [2019-12-18 18:04:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 14495 transitions. [2019-12-18 18:04:34,726 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 14495 transitions. Word has length 94 [2019-12-18 18:04:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:34,727 INFO L462 AbstractCegarLoop]: Abstraction has 6177 states and 14495 transitions. [2019-12-18 18:04:34,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 14495 transitions. [2019-12-18 18:04:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:34,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:34,735 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-18 18:04:34,735 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-18 18:04:34,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:34,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708673740] [2019-12-18 18:04:34,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:34,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708673740] [2019-12-18 18:04:34,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:34,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:34,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827396507] [2019-12-18 18:04:34,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:34,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:34,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:34,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:34,865 INFO L87 Difference]: Start difference. First operand 6177 states and 14495 transitions. Second operand 7 states. [2019-12-18 18:04:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:35,865 INFO L93 Difference]: Finished difference Result 7484 states and 17393 transitions. [2019-12-18 18:04:35,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:04:35,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 18:04:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:35,874 INFO L225 Difference]: With dead ends: 7484 [2019-12-18 18:04:35,874 INFO L226 Difference]: Without dead ends: 7484 [2019-12-18 18:04:35,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2019-12-18 18:04:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 6666. [2019-12-18 18:04:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6666 states. [2019-12-18 18:04:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 15594 transitions. [2019-12-18 18:04:35,964 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 15594 transitions. Word has length 94 [2019-12-18 18:04:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:35,964 INFO L462 AbstractCegarLoop]: Abstraction has 6666 states and 15594 transitions. [2019-12-18 18:04:35,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 15594 transitions. [2019-12-18 18:04:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:35,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:35,973 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-18 18:04:35,973 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:35,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-18 18:04:35,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:35,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200778183] [2019-12-18 18:04:35,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:36,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200778183] [2019-12-18 18:04:36,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:36,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:36,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463315975] [2019-12-18 18:04:36,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:36,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:36,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:36,077 INFO L87 Difference]: Start difference. First operand 6666 states and 15594 transitions. Second operand 5 states. [2019-12-18 18:04:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:36,639 INFO L93 Difference]: Finished difference Result 7181 states and 16661 transitions. [2019-12-18 18:04:36,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:04:36,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-18 18:04:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:36,653 INFO L225 Difference]: With dead ends: 7181 [2019-12-18 18:04:36,653 INFO L226 Difference]: Without dead ends: 7181 [2019-12-18 18:04:36,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2019-12-18 18:04:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 6807. [2019-12-18 18:04:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6807 states. [2019-12-18 18:04:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 15915 transitions. [2019-12-18 18:04:36,808 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 15915 transitions. Word has length 94 [2019-12-18 18:04:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:36,809 INFO L462 AbstractCegarLoop]: Abstraction has 6807 states and 15915 transitions. [2019-12-18 18:04:36,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 15915 transitions. [2019-12-18 18:04:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:36,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:36,825 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-18 18:04:36,825 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-18 18:04:36,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:36,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070488879] [2019-12-18 18:04:36,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:37,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070488879] [2019-12-18 18:04:37,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:37,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:04:37,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381971111] [2019-12-18 18:04:37,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:04:37,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:04:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:37,128 INFO L87 Difference]: Start difference. First operand 6807 states and 15915 transitions. Second operand 9 states. [2019-12-18 18:04:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:37,936 INFO L93 Difference]: Finished difference Result 11764 states and 27394 transitions. [2019-12-18 18:04:37,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:04:37,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-18 18:04:37,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:37,948 INFO L225 Difference]: With dead ends: 11764 [2019-12-18 18:04:37,948 INFO L226 Difference]: Without dead ends: 9643 [2019-12-18 18:04:37,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:04:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9643 states. [2019-12-18 18:04:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9643 to 8114. [2019-12-18 18:04:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8114 states. [2019-12-18 18:04:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8114 states to 8114 states and 19148 transitions. [2019-12-18 18:04:38,082 INFO L78 Accepts]: Start accepts. Automaton has 8114 states and 19148 transitions. Word has length 94 [2019-12-18 18:04:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:38,082 INFO L462 AbstractCegarLoop]: Abstraction has 8114 states and 19148 transitions. [2019-12-18 18:04:38,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:04:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 8114 states and 19148 transitions. [2019-12-18 18:04:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:38,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:38,090 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-18 18:04:38,090 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:38,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash 644265771, now seen corresponding path program 5 times [2019-12-18 18:04:38,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:38,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578207119] [2019-12-18 18:04:38,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:38,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578207119] [2019-12-18 18:04:38,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:38,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:38,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707693103] [2019-12-18 18:04:38,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:38,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:38,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:38,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:38,207 INFO L87 Difference]: Start difference. First operand 8114 states and 19148 transitions. Second operand 6 states. [2019-12-18 18:04:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:38,804 INFO L93 Difference]: Finished difference Result 8538 states and 19980 transitions. [2019-12-18 18:04:38,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:04:38,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 18:04:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:38,814 INFO L225 Difference]: With dead ends: 8538 [2019-12-18 18:04:38,815 INFO L226 Difference]: Without dead ends: 8538 [2019-12-18 18:04:38,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:04:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8538 states. [2019-12-18 18:04:38,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 8226. [2019-12-18 18:04:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-18 18:04:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 19377 transitions. [2019-12-18 18:04:38,902 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 19377 transitions. Word has length 94 [2019-12-18 18:04:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:38,902 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 19377 transitions. [2019-12-18 18:04:38,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 19377 transitions. [2019-12-18 18:04:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:38,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:38,910 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-18 18:04:38,910 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:38,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:38,910 INFO L82 PathProgramCache]: Analyzing trace with hash 12884261, now seen corresponding path program 6 times [2019-12-18 18:04:38,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:38,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938355174] [2019-12-18 18:04:38,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:39,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938355174] [2019-12-18 18:04:39,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:39,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:39,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204327872] [2019-12-18 18:04:39,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:39,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:39,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:39,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:39,026 INFO L87 Difference]: Start difference. First operand 8226 states and 19377 transitions. Second operand 6 states. [2019-12-18 18:04:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:40,075 INFO L93 Difference]: Finished difference Result 13999 states and 32368 transitions. [2019-12-18 18:04:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:04:40,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 18:04:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:40,096 INFO L225 Difference]: With dead ends: 13999 [2019-12-18 18:04:40,096 INFO L226 Difference]: Without dead ends: 13999 [2019-12-18 18:04:40,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13999 states. [2019-12-18 18:04:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13999 to 10884. [2019-12-18 18:04:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10884 states. [2019-12-18 18:04:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10884 states to 10884 states and 25960 transitions. [2019-12-18 18:04:40,303 INFO L78 Accepts]: Start accepts. Automaton has 10884 states and 25960 transitions. Word has length 94 [2019-12-18 18:04:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:40,303 INFO L462 AbstractCegarLoop]: Abstraction has 10884 states and 25960 transitions. [2019-12-18 18:04:40,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 10884 states and 25960 transitions. [2019-12-18 18:04:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:40,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:40,319 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-18 18:04:40,319 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:40,320 INFO L82 PathProgramCache]: Analyzing trace with hash -734364891, now seen corresponding path program 7 times [2019-12-18 18:04:40,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:40,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241838449] [2019-12-18 18:04:40,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:40,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241838449] [2019-12-18 18:04:40,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:40,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:40,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884344446] [2019-12-18 18:04:40,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:40,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:40,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:40,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:40,487 INFO L87 Difference]: Start difference. First operand 10884 states and 25960 transitions. Second operand 10 states. [2019-12-18 18:04:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:41,546 INFO L93 Difference]: Finished difference Result 17663 states and 42020 transitions. [2019-12-18 18:04:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:04:41,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-12-18 18:04:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:41,565 INFO L225 Difference]: With dead ends: 17663 [2019-12-18 18:04:41,565 INFO L226 Difference]: Without dead ends: 15648 [2019-12-18 18:04:41,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:04:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15648 states. [2019-12-18 18:04:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15648 to 11076. [2019-12-18 18:04:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11076 states. [2019-12-18 18:04:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 26426 transitions. [2019-12-18 18:04:41,707 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 26426 transitions. Word has length 94 [2019-12-18 18:04:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:41,707 INFO L462 AbstractCegarLoop]: Abstraction has 11076 states and 26426 transitions. [2019-12-18 18:04:41,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 26426 transitions. [2019-12-18 18:04:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:41,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:41,718 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-18 18:04:41,718 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:41,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:41,718 INFO L82 PathProgramCache]: Analyzing trace with hash -91185887, now seen corresponding path program 8 times [2019-12-18 18:04:41,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:41,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040251434] [2019-12-18 18:04:41,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:41,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040251434] [2019-12-18 18:04:41,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:41,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:41,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581001197] [2019-12-18 18:04:41,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:41,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:41,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:41,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:41,918 INFO L87 Difference]: Start difference. First operand 11076 states and 26426 transitions. Second operand 7 states. [2019-12-18 18:04:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:42,937 INFO L93 Difference]: Finished difference Result 13613 states and 32089 transitions. [2019-12-18 18:04:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:42,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 18:04:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:42,953 INFO L225 Difference]: With dead ends: 13613 [2019-12-18 18:04:42,953 INFO L226 Difference]: Without dead ends: 13613 [2019-12-18 18:04:42,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13613 states. [2019-12-18 18:04:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13613 to 11115. [2019-12-18 18:04:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11115 states. [2019-12-18 18:04:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11115 states to 11115 states and 26382 transitions. [2019-12-18 18:04:43,098 INFO L78 Accepts]: Start accepts. Automaton has 11115 states and 26382 transitions. Word has length 94 [2019-12-18 18:04:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:43,099 INFO L462 AbstractCegarLoop]: Abstraction has 11115 states and 26382 transitions. [2019-12-18 18:04:43,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 11115 states and 26382 transitions. [2019-12-18 18:04:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:43,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:43,114 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-18 18:04:43,114 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:43,114 INFO L82 PathProgramCache]: Analyzing trace with hash -71817968, now seen corresponding path program 1 times [2019-12-18 18:04:43,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:43,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995453861] [2019-12-18 18:04:43,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:43,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995453861] [2019-12-18 18:04:43,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:43,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:43,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543655488] [2019-12-18 18:04:43,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:43,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:43,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:43,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:43,266 INFO L87 Difference]: Start difference. First operand 11115 states and 26382 transitions. Second operand 7 states. [2019-12-18 18:04:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:44,147 INFO L93 Difference]: Finished difference Result 12523 states and 29355 transitions. [2019-12-18 18:04:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:44,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:04:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:44,169 INFO L225 Difference]: With dead ends: 12523 [2019-12-18 18:04:44,170 INFO L226 Difference]: Without dead ends: 12523 [2019-12-18 18:04:44,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12523 states. [2019-12-18 18:04:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12523 to 11190. [2019-12-18 18:04:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11190 states. [2019-12-18 18:04:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 26565 transitions. [2019-12-18 18:04:44,386 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 26565 transitions. Word has length 95 [2019-12-18 18:04:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:44,387 INFO L462 AbstractCegarLoop]: Abstraction has 11190 states and 26565 transitions. [2019-12-18 18:04:44,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 26565 transitions. [2019-12-18 18:04:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:44,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:44,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:44,407 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:44,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1361343344, now seen corresponding path program 2 times [2019-12-18 18:04:44,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:44,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612474561] [2019-12-18 18:04:44,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:44,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612474561] [2019-12-18 18:04:44,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:44,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:44,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438637283] [2019-12-18 18:04:44,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:44,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:44,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:44,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:44,528 INFO L87 Difference]: Start difference. First operand 11190 states and 26565 transitions. Second operand 7 states. [2019-12-18 18:04:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:45,315 INFO L93 Difference]: Finished difference Result 12540 states and 29360 transitions. [2019-12-18 18:04:45,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:04:45,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:04:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:45,329 INFO L225 Difference]: With dead ends: 12540 [2019-12-18 18:04:45,330 INFO L226 Difference]: Without dead ends: 12540 [2019-12-18 18:04:45,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12540 states. [2019-12-18 18:04:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12540 to 11148. [2019-12-18 18:04:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11148 states. [2019-12-18 18:04:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11148 states to 11148 states and 26469 transitions. [2019-12-18 18:04:45,458 INFO L78 Accepts]: Start accepts. Automaton has 11148 states and 26469 transitions. Word has length 95 [2019-12-18 18:04:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:45,458 INFO L462 AbstractCegarLoop]: Abstraction has 11148 states and 26469 transitions. [2019-12-18 18:04:45,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 11148 states and 26469 transitions. [2019-12-18 18:04:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:45,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:45,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:45,471 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:45,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1386367428, now seen corresponding path program 3 times [2019-12-18 18:04:45,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:45,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985750720] [2019-12-18 18:04:45,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:45,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985750720] [2019-12-18 18:04:45,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:45,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:45,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638734173] [2019-12-18 18:04:45,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:45,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:45,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:45,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:45,589 INFO L87 Difference]: Start difference. First operand 11148 states and 26469 transitions. Second operand 7 states. [2019-12-18 18:04:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:46,588 INFO L93 Difference]: Finished difference Result 23943 states and 56480 transitions. [2019-12-18 18:04:46,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:46,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:04:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:46,613 INFO L225 Difference]: With dead ends: 23943 [2019-12-18 18:04:46,616 INFO L226 Difference]: Without dead ends: 23943 [2019-12-18 18:04:46,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:04:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23943 states. [2019-12-18 18:04:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23943 to 11198. [2019-12-18 18:04:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11198 states. [2019-12-18 18:04:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11198 states to 11198 states and 26587 transitions. [2019-12-18 18:04:46,804 INFO L78 Accepts]: Start accepts. Automaton has 11198 states and 26587 transitions. Word has length 95 [2019-12-18 18:04:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:46,805 INFO L462 AbstractCegarLoop]: Abstraction has 11198 states and 26587 transitions. [2019-12-18 18:04:46,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 11198 states and 26587 transitions. [2019-12-18 18:04:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:46,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:46,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:46,815 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:46,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:46,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1967373798, now seen corresponding path program 4 times [2019-12-18 18:04:46,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:46,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375390989] [2019-12-18 18:04:46,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:46,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375390989] [2019-12-18 18:04:46,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:46,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:04:46,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769225090] [2019-12-18 18:04:46,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:04:46,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:46,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:04:46,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:04:46,905 INFO L87 Difference]: Start difference. First operand 11198 states and 26587 transitions. Second operand 3 states. [2019-12-18 18:04:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:46,973 INFO L93 Difference]: Finished difference Result 11198 states and 26586 transitions. [2019-12-18 18:04:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:04:46,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-18 18:04:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:46,987 INFO L225 Difference]: With dead ends: 11198 [2019-12-18 18:04:46,987 INFO L226 Difference]: Without dead ends: 11198 [2019-12-18 18:04:46,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:04:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11198 states. [2019-12-18 18:04:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11198 to 10659. [2019-12-18 18:04:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10659 states. [2019-12-18 18:04:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10659 states to 10659 states and 25467 transitions. [2019-12-18 18:04:47,102 INFO L78 Accepts]: Start accepts. Automaton has 10659 states and 25467 transitions. Word has length 95 [2019-12-18 18:04:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:47,102 INFO L462 AbstractCegarLoop]: Abstraction has 10659 states and 25467 transitions. [2019-12-18 18:04:47,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:04:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 10659 states and 25467 transitions. [2019-12-18 18:04:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:47,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:47,111 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-18 18:04:47,112 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:47,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:47,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-18 18:04:47,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:47,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021645974] [2019-12-18 18:04:47,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:47,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021645974] [2019-12-18 18:04:47,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:47,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:04:47,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266978484] [2019-12-18 18:04:47,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:04:47,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:47,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:04:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:04:47,387 INFO L87 Difference]: Start difference. First operand 10659 states and 25467 transitions. Second operand 14 states. [2019-12-18 18:04:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:49,455 INFO L93 Difference]: Finished difference Result 15009 states and 34768 transitions. [2019-12-18 18:04:49,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:04:49,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 18:04:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:49,472 INFO L225 Difference]: With dead ends: 15009 [2019-12-18 18:04:49,472 INFO L226 Difference]: Without dead ends: 13915 [2019-12-18 18:04:49,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:04:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13915 states. [2019-12-18 18:04:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13915 to 11545. [2019-12-18 18:04:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11545 states. [2019-12-18 18:04:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11545 states to 11545 states and 27505 transitions. [2019-12-18 18:04:49,610 INFO L78 Accepts]: Start accepts. Automaton has 11545 states and 27505 transitions. Word has length 96 [2019-12-18 18:04:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:49,611 INFO L462 AbstractCegarLoop]: Abstraction has 11545 states and 27505 transitions. [2019-12-18 18:04:49,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:04:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 11545 states and 27505 transitions. [2019-12-18 18:04:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:49,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:49,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:49,622 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1923547038, now seen corresponding path program 2 times [2019-12-18 18:04:49,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:49,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087592212] [2019-12-18 18:04:49,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:49,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087592212] [2019-12-18 18:04:49,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:49,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:49,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329999349] [2019-12-18 18:04:49,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:49,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:49,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:49,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:49,782 INFO L87 Difference]: Start difference. First operand 11545 states and 27505 transitions. Second operand 5 states. [2019-12-18 18:04:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:50,226 INFO L93 Difference]: Finished difference Result 13928 states and 33305 transitions. [2019-12-18 18:04:50,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:04:50,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-18 18:04:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:50,243 INFO L225 Difference]: With dead ends: 13928 [2019-12-18 18:04:50,243 INFO L226 Difference]: Without dead ends: 13928 [2019-12-18 18:04:50,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13928 states. [2019-12-18 18:04:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13928 to 11976. [2019-12-18 18:04:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11976 states. [2019-12-18 18:04:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11976 states to 11976 states and 28582 transitions. [2019-12-18 18:04:50,387 INFO L78 Accepts]: Start accepts. Automaton has 11976 states and 28582 transitions. Word has length 96 [2019-12-18 18:04:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:50,387 INFO L462 AbstractCegarLoop]: Abstraction has 11976 states and 28582 transitions. [2019-12-18 18:04:50,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 11976 states and 28582 transitions. [2019-12-18 18:04:50,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:50,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:50,399 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-18 18:04:50,399 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:50,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:50,399 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 3 times [2019-12-18 18:04:50,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:50,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072918805] [2019-12-18 18:04:50,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:50,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072918805] [2019-12-18 18:04:50,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:50,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:50,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927028032] [2019-12-18 18:04:50,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:50,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:50,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:50,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:50,580 INFO L87 Difference]: Start difference. First operand 11976 states and 28582 transitions. Second operand 10 states. [2019-12-18 18:04:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:51,539 INFO L93 Difference]: Finished difference Result 21004 states and 49830 transitions. [2019-12-18 18:04:51,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:04:51,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:04:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:51,562 INFO L225 Difference]: With dead ends: 21004 [2019-12-18 18:04:51,562 INFO L226 Difference]: Without dead ends: 19809 [2019-12-18 18:04:51,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:04:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19809 states. [2019-12-18 18:04:51,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19809 to 14382. [2019-12-18 18:04:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14382 states. [2019-12-18 18:04:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14382 states to 14382 states and 35033 transitions. [2019-12-18 18:04:51,772 INFO L78 Accepts]: Start accepts. Automaton has 14382 states and 35033 transitions. Word has length 96 [2019-12-18 18:04:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:51,772 INFO L462 AbstractCegarLoop]: Abstraction has 14382 states and 35033 transitions. [2019-12-18 18:04:51,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 14382 states and 35033 transitions. [2019-12-18 18:04:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:51,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:51,785 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-18 18:04:51,785 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:51,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:51,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1281102864, now seen corresponding path program 4 times [2019-12-18 18:04:51,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:51,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067818259] [2019-12-18 18:04:51,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:51,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067818259] [2019-12-18 18:04:51,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:51,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:51,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743953432] [2019-12-18 18:04:51,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:51,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:51,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:51,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:51,880 INFO L87 Difference]: Start difference. First operand 14382 states and 35033 transitions. Second operand 6 states. [2019-12-18 18:04:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:52,592 INFO L93 Difference]: Finished difference Result 17213 states and 41929 transitions. [2019-12-18 18:04:52,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:04:52,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 18:04:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:52,614 INFO L225 Difference]: With dead ends: 17213 [2019-12-18 18:04:52,615 INFO L226 Difference]: Without dead ends: 17213 [2019-12-18 18:04:52,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:04:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17213 states. [2019-12-18 18:04:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17213 to 14387. [2019-12-18 18:04:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14387 states. [2019-12-18 18:04:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14387 states to 14387 states and 35045 transitions. [2019-12-18 18:04:52,932 INFO L78 Accepts]: Start accepts. Automaton has 14387 states and 35045 transitions. Word has length 96 [2019-12-18 18:04:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:52,932 INFO L462 AbstractCegarLoop]: Abstraction has 14387 states and 35045 transitions. [2019-12-18 18:04:52,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 14387 states and 35045 transitions. [2019-12-18 18:04:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:52,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:52,947 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-18 18:04:52,948 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:52,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 5 times [2019-12-18 18:04:52,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:52,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011618377] [2019-12-18 18:04:52,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:53,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011618377] [2019-12-18 18:04:53,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:53,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:04:53,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486321423] [2019-12-18 18:04:53,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:04:53,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:53,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:04:53,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:04:53,240 INFO L87 Difference]: Start difference. First operand 14387 states and 35045 transitions. Second operand 14 states. [2019-12-18 18:04:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:54,530 INFO L93 Difference]: Finished difference Result 19882 states and 48024 transitions. [2019-12-18 18:04:54,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:04:54,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 18:04:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:54,558 INFO L225 Difference]: With dead ends: 19882 [2019-12-18 18:04:54,558 INFO L226 Difference]: Without dead ends: 19852 [2019-12-18 18:04:54,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:04:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19852 states. [2019-12-18 18:04:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19852 to 17217. [2019-12-18 18:04:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17217 states. [2019-12-18 18:04:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17217 states to 17217 states and 42121 transitions. [2019-12-18 18:04:54,784 INFO L78 Accepts]: Start accepts. Automaton has 17217 states and 42121 transitions. Word has length 96 [2019-12-18 18:04:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:54,784 INFO L462 AbstractCegarLoop]: Abstraction has 17217 states and 42121 transitions. [2019-12-18 18:04:54,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:04:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 17217 states and 42121 transitions. [2019-12-18 18:04:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:54,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:54,800 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-18 18:04:54,801 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:54,801 INFO L82 PathProgramCache]: Analyzing trace with hash 471395218, now seen corresponding path program 6 times [2019-12-18 18:04:54,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:54,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850826394] [2019-12-18 18:04:54,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:54,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850826394] [2019-12-18 18:04:54,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:54,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:54,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496676130] [2019-12-18 18:04:54,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:54,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:54,872 INFO L87 Difference]: Start difference. First operand 17217 states and 42121 transitions. Second operand 6 states. [2019-12-18 18:04:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:55,662 INFO L93 Difference]: Finished difference Result 17973 states and 43633 transitions. [2019-12-18 18:04:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:04:55,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 18:04:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:55,688 INFO L225 Difference]: With dead ends: 17973 [2019-12-18 18:04:55,688 INFO L226 Difference]: Without dead ends: 17973 [2019-12-18 18:04:55,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-18 18:04:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17973 states. [2019-12-18 18:04:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17973 to 17312. [2019-12-18 18:04:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17312 states. [2019-12-18 18:04:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17312 states to 17312 states and 42327 transitions. [2019-12-18 18:04:55,925 INFO L78 Accepts]: Start accepts. Automaton has 17312 states and 42327 transitions. Word has length 96 [2019-12-18 18:04:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:55,925 INFO L462 AbstractCegarLoop]: Abstraction has 17312 states and 42327 transitions. [2019-12-18 18:04:55,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 17312 states and 42327 transitions. [2019-12-18 18:04:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:55,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:55,941 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-18 18:04:55,942 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:55,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:55,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1234955586, now seen corresponding path program 7 times [2019-12-18 18:04:55,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:55,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147918943] [2019-12-18 18:04:55,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:56,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147918943] [2019-12-18 18:04:56,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:56,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:04:56,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228226096] [2019-12-18 18:04:56,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:56,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:56,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:56,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:56,156 INFO L87 Difference]: Start difference. First operand 17312 states and 42327 transitions. Second operand 10 states. [2019-12-18 18:04:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:57,611 INFO L93 Difference]: Finished difference Result 22970 states and 55953 transitions. [2019-12-18 18:04:57,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:04:57,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:04:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:57,637 INFO L225 Difference]: With dead ends: 22970 [2019-12-18 18:04:57,637 INFO L226 Difference]: Without dead ends: 22970 [2019-12-18 18:04:57,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:04:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22970 states. [2019-12-18 18:04:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22970 to 18010. [2019-12-18 18:04:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18010 states. [2019-12-18 18:04:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18010 states to 18010 states and 44008 transitions. [2019-12-18 18:04:57,866 INFO L78 Accepts]: Start accepts. Automaton has 18010 states and 44008 transitions. Word has length 96 [2019-12-18 18:04:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:57,866 INFO L462 AbstractCegarLoop]: Abstraction has 18010 states and 44008 transitions. [2019-12-18 18:04:57,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 18010 states and 44008 transitions. [2019-12-18 18:04:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:57,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:57,882 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-18 18:04:57,882 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:57,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:57,882 INFO L82 PathProgramCache]: Analyzing trace with hash -475129518, now seen corresponding path program 8 times [2019-12-18 18:04:57,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:57,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215113840] [2019-12-18 18:04:57,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:58,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215113840] [2019-12-18 18:04:58,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:58,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 18:04:58,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675458394] [2019-12-18 18:04:58,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 18:04:58,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:58,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 18:04:58,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:04:58,448 INFO L87 Difference]: Start difference. First operand 18010 states and 44008 transitions. Second operand 17 states. [2019-12-18 18:05:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:01,482 INFO L93 Difference]: Finished difference Result 18770 states and 44879 transitions. [2019-12-18 18:05:01,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 18:05:01,482 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-18 18:05:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:01,500 INFO L225 Difference]: With dead ends: 18770 [2019-12-18 18:05:01,500 INFO L226 Difference]: Without dead ends: 16246 [2019-12-18 18:05:01,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 18:05:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-18 18:05:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 14604. [2019-12-18 18:05:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14604 states. [2019-12-18 18:05:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14604 states to 14604 states and 35577 transitions. [2019-12-18 18:05:01,760 INFO L78 Accepts]: Start accepts. Automaton has 14604 states and 35577 transitions. Word has length 96 [2019-12-18 18:05:01,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:01,761 INFO L462 AbstractCegarLoop]: Abstraction has 14604 states and 35577 transitions. [2019-12-18 18:05:01,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 18:05:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14604 states and 35577 transitions. [2019-12-18 18:05:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:01,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:01,774 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-18 18:05:01,774 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:01,775 INFO L82 PathProgramCache]: Analyzing trace with hash 424443754, now seen corresponding path program 9 times [2019-12-18 18:05:01,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:01,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86581529] [2019-12-18 18:05:01,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:01,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86581529] [2019-12-18 18:05:01,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:01,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:05:01,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306420653] [2019-12-18 18:05:01,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:05:01,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:05:01,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:01,929 INFO L87 Difference]: Start difference. First operand 14604 states and 35577 transitions. Second operand 10 states. [2019-12-18 18:05:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:02,824 INFO L93 Difference]: Finished difference Result 24508 states and 59467 transitions. [2019-12-18 18:05:02,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:05:02,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:05:02,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:02,850 INFO L225 Difference]: With dead ends: 24508 [2019-12-18 18:05:02,850 INFO L226 Difference]: Without dead ends: 23603 [2019-12-18 18:05:02,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:05:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23603 states. [2019-12-18 18:05:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23603 to 19068. [2019-12-18 18:05:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19068 states. [2019-12-18 18:05:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19068 states to 19068 states and 47243 transitions. [2019-12-18 18:05:03,115 INFO L78 Accepts]: Start accepts. Automaton has 19068 states and 47243 transitions. Word has length 96 [2019-12-18 18:05:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:03,115 INFO L462 AbstractCegarLoop]: Abstraction has 19068 states and 47243 transitions. [2019-12-18 18:05:03,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:05:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 19068 states and 47243 transitions. [2019-12-18 18:05:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:03,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:03,133 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-18 18:05:03,134 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:03,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:03,134 INFO L82 PathProgramCache]: Analyzing trace with hash -956776618, now seen corresponding path program 10 times [2019-12-18 18:05:03,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:03,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435867274] [2019-12-18 18:05:03,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:03,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435867274] [2019-12-18 18:05:03,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:03,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:05:03,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657716209] [2019-12-18 18:05:03,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:05:03,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:03,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:05:03,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:03,326 INFO L87 Difference]: Start difference. First operand 19068 states and 47243 transitions. Second operand 10 states. [2019-12-18 18:05:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:04,451 INFO L93 Difference]: Finished difference Result 34250 states and 82496 transitions. [2019-12-18 18:05:04,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 18:05:04,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:05:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:04,487 INFO L225 Difference]: With dead ends: 34250 [2019-12-18 18:05:04,487 INFO L226 Difference]: Without dead ends: 32494 [2019-12-18 18:05:04,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:05:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32494 states. [2019-12-18 18:05:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32494 to 24422. [2019-12-18 18:05:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24422 states. [2019-12-18 18:05:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24422 states to 24422 states and 60869 transitions. [2019-12-18 18:05:04,957 INFO L78 Accepts]: Start accepts. Automaton has 24422 states and 60869 transitions. Word has length 96 [2019-12-18 18:05:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:04,957 INFO L462 AbstractCegarLoop]: Abstraction has 24422 states and 60869 transitions. [2019-12-18 18:05:04,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:05:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 24422 states and 60869 transitions. [2019-12-18 18:05:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:04,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:04,978 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-18 18:05:04,978 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:04,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1956880096, now seen corresponding path program 11 times [2019-12-18 18:05:04,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:04,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041491452] [2019-12-18 18:05:04,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:05,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041491452] [2019-12-18 18:05:05,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:05,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:05:05,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3222799] [2019-12-18 18:05:05,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:05:05,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:05,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:05:05,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:05:05,135 INFO L87 Difference]: Start difference. First operand 24422 states and 60869 transitions. Second operand 9 states. [2019-12-18 18:05:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:05,698 INFO L93 Difference]: Finished difference Result 38418 states and 95869 transitions. [2019-12-18 18:05:05,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:05:05,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-18 18:05:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:05,737 INFO L225 Difference]: With dead ends: 38418 [2019-12-18 18:05:05,737 INFO L226 Difference]: Without dead ends: 33673 [2019-12-18 18:05:05,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:05:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-18 18:05:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 27885. [2019-12-18 18:05:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27885 states. [2019-12-18 18:05:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27885 states to 27885 states and 69772 transitions. [2019-12-18 18:05:06,097 INFO L78 Accepts]: Start accepts. Automaton has 27885 states and 69772 transitions. Word has length 96 [2019-12-18 18:05:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:06,098 INFO L462 AbstractCegarLoop]: Abstraction has 27885 states and 69772 transitions. [2019-12-18 18:05:06,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:05:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 27885 states and 69772 transitions. [2019-12-18 18:05:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:06,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:06,124 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-18 18:05:06,124 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:06,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:06,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2139042026, now seen corresponding path program 12 times [2019-12-18 18:05:06,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:06,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106324976] [2019-12-18 18:05:06,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:06,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106324976] [2019-12-18 18:05:06,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:06,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 18:05:06,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547818593] [2019-12-18 18:05:06,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 18:05:06,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:06,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 18:05:06,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:05:06,471 INFO L87 Difference]: Start difference. First operand 27885 states and 69772 transitions. Second operand 18 states. [2019-12-18 18:05:11,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:11,101 INFO L93 Difference]: Finished difference Result 49485 states and 122975 transitions. [2019-12-18 18:05:11,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-18 18:05:11,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-18 18:05:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:11,160 INFO L225 Difference]: With dead ends: 49485 [2019-12-18 18:05:11,160 INFO L226 Difference]: Without dead ends: 48211 [2019-12-18 18:05:11,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=478, Invalid=3182, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 18:05:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48211 states. [2019-12-18 18:05:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48211 to 32211. [2019-12-18 18:05:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32211 states. [2019-12-18 18:05:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 80836 transitions. [2019-12-18 18:05:11,692 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 80836 transitions. Word has length 96 [2019-12-18 18:05:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:11,693 INFO L462 AbstractCegarLoop]: Abstraction has 32211 states and 80836 transitions. [2019-12-18 18:05:11,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 18:05:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 80836 transitions. [2019-12-18 18:05:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:11,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:11,921 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-18 18:05:11,921 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash -965764708, now seen corresponding path program 13 times [2019-12-18 18:05:11,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:11,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777600769] [2019-12-18 18:05:11,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:12,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777600769] [2019-12-18 18:05:12,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:12,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:05:12,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900241264] [2019-12-18 18:05:12,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:05:12,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:12,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:05:12,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:05:12,039 INFO L87 Difference]: Start difference. First operand 32211 states and 80836 transitions. Second operand 9 states. [2019-12-18 18:05:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:12,757 INFO L93 Difference]: Finished difference Result 48249 states and 121580 transitions. [2019-12-18 18:05:12,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 18:05:12,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-18 18:05:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:12,828 INFO L225 Difference]: With dead ends: 48249 [2019-12-18 18:05:12,828 INFO L226 Difference]: Without dead ends: 47395 [2019-12-18 18:05:12,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:05:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47395 states. [2019-12-18 18:05:13,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47395 to 42548. [2019-12-18 18:05:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42548 states. [2019-12-18 18:05:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42548 states to 42548 states and 108640 transitions. [2019-12-18 18:05:13,449 INFO L78 Accepts]: Start accepts. Automaton has 42548 states and 108640 transitions. Word has length 96 [2019-12-18 18:05:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:13,449 INFO L462 AbstractCegarLoop]: Abstraction has 42548 states and 108640 transitions. [2019-12-18 18:05:13,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:05:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 42548 states and 108640 transitions. [2019-12-18 18:05:13,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:13,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:13,491 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-18 18:05:13,491 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:13,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:13,492 INFO L82 PathProgramCache]: Analyzing trace with hash -952141892, now seen corresponding path program 14 times [2019-12-18 18:05:13,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:13,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395862110] [2019-12-18 18:05:13,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:13,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395862110] [2019-12-18 18:05:13,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:13,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:05:13,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890551035] [2019-12-18 18:05:13,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:05:13,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:13,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:05:13,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:13,662 INFO L87 Difference]: Start difference. First operand 42548 states and 108640 transitions. Second operand 10 states. [2019-12-18 18:05:14,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:14,986 INFO L93 Difference]: Finished difference Result 54544 states and 136127 transitions. [2019-12-18 18:05:14,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:05:14,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:05:14,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:15,046 INFO L225 Difference]: With dead ends: 54544 [2019-12-18 18:05:15,047 INFO L226 Difference]: Without dead ends: 53884 [2019-12-18 18:05:15,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:05:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53884 states. [2019-12-18 18:05:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53884 to 38495. [2019-12-18 18:05:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38495 states. [2019-12-18 18:05:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38495 states to 38495 states and 97342 transitions. [2019-12-18 18:05:15,650 INFO L78 Accepts]: Start accepts. Automaton has 38495 states and 97342 transitions. Word has length 96 [2019-12-18 18:05:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:15,651 INFO L462 AbstractCegarLoop]: Abstraction has 38495 states and 97342 transitions. [2019-12-18 18:05:15,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:05:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 38495 states and 97342 transitions. [2019-12-18 18:05:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:15,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:15,689 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-18 18:05:15,689 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:15,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1214243056, now seen corresponding path program 15 times [2019-12-18 18:05:15,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:15,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513390644] [2019-12-18 18:05:15,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:15,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513390644] [2019-12-18 18:05:15,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:15,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:05:15,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818878408] [2019-12-18 18:05:15,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:05:15,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:05:15,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:05:15,863 INFO L87 Difference]: Start difference. First operand 38495 states and 97342 transitions. Second operand 13 states. [2019-12-18 18:05:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:18,066 INFO L93 Difference]: Finished difference Result 54430 states and 135337 transitions. [2019-12-18 18:05:18,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 18:05:18,067 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-18 18:05:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:18,351 INFO L225 Difference]: With dead ends: 54430 [2019-12-18 18:05:18,351 INFO L226 Difference]: Without dead ends: 53685 [2019-12-18 18:05:18,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 18:05:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53685 states. [2019-12-18 18:05:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53685 to 40696. [2019-12-18 18:05:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40696 states. [2019-12-18 18:05:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40696 states to 40696 states and 103151 transitions. [2019-12-18 18:05:18,912 INFO L78 Accepts]: Start accepts. Automaton has 40696 states and 103151 transitions. Word has length 96 [2019-12-18 18:05:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:18,912 INFO L462 AbstractCegarLoop]: Abstraction has 40696 states and 103151 transitions. [2019-12-18 18:05:18,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:05:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 40696 states and 103151 transitions. [2019-12-18 18:05:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:18,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:18,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, 1, 1] [2019-12-18 18:05:18,950 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:18,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash -136687160, now seen corresponding path program 16 times [2019-12-18 18:05:18,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:18,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106896186] [2019-12-18 18:05:18,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:19,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106896186] [2019-12-18 18:05:19,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:19,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:05:19,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250210848] [2019-12-18 18:05:19,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:05:19,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:05:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:05:19,083 INFO L87 Difference]: Start difference. First operand 40696 states and 103151 transitions. Second operand 6 states. [2019-12-18 18:05:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:19,558 INFO L93 Difference]: Finished difference Result 41241 states and 104300 transitions. [2019-12-18 18:05:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:05:19,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 18:05:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:19,606 INFO L225 Difference]: With dead ends: 41241 [2019-12-18 18:05:19,606 INFO L226 Difference]: Without dead ends: 41241 [2019-12-18 18:05:19,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:05:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41241 states. [2019-12-18 18:05:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41241 to 40225. [2019-12-18 18:05:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40225 states. [2019-12-18 18:05:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40225 states to 40225 states and 102021 transitions. [2019-12-18 18:05:20,371 INFO L78 Accepts]: Start accepts. Automaton has 40225 states and 102021 transitions. Word has length 96 [2019-12-18 18:05:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:20,371 INFO L462 AbstractCegarLoop]: Abstraction has 40225 states and 102021 transitions. [2019-12-18 18:05:20,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:05:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 40225 states and 102021 transitions. [2019-12-18 18:05:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:20,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:20,409 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-18 18:05:20,409 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:20,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:20,409 INFO L82 PathProgramCache]: Analyzing trace with hash -942006980, now seen corresponding path program 17 times [2019-12-18 18:05:20,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:20,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994229907] [2019-12-18 18:05:20,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:20,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994229907] [2019-12-18 18:05:20,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:20,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:05:20,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712468090] [2019-12-18 18:05:20,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:05:20,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:20,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:05:20,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:05:20,472 INFO L87 Difference]: Start difference. First operand 40225 states and 102021 transitions. Second operand 4 states. [2019-12-18 18:05:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:20,745 INFO L93 Difference]: Finished difference Result 48636 states and 121397 transitions. [2019-12-18 18:05:20,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:05:20,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-18 18:05:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:20,797 INFO L225 Difference]: With dead ends: 48636 [2019-12-18 18:05:20,797 INFO L226 Difference]: Without dead ends: 48588 [2019-12-18 18:05:20,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:05:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48588 states. [2019-12-18 18:05:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48588 to 39294. [2019-12-18 18:05:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39294 states. [2019-12-18 18:05:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39294 states to 39294 states and 99436 transitions. [2019-12-18 18:05:21,336 INFO L78 Accepts]: Start accepts. Automaton has 39294 states and 99436 transitions. Word has length 96 [2019-12-18 18:05:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:21,336 INFO L462 AbstractCegarLoop]: Abstraction has 39294 states and 99436 transitions. [2019-12-18 18:05:21,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:05:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 39294 states and 99436 transitions. [2019-12-18 18:05:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:21,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:21,373 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-18 18:05:21,373 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1771219286, now seen corresponding path program 18 times [2019-12-18 18:05:21,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:21,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577112280] [2019-12-18 18:05:21,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:21,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577112280] [2019-12-18 18:05:21,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:21,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:05:21,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917776247] [2019-12-18 18:05:21,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:05:21,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:05:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:05:21,570 INFO L87 Difference]: Start difference. First operand 39294 states and 99436 transitions. Second operand 11 states. [2019-12-18 18:05:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:23,298 INFO L93 Difference]: Finished difference Result 57306 states and 143263 transitions. [2019-12-18 18:05:23,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 18:05:23,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 18:05:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:23,388 INFO L225 Difference]: With dead ends: 57306 [2019-12-18 18:05:23,388 INFO L226 Difference]: Without dead ends: 56393 [2019-12-18 18:05:23,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 18:05:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56393 states. [2019-12-18 18:05:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56393 to 40243. [2019-12-18 18:05:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40243 states. [2019-12-18 18:05:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40243 states to 40243 states and 101917 transitions. [2019-12-18 18:05:24,028 INFO L78 Accepts]: Start accepts. Automaton has 40243 states and 101917 transitions. Word has length 96 [2019-12-18 18:05:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:24,029 INFO L462 AbstractCegarLoop]: Abstraction has 40243 states and 101917 transitions. [2019-12-18 18:05:24,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:05:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 40243 states and 101917 transitions. [2019-12-18 18:05:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:24,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:24,068 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-18 18:05:24,068 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1834207958, now seen corresponding path program 19 times [2019-12-18 18:05:24,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:24,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331377281] [2019-12-18 18:05:24,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:24,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331377281] [2019-12-18 18:05:24,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:24,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:05:24,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244226361] [2019-12-18 18:05:24,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:05:24,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:24,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:05:24,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:05:24,168 INFO L87 Difference]: Start difference. First operand 40243 states and 101917 transitions. Second operand 7 states. [2019-12-18 18:05:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:24,468 INFO L93 Difference]: Finished difference Result 44387 states and 111354 transitions. [2019-12-18 18:05:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:05:24,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 18:05:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:24,519 INFO L225 Difference]: With dead ends: 44387 [2019-12-18 18:05:24,519 INFO L226 Difference]: Without dead ends: 41880 [2019-12-18 18:05:24,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:05:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41880 states. [2019-12-18 18:05:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41880 to 39392. [2019-12-18 18:05:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39392 states. [2019-12-18 18:05:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39392 states to 39392 states and 100000 transitions. [2019-12-18 18:05:25,376 INFO L78 Accepts]: Start accepts. Automaton has 39392 states and 100000 transitions. Word has length 96 [2019-12-18 18:05:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:25,376 INFO L462 AbstractCegarLoop]: Abstraction has 39392 states and 100000 transitions. [2019-12-18 18:05:25,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:05:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 39392 states and 100000 transitions. [2019-12-18 18:05:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:25,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:25,421 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-18 18:05:25,421 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1902283150, now seen corresponding path program 20 times [2019-12-18 18:05:25,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:25,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676214499] [2019-12-18 18:05:25,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:25,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676214499] [2019-12-18 18:05:25,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:25,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:05:25,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169053527] [2019-12-18 18:05:25,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:05:25,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:25,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:05:25,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:05:25,572 INFO L87 Difference]: Start difference. First operand 39392 states and 100000 transitions. Second operand 7 states. [2019-12-18 18:05:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:26,290 INFO L93 Difference]: Finished difference Result 41937 states and 106115 transitions. [2019-12-18 18:05:26,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:05:26,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 18:05:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:26,341 INFO L225 Difference]: With dead ends: 41937 [2019-12-18 18:05:26,341 INFO L226 Difference]: Without dead ends: 41937 [2019-12-18 18:05:26,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:05:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41937 states. [2019-12-18 18:05:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41937 to 37826. [2019-12-18 18:05:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37826 states. [2019-12-18 18:05:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37826 states to 37826 states and 95845 transitions. [2019-12-18 18:05:26,837 INFO L78 Accepts]: Start accepts. Automaton has 37826 states and 95845 transitions. Word has length 96 [2019-12-18 18:05:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:26,837 INFO L462 AbstractCegarLoop]: Abstraction has 37826 states and 95845 transitions. [2019-12-18 18:05:26,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:05:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 37826 states and 95845 transitions. [2019-12-18 18:05:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:26,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:26,875 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-18 18:05:26,875 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash 627550158, now seen corresponding path program 21 times [2019-12-18 18:05:26,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:26,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075019768] [2019-12-18 18:05:26,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:27,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075019768] [2019-12-18 18:05:27,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:27,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:05:27,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130266738] [2019-12-18 18:05:27,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:05:27,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:27,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:05:27,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:05:27,194 INFO L87 Difference]: Start difference. First operand 37826 states and 95845 transitions. Second operand 16 states. [2019-12-18 18:05:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:29,562 INFO L93 Difference]: Finished difference Result 65787 states and 165857 transitions. [2019-12-18 18:05:29,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 18:05:29,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-18 18:05:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:29,637 INFO L225 Difference]: With dead ends: 65787 [2019-12-18 18:05:29,638 INFO L226 Difference]: Without dead ends: 58878 [2019-12-18 18:05:29,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=412, Invalid=2240, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 18:05:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58878 states. [2019-12-18 18:05:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58878 to 28988. [2019-12-18 18:05:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28988 states. [2019-12-18 18:05:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28988 states to 28988 states and 72370 transitions. [2019-12-18 18:05:30,143 INFO L78 Accepts]: Start accepts. Automaton has 28988 states and 72370 transitions. Word has length 96 [2019-12-18 18:05:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:30,143 INFO L462 AbstractCegarLoop]: Abstraction has 28988 states and 72370 transitions. [2019-12-18 18:05:30,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:05:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 28988 states and 72370 transitions. [2019-12-18 18:05:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:30,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:30,172 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, 1] [2019-12-18 18:05:30,172 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-18 18:05:30,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:30,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350308460] [2019-12-18 18:05:30,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:30,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350308460] [2019-12-18 18:05:30,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:30,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:05:30,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501742372] [2019-12-18 18:05:30,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:05:30,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:30,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:05:30,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:05:30,460 INFO L87 Difference]: Start difference. First operand 28988 states and 72370 transitions. Second operand 13 states. [2019-12-18 18:05:33,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:33,773 INFO L93 Difference]: Finished difference Result 58778 states and 145546 transitions. [2019-12-18 18:05:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 18:05:33,774 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-12-18 18:05:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:33,842 INFO L225 Difference]: With dead ends: 58778 [2019-12-18 18:05:33,842 INFO L226 Difference]: Without dead ends: 50141 [2019-12-18 18:05:33,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=1277, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 18:05:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50141 states. [2019-12-18 18:05:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50141 to 33977. [2019-12-18 18:05:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33977 states. [2019-12-18 18:05:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33977 states to 33977 states and 85604 transitions. [2019-12-18 18:05:34,521 INFO L78 Accepts]: Start accepts. Automaton has 33977 states and 85604 transitions. Word has length 97 [2019-12-18 18:05:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:34,521 INFO L462 AbstractCegarLoop]: Abstraction has 33977 states and 85604 transitions. [2019-12-18 18:05:34,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:05:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33977 states and 85604 transitions. [2019-12-18 18:05:34,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:34,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:34,554 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, 1] [2019-12-18 18:05:34,554 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:34,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-18 18:05:34,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:34,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544144276] [2019-12-18 18:05:34,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:34,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544144276] [2019-12-18 18:05:34,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:34,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:05:34,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103076774] [2019-12-18 18:05:34,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:05:34,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:34,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:05:34,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:05:34,683 INFO L87 Difference]: Start difference. First operand 33977 states and 85604 transitions. Second operand 6 states. [2019-12-18 18:05:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:34,872 INFO L93 Difference]: Finished difference Result 33499 states and 84219 transitions. [2019-12-18 18:05:34,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:05:34,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 18:05:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:34,909 INFO L225 Difference]: With dead ends: 33499 [2019-12-18 18:05:34,909 INFO L226 Difference]: Without dead ends: 33499 [2019-12-18 18:05:34,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:05:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33499 states. [2019-12-18 18:05:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33499 to 28750. [2019-12-18 18:05:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28750 states. [2019-12-18 18:05:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28750 states to 28750 states and 72206 transitions. [2019-12-18 18:05:35,291 INFO L78 Accepts]: Start accepts. Automaton has 28750 states and 72206 transitions. Word has length 97 [2019-12-18 18:05:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:35,291 INFO L462 AbstractCegarLoop]: Abstraction has 28750 states and 72206 transitions. [2019-12-18 18:05:35,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:05:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 28750 states and 72206 transitions. [2019-12-18 18:05:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:35,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:35,318 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, 1] [2019-12-18 18:05:35,318 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:35,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:35,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-18 18:05:35,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:35,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641901170] [2019-12-18 18:05:35,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:35,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641901170] [2019-12-18 18:05:35,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:35,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:05:35,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704259914] [2019-12-18 18:05:35,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:05:35,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:05:35,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:05:35,438 INFO L87 Difference]: Start difference. First operand 28750 states and 72206 transitions. Second operand 7 states. [2019-12-18 18:05:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:36,461 INFO L93 Difference]: Finished difference Result 40984 states and 102408 transitions. [2019-12-18 18:05:36,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:05:36,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 18:05:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:36,506 INFO L225 Difference]: With dead ends: 40984 [2019-12-18 18:05:36,506 INFO L226 Difference]: Without dead ends: 40932 [2019-12-18 18:05:36,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40932 states. [2019-12-18 18:05:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40932 to 33119. [2019-12-18 18:05:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33119 states. [2019-12-18 18:05:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33119 states to 33119 states and 83221 transitions. [2019-12-18 18:05:37,098 INFO L78 Accepts]: Start accepts. Automaton has 33119 states and 83221 transitions. Word has length 97 [2019-12-18 18:05:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:37,098 INFO L462 AbstractCegarLoop]: Abstraction has 33119 states and 83221 transitions. [2019-12-18 18:05:37,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:05:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 33119 states and 83221 transitions. [2019-12-18 18:05:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:37,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:37,130 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, 1] [2019-12-18 18:05:37,130 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:37,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 2 times [2019-12-18 18:05:37,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:37,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413882510] [2019-12-18 18:05:37,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:37,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413882510] [2019-12-18 18:05:37,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:37,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 18:05:37,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31014710] [2019-12-18 18:05:37,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 18:05:37,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:37,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 18:05:37,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:05:37,622 INFO L87 Difference]: Start difference. First operand 33119 states and 83221 transitions. Second operand 19 states. [2019-12-18 18:05:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:40,970 INFO L93 Difference]: Finished difference Result 42184 states and 105031 transitions. [2019-12-18 18:05:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 18:05:40,970 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-12-18 18:05:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:41,018 INFO L225 Difference]: With dead ends: 42184 [2019-12-18 18:05:41,018 INFO L226 Difference]: Without dead ends: 42184 [2019-12-18 18:05:41,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-12-18 18:05:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42184 states. [2019-12-18 18:05:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42184 to 33620. [2019-12-18 18:05:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33620 states. [2019-12-18 18:05:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33620 states to 33620 states and 84355 transitions. [2019-12-18 18:05:41,461 INFO L78 Accepts]: Start accepts. Automaton has 33620 states and 84355 transitions. Word has length 97 [2019-12-18 18:05:41,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:41,462 INFO L462 AbstractCegarLoop]: Abstraction has 33620 states and 84355 transitions. [2019-12-18 18:05:41,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 18:05:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 33620 states and 84355 transitions. [2019-12-18 18:05:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:41,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:41,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:41,716 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:41,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash -648007813, now seen corresponding path program 3 times [2019-12-18 18:05:41,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:41,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883333800] [2019-12-18 18:05:41,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:42,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883333800] [2019-12-18 18:05:42,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:42,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:05:42,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791326014] [2019-12-18 18:05:42,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:05:42,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:05:42,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:05:42,120 INFO L87 Difference]: Start difference. First operand 33620 states and 84355 transitions. Second operand 13 states. [2019-12-18 18:05:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:43,984 INFO L93 Difference]: Finished difference Result 42697 states and 106020 transitions. [2019-12-18 18:05:43,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 18:05:43,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-12-18 18:05:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:44,033 INFO L225 Difference]: With dead ends: 42697 [2019-12-18 18:05:44,034 INFO L226 Difference]: Without dead ends: 42697 [2019-12-18 18:05:44,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:05:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42697 states. [2019-12-18 18:05:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42697 to 34356. [2019-12-18 18:05:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34356 states. [2019-12-18 18:05:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34356 states to 34356 states and 86155 transitions. [2019-12-18 18:05:44,505 INFO L78 Accepts]: Start accepts. Automaton has 34356 states and 86155 transitions. Word has length 97 [2019-12-18 18:05:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:44,506 INFO L462 AbstractCegarLoop]: Abstraction has 34356 states and 86155 transitions. [2019-12-18 18:05:44,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:05:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 34356 states and 86155 transitions. [2019-12-18 18:05:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:44,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:44,538 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, 1] [2019-12-18 18:05:44,538 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 4 times [2019-12-18 18:05:44,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:44,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379841268] [2019-12-18 18:05:44,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:44,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379841268] [2019-12-18 18:05:44,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:44,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:05:44,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093401946] [2019-12-18 18:05:44,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:05:44,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:05:44,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:05:44,643 INFO L87 Difference]: Start difference. First operand 34356 states and 86155 transitions. Second operand 7 states. [2019-12-18 18:05:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:45,631 INFO L93 Difference]: Finished difference Result 46096 states and 115462 transitions. [2019-12-18 18:05:45,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:05:45,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 18:05:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:45,684 INFO L225 Difference]: With dead ends: 46096 [2019-12-18 18:05:45,684 INFO L226 Difference]: Without dead ends: 46073 [2019-12-18 18:05:45,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:05:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46073 states. [2019-12-18 18:05:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46073 to 35693. [2019-12-18 18:05:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35693 states. [2019-12-18 18:05:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35693 states to 35693 states and 89608 transitions. [2019-12-18 18:05:46,353 INFO L78 Accepts]: Start accepts. Automaton has 35693 states and 89608 transitions. Word has length 97 [2019-12-18 18:05:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:46,354 INFO L462 AbstractCegarLoop]: Abstraction has 35693 states and 89608 transitions. [2019-12-18 18:05:46,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:05:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 35693 states and 89608 transitions. [2019-12-18 18:05:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:46,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:46,388 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, 1] [2019-12-18 18:05:46,388 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:46,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 5 times [2019-12-18 18:05:46,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:46,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415859698] [2019-12-18 18:05:46,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:46,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415859698] [2019-12-18 18:05:46,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:46,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 18:05:46,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370595843] [2019-12-18 18:05:46,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 18:05:46,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 18:05:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:05:46,806 INFO L87 Difference]: Start difference. First operand 35693 states and 89608 transitions. Second operand 18 states. [2019-12-18 18:05:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:51,449 INFO L93 Difference]: Finished difference Result 52035 states and 130460 transitions. [2019-12-18 18:05:51,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 18:05:51,449 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-12-18 18:05:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:51,506 INFO L225 Difference]: With dead ends: 52035 [2019-12-18 18:05:51,506 INFO L226 Difference]: Without dead ends: 49644 [2019-12-18 18:05:51,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=2134, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 18:05:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49644 states. [2019-12-18 18:05:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49644 to 40179. [2019-12-18 18:05:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40179 states. [2019-12-18 18:05:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40179 states to 40179 states and 101157 transitions. [2019-12-18 18:05:52,332 INFO L78 Accepts]: Start accepts. Automaton has 40179 states and 101157 transitions. Word has length 97 [2019-12-18 18:05:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:52,332 INFO L462 AbstractCegarLoop]: Abstraction has 40179 states and 101157 transitions. [2019-12-18 18:05:52,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 18:05:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 40179 states and 101157 transitions. [2019-12-18 18:05:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:52,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:52,369 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, 1] [2019-12-18 18:05:52,369 INFO L410 AbstractCegarLoop]: === Iteration 51 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:52,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:52,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1999136157, now seen corresponding path program 6 times [2019-12-18 18:05:52,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:52,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533600571] [2019-12-18 18:05:52,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:52,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:52,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533600571] [2019-12-18 18:05:52,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:52,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 18:05:52,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212438264] [2019-12-18 18:05:52,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 18:05:52,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:52,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 18:05:52,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:05:52,692 INFO L87 Difference]: Start difference. First operand 40179 states and 101157 transitions. Second operand 18 states. [2019-12-18 18:05:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:56,708 INFO L93 Difference]: Finished difference Result 55459 states and 137962 transitions. [2019-12-18 18:05:56,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 18:05:56,709 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-12-18 18:05:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:56,770 INFO L225 Difference]: With dead ends: 55459 [2019-12-18 18:05:56,770 INFO L226 Difference]: Without dead ends: 53200 [2019-12-18 18:05:56,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=363, Invalid=2393, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 18:05:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53200 states. [2019-12-18 18:05:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53200 to 40108. [2019-12-18 18:05:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40108 states. [2019-12-18 18:05:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40108 states to 40108 states and 100994 transitions. [2019-12-18 18:05:57,366 INFO L78 Accepts]: Start accepts. Automaton has 40108 states and 100994 transitions. Word has length 97 [2019-12-18 18:05:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:57,367 INFO L462 AbstractCegarLoop]: Abstraction has 40108 states and 100994 transitions. [2019-12-18 18:05:57,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 18:05:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 40108 states and 100994 transitions. [2019-12-18 18:05:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:57,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:57,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:57,406 INFO L410 AbstractCegarLoop]: === Iteration 52 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:57,407 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 7 times [2019-12-18 18:05:57,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:57,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820062645] [2019-12-18 18:05:57,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:57,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820062645] [2019-12-18 18:05:57,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:57,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:05:57,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009229879] [2019-12-18 18:05:57,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:05:57,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:57,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:05:57,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:57,546 INFO L87 Difference]: Start difference. First operand 40108 states and 100994 transitions. Second operand 10 states. [2019-12-18 18:05:57,719 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 6 Received shutdown request... [2019-12-18 18:05:57,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:05:57,725 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 18:05:57,730 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 18:05:57,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:05:57 BasicIcfg [2019-12-18 18:05:57,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:05:57,731 INFO L168 Benchmark]: Toolchain (without parser) took 207825.38 ms. Allocated memory was 145.2 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 101.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 451.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:05:57,732 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:05:57,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 988.04 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 151.4 MB in the end (delta: -50.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:05:57,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.31 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 148.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:05:57,732 INFO L168 Benchmark]: Boogie Preprocessor took 82.98 ms. Allocated memory is still 202.4 MB. Free memory was 148.0 MB in the beginning and 144.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:05:57,733 INFO L168 Benchmark]: RCFGBuilder took 1182.66 ms. Allocated memory was 202.4 MB in the beginning and 235.9 MB in the end (delta: 33.6 MB). Free memory was 144.6 MB in the beginning and 189.7 MB in the end (delta: -45.2 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:05:57,733 INFO L168 Benchmark]: TraceAbstraction took 205486.99 ms. Allocated memory was 235.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 188.3 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 448.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:05:57,734 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.39 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 988.04 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 151.4 MB in the end (delta: -50.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.31 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 148.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.98 ms. Allocated memory is still 202.4 MB. Free memory was 148.0 MB in the beginning and 144.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1182.66 ms. Allocated memory was 202.4 MB in the beginning and 235.9 MB in the end (delta: 33.6 MB). Free memory was 144.6 MB in the beginning and 189.7 MB in the end (delta: -45.2 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205486.99 ms. Allocated memory was 235.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 188.3 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 448.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.5s, 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.2s, 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 (40108states) and FLOYD_HOARE automaton (currently 4 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (40108states) and FLOYD_HOARE automaton (currently 4 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 205.2s, OverallIterations: 52, TraceHistogramMax: 1, AutomataDifference: 92.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 22645 SDtfs, 27968 SDslu, 107791 SDs, 0 SdLazy, 50557 SolverSat, 1621 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1075 GetRequests, 188 SyntacticMatches, 81 SemanticMatches, 806 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5511 ImplicationChecksByTransitivity, 14.4s 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: 76.9s AutomataMinimizationTime, 51 MinimizatonAttempts, 353877 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 4318 NumberOfCodeBlocks, 4318 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 4266 ConstructedInterpolants, 0 QuantifiedInterpolants, 1469977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 52 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