/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/mix052_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:47:26,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:47:26,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:47:26,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:47:26,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:47:26,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:47:26,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:47:26,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:47:26,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:47:26,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:47:26,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:47:26,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:47:26,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:47:26,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:47:26,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:47:26,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:47:26,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:47:26,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:47:26,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:47:26,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:47:26,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:47:26,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:47:26,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:47:26,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:47:26,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:47:26,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:47:26,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:47:26,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:47:26,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:47:27,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:47:27,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:47:27,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:47:27,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:47:27,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:47:27,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:47:27,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:47:27,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:47:27,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:47:27,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:47:27,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:47:27,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:47:27,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:47:27,040 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:47:27,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:47:27,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:47:27,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:47:27,043 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:47:27,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:47:27,043 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:47:27,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:47:27,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:47:27,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:47:27,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:47:27,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:47:27,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:47:27,046 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:47:27,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:47:27,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:47:27,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:47:27,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:47:27,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:47:27,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:47:27,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:47:27,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:47:27,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:47:27,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:47:27,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:47:27,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:47:27,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:47:27,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:47:27,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:47:27,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:47:27,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:47:27,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:47:27,345 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:47:27,345 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:47:27,346 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i [2019-12-18 17:47:27,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0703e420c/b712b12502bf46329dbb57c2e5584448/FLAG57526e460 [2019-12-18 17:47:28,028 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:47:28,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i [2019-12-18 17:47:28,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0703e420c/b712b12502bf46329dbb57c2e5584448/FLAG57526e460 [2019-12-18 17:47:28,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0703e420c/b712b12502bf46329dbb57c2e5584448 [2019-12-18 17:47:28,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:47:28,281 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:47:28,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:47:28,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:47:28,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:47:28,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:47:28" (1/1) ... [2019-12-18 17:47:28,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77911bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:28, skipping insertion in model container [2019-12-18 17:47:28,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:47:28" (1/1) ... [2019-12-18 17:47:28,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:47:28,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:47:28,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:47:28,867 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:47:28,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:47:29,019 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:47:29,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29 WrapperNode [2019-12-18 17:47:29,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:47:29,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:47:29,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:47:29,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:47:29,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (1/1) ... [2019-12-18 17:47:29,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (1/1) ... [2019-12-18 17:47:29,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:47:29,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:47:29,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:47:29,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:47:29,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (1/1) ... [2019-12-18 17:47:29,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (1/1) ... [2019-12-18 17:47:29,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (1/1) ... [2019-12-18 17:47:29,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (1/1) ... [2019-12-18 17:47:29,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (1/1) ... [2019-12-18 17:47:29,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (1/1) ... [2019-12-18 17:47:29,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (1/1) ... [2019-12-18 17:47:29,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:47:29,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:47:29,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:47:29,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:47:29,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:47:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:47:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:47:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:47:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:47:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:47:29,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:47:29,199 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:47:29,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:47:29,199 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:47:29,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:47:29,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:47:29,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:47:29,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:47:29,201 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:47:29,953 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:47:29,953 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:47:29,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:47:29 BoogieIcfgContainer [2019-12-18 17:47:29,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:47:29,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:47:29,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:47:29,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:47:29,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:47:28" (1/3) ... [2019-12-18 17:47:29,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d69d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:47:29, skipping insertion in model container [2019-12-18 17:47:29,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:29" (2/3) ... [2019-12-18 17:47:29,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d69d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:47:29, skipping insertion in model container [2019-12-18 17:47:29,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:47:29" (3/3) ... [2019-12-18 17:47:29,968 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc.i [2019-12-18 17:47:29,979 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:47:29,979 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:47:29,996 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:47:29,997 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:47:30,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,064 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,064 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,065 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,074 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,092 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,100 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,101 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,131 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,136 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,138 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:30,161 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:47:30,181 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:47:30,181 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:47:30,182 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:47:30,182 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:47:30,182 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:47:30,182 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:47:30,182 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:47:30,182 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:47:30,200 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 17:47:30,202 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:47:30,327 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:47:30,327 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:47:30,353 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:47:30,380 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:47:30,456 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:47:30,456 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:47:30,465 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:47:30,489 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 17:47:30,490 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:47:36,177 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 17:47:36,304 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:47:36,674 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-18 17:47:36,674 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 17:47:36,678 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 17:47:54,666 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-18 17:47:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-18 17:47:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:47:54,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:47:54,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:47:54,675 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:47:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:47:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-18 17:47:54,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:47:54,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833715314] [2019-12-18 17:47:54,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:47:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:47:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:47:54,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833715314] [2019-12-18 17:47:54,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:47:54,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:47:54,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724383564] [2019-12-18 17:47:54,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:47:54,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:47:54,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:47:54,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:47:54,935 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-18 17:47:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:47:58,729 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-18 17:47:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:47:58,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:47:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:47:59,362 INFO L225 Difference]: With dead ends: 110910 [2019-12-18 17:47:59,362 INFO L226 Difference]: Without dead ends: 98066 [2019-12-18 17:47:59,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-18 17:48:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-18 17:48:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-18 17:48:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-18 17:48:05,678 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-18 17:48:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:05,679 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-18 17:48:05,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:48:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-18 17:48:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:48:05,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:05,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:05,684 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:05,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-18 17:48:05,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:05,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799467416] [2019-12-18 17:48:05,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:05,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799467416] [2019-12-18 17:48:05,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:05,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:48:05,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777058700] [2019-12-18 17:48:05,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:48:05,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:05,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:48:05,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:48:05,834 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-18 17:48:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:10,601 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-18 17:48:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:48:10,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:48:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:11,150 INFO L225 Difference]: With dead ends: 156656 [2019-12-18 17:48:11,150 INFO L226 Difference]: Without dead ends: 156558 [2019-12-18 17:48:11,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:48:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-18 17:48:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-18 17:48:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-18 17:48:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-18 17:48:27,457 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-18 17:48:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:27,457 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-18 17:48:27,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:48:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-18 17:48:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:48:27,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:27,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:27,464 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-18 17:48:27,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:27,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891179659] [2019-12-18 17:48:27,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:27,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891179659] [2019-12-18 17:48:27,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:27,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:48:27,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451532808] [2019-12-18 17:48:27,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:48:27,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:48:27,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:27,562 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-18 17:48:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:27,686 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-18 17:48:27,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:48:27,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:48:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:27,754 INFO L225 Difference]: With dead ends: 31386 [2019-12-18 17:48:27,755 INFO L226 Difference]: Without dead ends: 31386 [2019-12-18 17:48:27,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-18 17:48:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-18 17:48:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-18 17:48:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-18 17:48:28,353 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-18 17:48:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:28,354 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-18 17:48:28,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:48:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-18 17:48:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:48:28,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:28,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:28,357 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:28,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:28,357 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-18 17:48:28,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:28,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875391200] [2019-12-18 17:48:28,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:28,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875391200] [2019-12-18 17:48:28,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:28,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:48:28,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318841235] [2019-12-18 17:48:28,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:48:28,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:28,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:48:28,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:48:28,446 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-18 17:48:28,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:28,936 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-18 17:48:28,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:48:28,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 17:48:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:29,023 INFO L225 Difference]: With dead ends: 43205 [2019-12-18 17:48:29,023 INFO L226 Difference]: Without dead ends: 43205 [2019-12-18 17:48:29,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:48:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-18 17:48:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-18 17:48:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-18 17:48:31,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-18 17:48:31,038 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-18 17:48:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:31,039 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-18 17:48:31,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:48:31,039 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-18 17:48:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:48:31,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:31,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:31,050 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-18 17:48:31,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:31,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496120283] [2019-12-18 17:48:31,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:31,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496120283] [2019-12-18 17:48:31,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:31,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:48:31,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678991260] [2019-12-18 17:48:31,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:48:31,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:31,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:48:31,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:48:31,165 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-18 17:48:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:32,132 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-18 17:48:32,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:48:32,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 17:48:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:32,227 INFO L225 Difference]: With dead ends: 56051 [2019-12-18 17:48:32,227 INFO L226 Difference]: Without dead ends: 56037 [2019-12-18 17:48:32,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:48:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-18 17:48:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-18 17:48:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-18 17:48:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-18 17:48:33,901 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-18 17:48:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:33,901 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-18 17:48:33,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:48:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-18 17:48:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:48:33,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:33,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:33,917 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:33,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-18 17:48:33,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:33,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770084079] [2019-12-18 17:48:33,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:33,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770084079] [2019-12-18 17:48:33,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:33,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:48:33,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798723795] [2019-12-18 17:48:33,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:48:33,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:33,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:48:33,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:48:33,979 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-18 17:48:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:34,038 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-18 17:48:34,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:48:34,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:48:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:34,060 INFO L225 Difference]: With dead ends: 15281 [2019-12-18 17:48:34,060 INFO L226 Difference]: Without dead ends: 15281 [2019-12-18 17:48:34,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:48:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-18 17:48:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-18 17:48:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-18 17:48:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-18 17:48:34,286 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-18 17:48:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:34,286 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-18 17:48:34,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:48:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-18 17:48:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:48:34,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:34,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:34,297 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-18 17:48:34,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:34,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24754603] [2019-12-18 17:48:34,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:34,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24754603] [2019-12-18 17:48:34,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:34,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:48:34,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047743863] [2019-12-18 17:48:34,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:48:34,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:34,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:48:34,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:48:34,390 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-18 17:48:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:34,941 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-18 17:48:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:48:34,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 17:48:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:34,972 INFO L225 Difference]: With dead ends: 21679 [2019-12-18 17:48:34,972 INFO L226 Difference]: Without dead ends: 21679 [2019-12-18 17:48:34,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:48:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-18 17:48:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-18 17:48:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-18 17:48:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-18 17:48:37,112 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-18 17:48:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:37,113 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-18 17:48:37,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:48:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-18 17:48:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:48:37,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48: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] [2019-12-18 17:48:37,131 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-18 17:48:37,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:37,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360421291] [2019-12-18 17:48:37,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:37,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 17:48:37,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360421291] [2019-12-18 17:48:37,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:37,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:48:37,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194594169] [2019-12-18 17:48:37,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:48:37,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:37,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:48:37,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:48:37,265 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 8 states. [2019-12-18 17:48:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:38,539 INFO L93 Difference]: Finished difference Result 24561 states and 72020 transitions. [2019-12-18 17:48:38,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 17:48:38,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 17:48:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:38,574 INFO L225 Difference]: With dead ends: 24561 [2019-12-18 17:48:38,574 INFO L226 Difference]: Without dead ends: 24561 [2019-12-18 17:48:38,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:48:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24561 states. [2019-12-18 17:48:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24561 to 17437. [2019-12-18 17:48:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17437 states. [2019-12-18 17:48:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 52503 transitions. [2019-12-18 17:48:38,886 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 52503 transitions. Word has length 33 [2019-12-18 17:48:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:38,886 INFO L462 AbstractCegarLoop]: Abstraction has 17437 states and 52503 transitions. [2019-12-18 17:48:38,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:48:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 52503 transitions. [2019-12-18 17:48:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:48:38,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:38,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:38,905 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:38,906 INFO L82 PathProgramCache]: Analyzing trace with hash -147828206, now seen corresponding path program 2 times [2019-12-18 17:48:38,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:38,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98425124] [2019-12-18 17:48:38,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:39,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98425124] [2019-12-18 17:48:39,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:39,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:48:39,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501113533] [2019-12-18 17:48:39,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:48:39,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:39,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:48:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:48:39,003 INFO L87 Difference]: Start difference. First operand 17437 states and 52503 transitions. Second operand 7 states. [2019-12-18 17:48:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:40,028 INFO L93 Difference]: Finished difference Result 24299 states and 71228 transitions. [2019-12-18 17:48:40,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:48:40,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 17:48:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:40,064 INFO L225 Difference]: With dead ends: 24299 [2019-12-18 17:48:40,064 INFO L226 Difference]: Without dead ends: 24299 [2019-12-18 17:48:40,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:48:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24299 states. [2019-12-18 17:48:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24299 to 16666. [2019-12-18 17:48:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-18 17:48:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-18 17:48:40,382 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-18 17:48:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:40,382 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-18 17:48:40,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:48:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-18 17:48:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:48:40,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:40,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:40,403 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-18 17:48:40,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:40,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513625742] [2019-12-18 17:48:40,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:40,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513625742] [2019-12-18 17:48:40,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:40,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:48:40,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554656324] [2019-12-18 17:48:40,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:48:40,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:48:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:48:40,470 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 5 states. [2019-12-18 17:48:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:40,641 INFO L93 Difference]: Finished difference Result 15541 states and 47563 transitions. [2019-12-18 17:48:40,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:48:40,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 17:48:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:40,662 INFO L225 Difference]: With dead ends: 15541 [2019-12-18 17:48:40,662 INFO L226 Difference]: Without dead ends: 15541 [2019-12-18 17:48:40,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:48:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15541 states. [2019-12-18 17:48:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15541 to 15044. [2019-12-18 17:48:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15044 states. [2019-12-18 17:48:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15044 states to 15044 states and 46220 transitions. [2019-12-18 17:48:40,892 INFO L78 Accepts]: Start accepts. Automaton has 15044 states and 46220 transitions. Word has length 39 [2019-12-18 17:48:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:40,892 INFO L462 AbstractCegarLoop]: Abstraction has 15044 states and 46220 transitions. [2019-12-18 17:48:40,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:48:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 15044 states and 46220 transitions. [2019-12-18 17:48:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:48:40,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:40,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:40,913 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-18 17:48:40,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:40,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968715302] [2019-12-18 17:48:40,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:40,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968715302] [2019-12-18 17:48:40,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:40,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:48:40,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84143280] [2019-12-18 17:48:40,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:48:40,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:40,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:48:40,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:40,973 INFO L87 Difference]: Start difference. First operand 15044 states and 46220 transitions. Second operand 3 states. [2019-12-18 17:48:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:41,099 INFO L93 Difference]: Finished difference Result 22609 states and 69550 transitions. [2019-12-18 17:48:41,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:48:41,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:48:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:41,151 INFO L225 Difference]: With dead ends: 22609 [2019-12-18 17:48:41,152 INFO L226 Difference]: Without dead ends: 22609 [2019-12-18 17:48:41,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22609 states. [2019-12-18 17:48:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22609 to 16710. [2019-12-18 17:48:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-18 17:48:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 52163 transitions. [2019-12-18 17:48:41,655 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 52163 transitions. Word has length 64 [2019-12-18 17:48:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:41,656 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 52163 transitions. [2019-12-18 17:48:41,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:48:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 52163 transitions. [2019-12-18 17:48:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:48:41,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:41,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:41,685 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:41,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:41,685 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-18 17:48:41,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:41,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526818887] [2019-12-18 17:48:41,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:41,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526818887] [2019-12-18 17:48:41,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:41,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:48:41,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44982449] [2019-12-18 17:48:41,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:48:41,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:41,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:48:41,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:48:41,764 INFO L87 Difference]: Start difference. First operand 16710 states and 52163 transitions. Second operand 4 states. [2019-12-18 17:48:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:41,882 INFO L93 Difference]: Finished difference Result 31544 states and 98598 transitions. [2019-12-18 17:48:41,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:48:41,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-18 17:48:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:41,905 INFO L225 Difference]: With dead ends: 31544 [2019-12-18 17:48:41,906 INFO L226 Difference]: Without dead ends: 15723 [2019-12-18 17:48:41,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:48:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15723 states. [2019-12-18 17:48:42,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15723 to 15723. [2019-12-18 17:48:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15723 states. [2019-12-18 17:48:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15723 states to 15723 states and 48991 transitions. [2019-12-18 17:48:42,143 INFO L78 Accepts]: Start accepts. Automaton has 15723 states and 48991 transitions. Word has length 64 [2019-12-18 17:48:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:42,144 INFO L462 AbstractCegarLoop]: Abstraction has 15723 states and 48991 transitions. [2019-12-18 17:48:42,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:48:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 15723 states and 48991 transitions. [2019-12-18 17:48:42,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:48:42,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:42,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:42,162 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:42,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:42,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 2 times [2019-12-18 17:48:42,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:42,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616731763] [2019-12-18 17:48:42,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:42,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616731763] [2019-12-18 17:48:42,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:42,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:48:42,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588958888] [2019-12-18 17:48:42,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:48:42,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:42,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:48:42,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:48:42,272 INFO L87 Difference]: Start difference. First operand 15723 states and 48991 transitions. Second operand 7 states. [2019-12-18 17:48:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:42,999 INFO L93 Difference]: Finished difference Result 46938 states and 144585 transitions. [2019-12-18 17:48:42,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:48:42,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:48:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:43,067 INFO L225 Difference]: With dead ends: 46938 [2019-12-18 17:48:43,067 INFO L226 Difference]: Without dead ends: 33282 [2019-12-18 17:48:43,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:48:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33282 states. [2019-12-18 17:48:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33282 to 18382. [2019-12-18 17:48:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18382 states. [2019-12-18 17:48:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18382 states to 18382 states and 57406 transitions. [2019-12-18 17:48:43,480 INFO L78 Accepts]: Start accepts. Automaton has 18382 states and 57406 transitions. Word has length 64 [2019-12-18 17:48:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:43,481 INFO L462 AbstractCegarLoop]: Abstraction has 18382 states and 57406 transitions. [2019-12-18 17:48:43,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:48:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 18382 states and 57406 transitions. [2019-12-18 17:48:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:48:43,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:43,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:43,509 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:43,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-18 17:48:43,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:43,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488163948] [2019-12-18 17:48:43,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:43,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488163948] [2019-12-18 17:48:43,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:43,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:48:43,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374397843] [2019-12-18 17:48:43,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:48:43,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:43,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:48:43,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:48:43,653 INFO L87 Difference]: Start difference. First operand 18382 states and 57406 transitions. Second operand 7 states. [2019-12-18 17:48:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:44,187 INFO L93 Difference]: Finished difference Result 51331 states and 159915 transitions. [2019-12-18 17:48:44,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 17:48:44,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:48:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:44,255 INFO L225 Difference]: With dead ends: 51331 [2019-12-18 17:48:44,255 INFO L226 Difference]: Without dead ends: 39815 [2019-12-18 17:48:44,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:48:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39815 states. [2019-12-18 17:48:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39815 to 21811. [2019-12-18 17:48:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21811 states. [2019-12-18 17:48:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21811 states to 21811 states and 68616 transitions. [2019-12-18 17:48:44,736 INFO L78 Accepts]: Start accepts. Automaton has 21811 states and 68616 transitions. Word has length 64 [2019-12-18 17:48:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:44,736 INFO L462 AbstractCegarLoop]: Abstraction has 21811 states and 68616 transitions. [2019-12-18 17:48:44,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:48:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 21811 states and 68616 transitions. [2019-12-18 17:48:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:48:44,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:44,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:44,771 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:44,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:44,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1026171661, now seen corresponding path program 4 times [2019-12-18 17:48:44,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:44,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038924520] [2019-12-18 17:48:44,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:44,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038924520] [2019-12-18 17:48:44,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:44,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:48:44,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469704269] [2019-12-18 17:48:44,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:48:44,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:44,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:48:44,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:48:44,861 INFO L87 Difference]: Start difference. First operand 21811 states and 68616 transitions. Second operand 7 states. [2019-12-18 17:48:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:45,431 INFO L93 Difference]: Finished difference Result 45057 states and 140142 transitions. [2019-12-18 17:48:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:48:45,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:48:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:45,505 INFO L225 Difference]: With dead ends: 45057 [2019-12-18 17:48:45,506 INFO L226 Difference]: Without dead ends: 40843 [2019-12-18 17:48:45,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:48:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40843 states. [2019-12-18 17:48:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40843 to 22027. [2019-12-18 17:48:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22027 states. [2019-12-18 17:48:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22027 states to 22027 states and 69303 transitions. [2019-12-18 17:48:46,013 INFO L78 Accepts]: Start accepts. Automaton has 22027 states and 69303 transitions. Word has length 64 [2019-12-18 17:48:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:46,013 INFO L462 AbstractCegarLoop]: Abstraction has 22027 states and 69303 transitions. [2019-12-18 17:48:46,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:48:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 69303 transitions. [2019-12-18 17:48:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:48:46,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:46,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:46,044 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 5 times [2019-12-18 17:48:46,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:46,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863532377] [2019-12-18 17:48:46,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:46,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863532377] [2019-12-18 17:48:46,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:46,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:48:46,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195945834] [2019-12-18 17:48:46,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:48:46,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:46,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:48:46,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:48:46,140 INFO L87 Difference]: Start difference. First operand 22027 states and 69303 transitions. Second operand 5 states. [2019-12-18 17:48:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:46,736 INFO L93 Difference]: Finished difference Result 34201 states and 104680 transitions. [2019-12-18 17:48:46,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:48:46,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 17:48:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:46,785 INFO L225 Difference]: With dead ends: 34201 [2019-12-18 17:48:46,786 INFO L226 Difference]: Without dead ends: 34033 [2019-12-18 17:48:46,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:48:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34033 states. [2019-12-18 17:48:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34033 to 28062. [2019-12-18 17:48:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28062 states. [2019-12-18 17:48:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28062 states to 28062 states and 87165 transitions. [2019-12-18 17:48:47,454 INFO L78 Accepts]: Start accepts. Automaton has 28062 states and 87165 transitions. Word has length 64 [2019-12-18 17:48:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:47,454 INFO L462 AbstractCegarLoop]: Abstraction has 28062 states and 87165 transitions. [2019-12-18 17:48:47,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:48:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 28062 states and 87165 transitions. [2019-12-18 17:48:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:48:47,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:47,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:47,484 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:47,484 INFO L82 PathProgramCache]: Analyzing trace with hash -738203667, now seen corresponding path program 6 times [2019-12-18 17:48:47,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:47,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399104613] [2019-12-18 17:48:47,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:47,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399104613] [2019-12-18 17:48:47,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:47,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:48:47,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293953871] [2019-12-18 17:48:47,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:48:47,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:47,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:48:47,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:48:47,575 INFO L87 Difference]: Start difference. First operand 28062 states and 87165 transitions. Second operand 5 states. [2019-12-18 17:48:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:47,949 INFO L93 Difference]: Finished difference Result 30014 states and 92644 transitions. [2019-12-18 17:48:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:48:47,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 17:48:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:47,992 INFO L225 Difference]: With dead ends: 30014 [2019-12-18 17:48:47,992 INFO L226 Difference]: Without dead ends: 30014 [2019-12-18 17:48:47,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:48:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30014 states. [2019-12-18 17:48:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30014 to 28475. [2019-12-18 17:48:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28475 states. [2019-12-18 17:48:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28475 states to 28475 states and 88433 transitions. [2019-12-18 17:48:48,437 INFO L78 Accepts]: Start accepts. Automaton has 28475 states and 88433 transitions. Word has length 64 [2019-12-18 17:48:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:48,438 INFO L462 AbstractCegarLoop]: Abstraction has 28475 states and 88433 transitions. [2019-12-18 17:48:48,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:48:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 28475 states and 88433 transitions. [2019-12-18 17:48:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:48:48,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:48,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:48,474 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:48,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:48,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2028716035, now seen corresponding path program 7 times [2019-12-18 17:48:48,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:48,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984862368] [2019-12-18 17:48:48,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:48,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984862368] [2019-12-18 17:48:48,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:48,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:48:48,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974059845] [2019-12-18 17:48:48,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:48:48,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:48:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:48:48,576 INFO L87 Difference]: Start difference. First operand 28475 states and 88433 transitions. Second operand 7 states. [2019-12-18 17:48:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:49,636 INFO L93 Difference]: Finished difference Result 48040 states and 146628 transitions. [2019-12-18 17:48:49,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:48:49,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:48:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:49,739 INFO L225 Difference]: With dead ends: 48040 [2019-12-18 17:48:49,740 INFO L226 Difference]: Without dead ends: 47747 [2019-12-18 17:48:49,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:48:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47747 states. [2019-12-18 17:48:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47747 to 36218. [2019-12-18 17:48:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36218 states. [2019-12-18 17:48:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36218 states to 36218 states and 112422 transitions. [2019-12-18 17:48:50,644 INFO L78 Accepts]: Start accepts. Automaton has 36218 states and 112422 transitions. Word has length 64 [2019-12-18 17:48:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:50,644 INFO L462 AbstractCegarLoop]: Abstraction has 36218 states and 112422 transitions. [2019-12-18 17:48:50,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:48:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 36218 states and 112422 transitions. [2019-12-18 17:48:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:48:50,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:50,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:50,702 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:50,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2089785517, now seen corresponding path program 8 times [2019-12-18 17:48:50,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:50,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125156599] [2019-12-18 17:48:50,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:50,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125156599] [2019-12-18 17:48:50,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:50,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:48:50,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669861901] [2019-12-18 17:48:50,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:48:50,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:50,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:48:50,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:50,811 INFO L87 Difference]: Start difference. First operand 36218 states and 112422 transitions. Second operand 3 states. [2019-12-18 17:48:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:50,970 INFO L93 Difference]: Finished difference Result 36218 states and 112421 transitions. [2019-12-18 17:48:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:48:50,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:48:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:51,025 INFO L225 Difference]: With dead ends: 36218 [2019-12-18 17:48:51,025 INFO L226 Difference]: Without dead ends: 36218 [2019-12-18 17:48:51,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36218 states. [2019-12-18 17:48:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36218 to 31693. [2019-12-18 17:48:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31693 states. [2019-12-18 17:48:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31693 states to 31693 states and 99497 transitions. [2019-12-18 17:48:51,588 INFO L78 Accepts]: Start accepts. Automaton has 31693 states and 99497 transitions. Word has length 64 [2019-12-18 17:48:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:51,588 INFO L462 AbstractCegarLoop]: Abstraction has 31693 states and 99497 transitions. [2019-12-18 17:48:51,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:48:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 31693 states and 99497 transitions. [2019-12-18 17:48:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:48:51,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:51,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:51,628 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1914914851, now seen corresponding path program 1 times [2019-12-18 17:48:51,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:51,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994647402] [2019-12-18 17:48:51,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:51,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994647402] [2019-12-18 17:48:51,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:51,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:48:51,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629075484] [2019-12-18 17:48:51,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:48:51,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:51,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:48:51,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:48:51,727 INFO L87 Difference]: Start difference. First operand 31693 states and 99497 transitions. Second operand 6 states. [2019-12-18 17:48:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:52,548 INFO L93 Difference]: Finished difference Result 33466 states and 104373 transitions. [2019-12-18 17:48:52,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:48:52,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 17:48:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:52,621 INFO L225 Difference]: With dead ends: 33466 [2019-12-18 17:48:52,621 INFO L226 Difference]: Without dead ends: 33466 [2019-12-18 17:48:52,621 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 17:48:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33466 states. [2019-12-18 17:48:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33466 to 31726. [2019-12-18 17:48:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31726 states. [2019-12-18 17:48:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31726 states to 31726 states and 99597 transitions. [2019-12-18 17:48:53,158 INFO L78 Accepts]: Start accepts. Automaton has 31726 states and 99597 transitions. Word has length 65 [2019-12-18 17:48:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:53,158 INFO L462 AbstractCegarLoop]: Abstraction has 31726 states and 99597 transitions. [2019-12-18 17:48:53,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:48:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31726 states and 99597 transitions. [2019-12-18 17:48:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:48:53,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:53,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:53,195 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:53,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:53,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1796094165, now seen corresponding path program 2 times [2019-12-18 17:48:53,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:53,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90843313] [2019-12-18 17:48:53,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:53,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90843313] [2019-12-18 17:48:53,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:53,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:48:53,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960907883] [2019-12-18 17:48:53,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:48:53,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:53,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:48:53,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:53,255 INFO L87 Difference]: Start difference. First operand 31726 states and 99597 transitions. Second operand 3 states. [2019-12-18 17:48:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:53,360 INFO L93 Difference]: Finished difference Result 23388 states and 72333 transitions. [2019-12-18 17:48:53,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:48:53,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:48:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:53,400 INFO L225 Difference]: With dead ends: 23388 [2019-12-18 17:48:53,401 INFO L226 Difference]: Without dead ends: 23388 [2019-12-18 17:48:53,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23388 states. [2019-12-18 17:48:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 22384. [2019-12-18 17:48:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22384 states. [2019-12-18 17:48:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22384 states to 22384 states and 69136 transitions. [2019-12-18 17:48:53,733 INFO L78 Accepts]: Start accepts. Automaton has 22384 states and 69136 transitions. Word has length 65 [2019-12-18 17:48:53,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:53,733 INFO L462 AbstractCegarLoop]: Abstraction has 22384 states and 69136 transitions. [2019-12-18 17:48:53,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:48:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 22384 states and 69136 transitions. [2019-12-18 17:48:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:48:53,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:53,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:53,758 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:53,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:53,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1860630415, now seen corresponding path program 1 times [2019-12-18 17:48:53,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:53,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803935169] [2019-12-18 17:48:53,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:53,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803935169] [2019-12-18 17:48:53,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:53,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:48:53,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071820109] [2019-12-18 17:48:53,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:48:53,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:53,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:48:53,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:48:53,870 INFO L87 Difference]: Start difference. First operand 22384 states and 69136 transitions. Second operand 8 states. [2019-12-18 17:48:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:56,346 INFO L93 Difference]: Finished difference Result 36775 states and 110702 transitions. [2019-12-18 17:48:56,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 17:48:56,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 17:48:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:56,399 INFO L225 Difference]: With dead ends: 36775 [2019-12-18 17:48:56,399 INFO L226 Difference]: Without dead ends: 36503 [2019-12-18 17:48:56,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 17:48:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36503 states. [2019-12-18 17:48:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36503 to 24201. [2019-12-18 17:48:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24201 states. [2019-12-18 17:48:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24201 states to 24201 states and 74702 transitions. [2019-12-18 17:48:56,869 INFO L78 Accepts]: Start accepts. Automaton has 24201 states and 74702 transitions. Word has length 66 [2019-12-18 17:48:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:56,869 INFO L462 AbstractCegarLoop]: Abstraction has 24201 states and 74702 transitions. [2019-12-18 17:48:56,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:48:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 24201 states and 74702 transitions. [2019-12-18 17:48:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:48:56,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:56,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:56,899 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1036503919, now seen corresponding path program 2 times [2019-12-18 17:48:56,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:56,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368588077] [2019-12-18 17:48:56,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:57,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368588077] [2019-12-18 17:48:57,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:57,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:48:57,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100564672] [2019-12-18 17:48:57,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:48:57,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:57,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:48:57,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:48:57,021 INFO L87 Difference]: Start difference. First operand 24201 states and 74702 transitions. Second operand 9 states. [2019-12-18 17:48:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:58,445 INFO L93 Difference]: Finished difference Result 45743 states and 140753 transitions. [2019-12-18 17:48:58,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:48:58,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 17:48:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:58,501 INFO L225 Difference]: With dead ends: 45743 [2019-12-18 17:48:58,501 INFO L226 Difference]: Without dead ends: 36796 [2019-12-18 17:48:58,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:48:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36796 states. [2019-12-18 17:48:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36796 to 24806. [2019-12-18 17:48:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24806 states. [2019-12-18 17:48:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24806 states to 24806 states and 76001 transitions. [2019-12-18 17:48:59,250 INFO L78 Accepts]: Start accepts. Automaton has 24806 states and 76001 transitions. Word has length 66 [2019-12-18 17:48:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:59,250 INFO L462 AbstractCegarLoop]: Abstraction has 24806 states and 76001 transitions. [2019-12-18 17:48:59,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:48:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 24806 states and 76001 transitions. [2019-12-18 17:48:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:48:59,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:59,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:59,277 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:59,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:59,277 INFO L82 PathProgramCache]: Analyzing trace with hash 216698061, now seen corresponding path program 3 times [2019-12-18 17:48:59,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:59,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429835873] [2019-12-18 17:48:59,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:00,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429835873] [2019-12-18 17:49:00,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:00,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 17:49:00,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948858457] [2019-12-18 17:49:00,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 17:49:00,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:00,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 17:49:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-12-18 17:49:00,153 INFO L87 Difference]: Start difference. First operand 24806 states and 76001 transitions. Second operand 24 states. [2019-12-18 17:49:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:05,955 INFO L93 Difference]: Finished difference Result 31956 states and 96511 transitions. [2019-12-18 17:49:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-18 17:49:05,955 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2019-12-18 17:49:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:05,997 INFO L225 Difference]: With dead ends: 31956 [2019-12-18 17:49:05,997 INFO L226 Difference]: Without dead ends: 27893 [2019-12-18 17:49:05,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=725, Invalid=4531, Unknown=0, NotChecked=0, Total=5256 [2019-12-18 17:49:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27893 states. [2019-12-18 17:49:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27893 to 25591. [2019-12-18 17:49:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25591 states. [2019-12-18 17:49:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25591 states to 25591 states and 77912 transitions. [2019-12-18 17:49:06,531 INFO L78 Accepts]: Start accepts. Automaton has 25591 states and 77912 transitions. Word has length 66 [2019-12-18 17:49:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:06,531 INFO L462 AbstractCegarLoop]: Abstraction has 25591 states and 77912 transitions. [2019-12-18 17:49:06,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 17:49:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 25591 states and 77912 transitions. [2019-12-18 17:49:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:49:06,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:06,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:06,560 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2056625709, now seen corresponding path program 4 times [2019-12-18 17:49:06,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:06,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881644342] [2019-12-18 17:49:06,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:06,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881644342] [2019-12-18 17:49:06,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:06,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:49:06,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599387760] [2019-12-18 17:49:06,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:49:06,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:06,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:49:06,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:49:06,739 INFO L87 Difference]: Start difference. First operand 25591 states and 77912 transitions. Second operand 12 states. [2019-12-18 17:49:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:08,924 INFO L93 Difference]: Finished difference Result 35338 states and 107779 transitions. [2019-12-18 17:49:08,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 17:49:08,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 17:49:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:08,968 INFO L225 Difference]: With dead ends: 35338 [2019-12-18 17:49:08,968 INFO L226 Difference]: Without dead ends: 30777 [2019-12-18 17:49:08,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2019-12-18 17:49:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30777 states. [2019-12-18 17:49:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30777 to 25644. [2019-12-18 17:49:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25644 states. [2019-12-18 17:49:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25644 states to 25644 states and 78188 transitions. [2019-12-18 17:49:09,383 INFO L78 Accepts]: Start accepts. Automaton has 25644 states and 78188 transitions. Word has length 66 [2019-12-18 17:49:09,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:09,383 INFO L462 AbstractCegarLoop]: Abstraction has 25644 states and 78188 transitions. [2019-12-18 17:49:09,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:49:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 25644 states and 78188 transitions. [2019-12-18 17:49:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:49:09,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:09,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:09,413 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash -821584657, now seen corresponding path program 5 times [2019-12-18 17:49:09,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:09,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293325113] [2019-12-18 17:49:09,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:09,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293325113] [2019-12-18 17:49:09,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:09,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:49:09,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825077287] [2019-12-18 17:49:09,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:49:09,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:09,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:49:09,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:49:09,503 INFO L87 Difference]: Start difference. First operand 25644 states and 78188 transitions. Second operand 4 states. [2019-12-18 17:49:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:09,678 INFO L93 Difference]: Finished difference Result 29829 states and 90624 transitions. [2019-12-18 17:49:09,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:49:09,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 17:49:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:09,734 INFO L225 Difference]: With dead ends: 29829 [2019-12-18 17:49:09,734 INFO L226 Difference]: Without dead ends: 29829 [2019-12-18 17:49:09,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:49:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29829 states. [2019-12-18 17:49:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29829 to 25678. [2019-12-18 17:49:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25678 states. [2019-12-18 17:49:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25678 states to 25678 states and 78508 transitions. [2019-12-18 17:49:10,317 INFO L78 Accepts]: Start accepts. Automaton has 25678 states and 78508 transitions. Word has length 66 [2019-12-18 17:49:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:10,318 INFO L462 AbstractCegarLoop]: Abstraction has 25678 states and 78508 transitions. [2019-12-18 17:49:10,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:49:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 25678 states and 78508 transitions. [2019-12-18 17:49:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:10,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:10,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:10,347 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-18 17:49:10,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:10,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884771348] [2019-12-18 17:49:10,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:10,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 17:49:10,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884771348] [2019-12-18 17:49:10,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:10,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 17:49:10,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269208811] [2019-12-18 17:49:10,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 17:49:10,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 17:49:10,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:49:10,872 INFO L87 Difference]: Start difference. First operand 25678 states and 78508 transitions. Second operand 16 states. [2019-12-18 17:49:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:15,786 INFO L93 Difference]: Finished difference Result 38919 states and 116374 transitions. [2019-12-18 17:49:15,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 17:49:15,786 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 17:49:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:15,838 INFO L225 Difference]: With dead ends: 38919 [2019-12-18 17:49:15,839 INFO L226 Difference]: Without dead ends: 35057 [2019-12-18 17:49:15,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=414, Invalid=1842, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 17:49:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35057 states. [2019-12-18 17:49:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35057 to 26296. [2019-12-18 17:49:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26296 states. [2019-12-18 17:49:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26296 states to 26296 states and 80007 transitions. [2019-12-18 17:49:16,569 INFO L78 Accepts]: Start accepts. Automaton has 26296 states and 80007 transitions. Word has length 67 [2019-12-18 17:49:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:16,569 INFO L462 AbstractCegarLoop]: Abstraction has 26296 states and 80007 transitions. [2019-12-18 17:49:16,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 17:49:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 26296 states and 80007 transitions. [2019-12-18 17:49:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:16,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:16,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:16,598 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:16,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:16,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1473001563, now seen corresponding path program 2 times [2019-12-18 17:49:16,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:16,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719853057] [2019-12-18 17:49:16,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:17,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 17:49:17,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719853057] [2019-12-18 17:49:17,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:17,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 17:49:17,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190237271] [2019-12-18 17:49:17,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 17:49:17,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:17,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 17:49:17,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:49:17,118 INFO L87 Difference]: Start difference. First operand 26296 states and 80007 transitions. Second operand 17 states. [2019-12-18 17:49:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:19,985 INFO L93 Difference]: Finished difference Result 30906 states and 92575 transitions. [2019-12-18 17:49:19,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 17:49:19,986 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 17:49:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:20,030 INFO L225 Difference]: With dead ends: 30906 [2019-12-18 17:49:20,030 INFO L226 Difference]: Without dead ends: 29965 [2019-12-18 17:49:20,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=352, Invalid=1628, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 17:49:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29965 states. [2019-12-18 17:49:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29965 to 26216. [2019-12-18 17:49:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26216 states. [2019-12-18 17:49:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26216 states to 26216 states and 79787 transitions. [2019-12-18 17:49:20,446 INFO L78 Accepts]: Start accepts. Automaton has 26216 states and 79787 transitions. Word has length 67 [2019-12-18 17:49:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:20,446 INFO L462 AbstractCegarLoop]: Abstraction has 26216 states and 79787 transitions. [2019-12-18 17:49:20,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 17:49:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 26216 states and 79787 transitions. [2019-12-18 17:49:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:20,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:20,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:20,478 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:20,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1816499453, now seen corresponding path program 3 times [2019-12-18 17:49:20,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:20,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179756706] [2019-12-18 17:49:20,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:20,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179756706] [2019-12-18 17:49:20,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:20,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 17:49:20,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900744525] [2019-12-18 17:49:20,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 17:49:20,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:20,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 17:49:20,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:49:20,995 INFO L87 Difference]: Start difference. First operand 26216 states and 79787 transitions. Second operand 16 states. [2019-12-18 17:49:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:24,104 INFO L93 Difference]: Finished difference Result 37042 states and 110959 transitions. [2019-12-18 17:49:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 17:49:24,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 17:49:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:24,172 INFO L225 Difference]: With dead ends: 37042 [2019-12-18 17:49:24,172 INFO L226 Difference]: Without dead ends: 35159 [2019-12-18 17:49:24,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=1257, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 17:49:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35159 states. [2019-12-18 17:49:24,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35159 to 26448. [2019-12-18 17:49:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26448 states. [2019-12-18 17:49:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26448 states to 26448 states and 80373 transitions. [2019-12-18 17:49:24,665 INFO L78 Accepts]: Start accepts. Automaton has 26448 states and 80373 transitions. Word has length 67 [2019-12-18 17:49:24,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:24,665 INFO L462 AbstractCegarLoop]: Abstraction has 26448 states and 80373 transitions. [2019-12-18 17:49:24,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 17:49:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 26448 states and 80373 transitions. [2019-12-18 17:49:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:24,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:24,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:24,703 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:24,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1363751709, now seen corresponding path program 4 times [2019-12-18 17:49:24,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:24,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318611615] [2019-12-18 17:49:24,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:25,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318611615] [2019-12-18 17:49:25,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:25,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:49:25,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670841983] [2019-12-18 17:49:25,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 17:49:25,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:25,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 17:49:25,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:49:25,102 INFO L87 Difference]: Start difference. First operand 26448 states and 80373 transitions. Second operand 15 states. [2019-12-18 17:49:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:30,424 INFO L93 Difference]: Finished difference Result 56908 states and 171535 transitions. [2019-12-18 17:49:30,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 17:49:30,425 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 17:49:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:30,501 INFO L225 Difference]: With dead ends: 56908 [2019-12-18 17:49:30,501 INFO L226 Difference]: Without dead ends: 54108 [2019-12-18 17:49:30,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=563, Invalid=3343, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 17:49:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54108 states. [2019-12-18 17:49:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54108 to 29137. [2019-12-18 17:49:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29137 states. [2019-12-18 17:49:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29137 states to 29137 states and 88193 transitions. [2019-12-18 17:49:31,110 INFO L78 Accepts]: Start accepts. Automaton has 29137 states and 88193 transitions. Word has length 67 [2019-12-18 17:49:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:31,110 INFO L462 AbstractCegarLoop]: Abstraction has 29137 states and 88193 transitions. [2019-12-18 17:49:31,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 17:49:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 29137 states and 88193 transitions. [2019-12-18 17:49:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:31,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:31,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:31,146 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:31,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:31,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1554321141, now seen corresponding path program 5 times [2019-12-18 17:49:31,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:31,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453006361] [2019-12-18 17:49:31,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:31,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453006361] [2019-12-18 17:49:31,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:31,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:49:31,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95814964] [2019-12-18 17:49:31,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 17:49:31,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:31,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 17:49:31,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:49:31,497 INFO L87 Difference]: Start difference. First operand 29137 states and 88193 transitions. Second operand 15 states. [2019-12-18 17:49:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:36,363 INFO L93 Difference]: Finished difference Result 54531 states and 163363 transitions. [2019-12-18 17:49:36,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 17:49:36,368 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 17:49:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:36,429 INFO L225 Difference]: With dead ends: 54531 [2019-12-18 17:49:36,429 INFO L226 Difference]: Without dead ends: 46713 [2019-12-18 17:49:36,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=476, Invalid=2280, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 17:49:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46713 states. [2019-12-18 17:49:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46713 to 25453. [2019-12-18 17:49:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25453 states. [2019-12-18 17:49:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25453 states to 25453 states and 77649 transitions. [2019-12-18 17:49:36,943 INFO L78 Accepts]: Start accepts. Automaton has 25453 states and 77649 transitions. Word has length 67 [2019-12-18 17:49:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:36,943 INFO L462 AbstractCegarLoop]: Abstraction has 25453 states and 77649 transitions. [2019-12-18 17:49:36,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 17:49:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 25453 states and 77649 transitions. [2019-12-18 17:49:36,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:36,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:36,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:36,971 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:36,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:36,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1885964539, now seen corresponding path program 6 times [2019-12-18 17:49:36,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:36,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232941916] [2019-12-18 17:49:36,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:37,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232941916] [2019-12-18 17:49:37,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:37,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 17:49:37,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939620389] [2019-12-18 17:49:37,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 17:49:37,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:37,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 17:49:37,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:49:37,477 INFO L87 Difference]: Start difference. First operand 25453 states and 77649 transitions. Second operand 17 states. [2019-12-18 17:49:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:40,715 INFO L93 Difference]: Finished difference Result 34032 states and 102323 transitions. [2019-12-18 17:49:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 17:49:40,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 17:49:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:40,764 INFO L225 Difference]: With dead ends: 34032 [2019-12-18 17:49:40,764 INFO L226 Difference]: Without dead ends: 33121 [2019-12-18 17:49:40,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=1388, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 17:49:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33121 states. [2019-12-18 17:49:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33121 to 25645. [2019-12-18 17:49:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25645 states. [2019-12-18 17:49:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25645 states to 25645 states and 78124 transitions. [2019-12-18 17:49:41,208 INFO L78 Accepts]: Start accepts. Automaton has 25645 states and 78124 transitions. Word has length 67 [2019-12-18 17:49:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:41,208 INFO L462 AbstractCegarLoop]: Abstraction has 25645 states and 78124 transitions. [2019-12-18 17:49:41,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 17:49:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 25645 states and 78124 transitions. [2019-12-18 17:49:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:41,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:41,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:41,239 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:41,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:41,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1956255013, now seen corresponding path program 7 times [2019-12-18 17:49:41,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:41,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024415166] [2019-12-18 17:49:41,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:41,565 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-12-18 17:49:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:41,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024415166] [2019-12-18 17:49:41,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:41,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 17:49:41,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918418389] [2019-12-18 17:49:41,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 17:49:41,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 17:49:41,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:49:41,966 INFO L87 Difference]: Start difference. First operand 25645 states and 78124 transitions. Second operand 16 states. [2019-12-18 17:49:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:46,377 INFO L93 Difference]: Finished difference Result 48334 states and 146147 transitions. [2019-12-18 17:49:46,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 17:49:46,377 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 17:49:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:46,452 INFO L225 Difference]: With dead ends: 48334 [2019-12-18 17:49:46,452 INFO L226 Difference]: Without dead ends: 47819 [2019-12-18 17:49:46,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=477, Invalid=2603, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 17:49:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47819 states. [2019-12-18 17:49:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47819 to 26708. [2019-12-18 17:49:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26708 states. [2019-12-18 17:49:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26708 states to 26708 states and 80968 transitions. [2019-12-18 17:49:47,016 INFO L78 Accepts]: Start accepts. Automaton has 26708 states and 80968 transitions. Word has length 67 [2019-12-18 17:49:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:47,016 INFO L462 AbstractCegarLoop]: Abstraction has 26708 states and 80968 transitions. [2019-12-18 17:49:47,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 17:49:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 26708 states and 80968 transitions. [2019-12-18 17:49:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:47,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:47,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:47,045 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:47,046 INFO L82 PathProgramCache]: Analyzing trace with hash 961817837, now seen corresponding path program 8 times [2019-12-18 17:49:47,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:47,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122492476] [2019-12-18 17:49:47,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:47,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122492476] [2019-12-18 17:49:47,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:47,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 17:49:47,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402693073] [2019-12-18 17:49:47,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 17:49:47,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:47,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 17:49:47,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:49:47,435 INFO L87 Difference]: Start difference. First operand 26708 states and 80968 transitions. Second operand 16 states. [2019-12-18 17:49:48,605 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-12-18 17:49:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:51,532 INFO L93 Difference]: Finished difference Result 48211 states and 145470 transitions. [2019-12-18 17:49:51,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 17:49:51,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 17:49:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:51,600 INFO L225 Difference]: With dead ends: 48211 [2019-12-18 17:49:51,600 INFO L226 Difference]: Without dead ends: 46507 [2019-12-18 17:49:51,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=494, Invalid=2368, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 17:49:51,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46507 states. [2019-12-18 17:49:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46507 to 25375. [2019-12-18 17:49:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25375 states. [2019-12-18 17:49:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25375 states to 25375 states and 77457 transitions. [2019-12-18 17:49:52,150 INFO L78 Accepts]: Start accepts. Automaton has 25375 states and 77457 transitions. Word has length 67 [2019-12-18 17:49:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:52,150 INFO L462 AbstractCegarLoop]: Abstraction has 25375 states and 77457 transitions. [2019-12-18 17:49:52,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 17:49:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 25375 states and 77457 transitions. [2019-12-18 17:49:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:52,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:52,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:52,181 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:52,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:52,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1770318001, now seen corresponding path program 9 times [2019-12-18 17:49:52,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:52,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813722774] [2019-12-18 17:49:52,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:52,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813722774] [2019-12-18 17:49:52,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:52,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 17:49:52,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458669021] [2019-12-18 17:49:52,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 17:49:52,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:52,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 17:49:52,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:49:52,565 INFO L87 Difference]: Start difference. First operand 25375 states and 77457 transitions. Second operand 16 states. [2019-12-18 17:49:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:55,228 INFO L93 Difference]: Finished difference Result 27781 states and 83281 transitions. [2019-12-18 17:49:55,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:49:55,229 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 17:49:55,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:55,269 INFO L225 Difference]: With dead ends: 27781 [2019-12-18 17:49:55,270 INFO L226 Difference]: Without dead ends: 26782 [2019-12-18 17:49:55,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2019-12-18 17:49:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26782 states. [2019-12-18 17:49:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26782 to 23444. [2019-12-18 17:49:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23444 states. [2019-12-18 17:49:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23444 states to 23444 states and 71275 transitions. [2019-12-18 17:49:55,804 INFO L78 Accepts]: Start accepts. Automaton has 23444 states and 71275 transitions. Word has length 67 [2019-12-18 17:49:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:55,804 INFO L462 AbstractCegarLoop]: Abstraction has 23444 states and 71275 transitions. [2019-12-18 17:49:55,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 17:49:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 23444 states and 71275 transitions. [2019-12-18 17:49:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:55,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:55,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:55,832 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:55,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:55,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1146206565, now seen corresponding path program 10 times [2019-12-18 17:49:55,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:55,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124499874] [2019-12-18 17:49:55,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:56,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124499874] [2019-12-18 17:49:56,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:56,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 17:49:56,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709493287] [2019-12-18 17:49:56,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 17:49:56,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:56,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 17:49:56,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:49:56,296 INFO L87 Difference]: Start difference. First operand 23444 states and 71275 transitions. Second operand 16 states. [2019-12-18 17:50:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:50:00,735 INFO L93 Difference]: Finished difference Result 47258 states and 142242 transitions. [2019-12-18 17:50:00,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 17:50:00,736 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 17:50:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:50:00,803 INFO L225 Difference]: With dead ends: 47258 [2019-12-18 17:50:00,803 INFO L226 Difference]: Without dead ends: 46149 [2019-12-18 17:50:00,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=475, Invalid=2605, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 17:50:00,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46149 states. [2019-12-18 17:50:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46149 to 25857. [2019-12-18 17:50:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25857 states. [2019-12-18 17:50:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25857 states to 25857 states and 77807 transitions. [2019-12-18 17:50:01,346 INFO L78 Accepts]: Start accepts. Automaton has 25857 states and 77807 transitions. Word has length 67 [2019-12-18 17:50:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:50:01,346 INFO L462 AbstractCegarLoop]: Abstraction has 25857 states and 77807 transitions. [2019-12-18 17:50:01,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 17:50:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 25857 states and 77807 transitions. [2019-12-18 17:50:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:50:01,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:50:01,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:50:01,375 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:50:01,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:50:01,375 INFO L82 PathProgramCache]: Analyzing trace with hash -230687881, now seen corresponding path program 11 times [2019-12-18 17:50:01,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:50:01,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944843806] [2019-12-18 17:50:01,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:50:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:50:01,645 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-18 17:50:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:50:01,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944843806] [2019-12-18 17:50:01,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:50:01,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:50:01,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198135768] [2019-12-18 17:50:01,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:50:01,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:50:01,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:50:01,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:50:01,726 INFO L87 Difference]: Start difference. First operand 25857 states and 77807 transitions. Second operand 11 states. [2019-12-18 17:50:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:50:03,038 INFO L93 Difference]: Finished difference Result 48795 states and 147961 transitions. [2019-12-18 17:50:03,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 17:50:03,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 17:50:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:50:03,094 INFO L225 Difference]: With dead ends: 48795 [2019-12-18 17:50:03,094 INFO L226 Difference]: Without dead ends: 37381 [2019-12-18 17:50:03,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-12-18 17:50:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37381 states. [2019-12-18 17:50:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37381 to 21884. [2019-12-18 17:50:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21884 states. [2019-12-18 17:50:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21884 states to 21884 states and 67096 transitions. [2019-12-18 17:50:03,549 INFO L78 Accepts]: Start accepts. Automaton has 21884 states and 67096 transitions. Word has length 67 [2019-12-18 17:50:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:50:03,549 INFO L462 AbstractCegarLoop]: Abstraction has 21884 states and 67096 transitions. [2019-12-18 17:50:03,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:50:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 21884 states and 67096 transitions. [2019-12-18 17:50:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:50:03,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:50:03,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:50:03,576 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:50:03,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:50:03,576 INFO L82 PathProgramCache]: Analyzing trace with hash 750664618, now seen corresponding path program 1 times [2019-12-18 17:50:03,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:50:03,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378887078] [2019-12-18 17:50:03,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:50:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:50:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:50:03,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378887078] [2019-12-18 17:50:03,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:50:03,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:50:03,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888842779] [2019-12-18 17:50:03,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:50:03,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:50:03,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:50:03,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:50:03,641 INFO L87 Difference]: Start difference. First operand 21884 states and 67096 transitions. Second operand 4 states. [2019-12-18 17:50:03,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:50:03,961 INFO L93 Difference]: Finished difference Result 33492 states and 103562 transitions. [2019-12-18 17:50:03,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:50:03,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-18 17:50:03,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:50:04,011 INFO L225 Difference]: With dead ends: 33492 [2019-12-18 17:50:04,011 INFO L226 Difference]: Without dead ends: 33492 [2019-12-18 17:50:04,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:50:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33492 states. [2019-12-18 17:50:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33492 to 23247. [2019-12-18 17:50:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23247 states. [2019-12-18 17:50:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23247 states to 23247 states and 71933 transitions. [2019-12-18 17:50:04,460 INFO L78 Accepts]: Start accepts. Automaton has 23247 states and 71933 transitions. Word has length 67 [2019-12-18 17:50:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:50:04,460 INFO L462 AbstractCegarLoop]: Abstraction has 23247 states and 71933 transitions. [2019-12-18 17:50:04,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:50:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 23247 states and 71933 transitions. [2019-12-18 17:50:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:50:04,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:50:04,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:50:04,486 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:50:04,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:50:04,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1791716501, now seen corresponding path program 1 times [2019-12-18 17:50:04,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:50:04,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004393282] [2019-12-18 17:50:04,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:50:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:50:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:50:04,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004393282] [2019-12-18 17:50:04,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:50:04,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:50:04,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827116983] [2019-12-18 17:50:04,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:50:04,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:50:04,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:50:04,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:50:04,662 INFO L87 Difference]: Start difference. First operand 23247 states and 71933 transitions. Second operand 10 states. [2019-12-18 17:50:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:50:07,741 INFO L93 Difference]: Finished difference Result 43675 states and 134947 transitions. [2019-12-18 17:50:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:50:07,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 17:50:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:50:07,804 INFO L225 Difference]: With dead ends: 43675 [2019-12-18 17:50:07,804 INFO L226 Difference]: Without dead ends: 43667 [2019-12-18 17:50:07,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:50:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43667 states. [2019-12-18 17:50:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43667 to 25852. [2019-12-18 17:50:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25852 states. [2019-12-18 17:50:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25852 states to 25852 states and 79400 transitions. [2019-12-18 17:50:08,337 INFO L78 Accepts]: Start accepts. Automaton has 25852 states and 79400 transitions. Word has length 67 [2019-12-18 17:50:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:50:08,337 INFO L462 AbstractCegarLoop]: Abstraction has 25852 states and 79400 transitions. [2019-12-18 17:50:08,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:50:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 25852 states and 79400 transitions. [2019-12-18 17:50:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:50:08,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:50:08,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:50:08,367 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:50:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:50:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash -3014007, now seen corresponding path program 1 times [2019-12-18 17:50:08,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:50:08,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798957132] [2019-12-18 17:50:08,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:50:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:50:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:50:08,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798957132] [2019-12-18 17:50:08,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:50:08,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:50:08,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076867407] [2019-12-18 17:50:08,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:50:08,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:50:08,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:50:08,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:50:08,410 INFO L87 Difference]: Start difference. First operand 25852 states and 79400 transitions. Second operand 3 states. [2019-12-18 17:50:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:50:08,618 INFO L93 Difference]: Finished difference Result 33968 states and 103792 transitions. [2019-12-18 17:50:08,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:50:08,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 17:50:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:50:08,668 INFO L225 Difference]: With dead ends: 33968 [2019-12-18 17:50:08,668 INFO L226 Difference]: Without dead ends: 33968 [2019-12-18 17:50:08,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:50:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33968 states. [2019-12-18 17:50:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33968 to 24552. [2019-12-18 17:50:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24552 states. [2019-12-18 17:50:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24552 states to 24552 states and 75052 transitions. [2019-12-18 17:50:09,107 INFO L78 Accepts]: Start accepts. Automaton has 24552 states and 75052 transitions. Word has length 67 [2019-12-18 17:50:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:50:09,107 INFO L462 AbstractCegarLoop]: Abstraction has 24552 states and 75052 transitions. [2019-12-18 17:50:09,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:50:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 24552 states and 75052 transitions. [2019-12-18 17:50:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:50:09,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:50:09,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:50:09,138 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:50:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:50:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1799686927, now seen corresponding path program 2 times [2019-12-18 17:50:09,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:50:09,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618157103] [2019-12-18 17:50:09,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:50:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:50:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:50:09,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618157103] [2019-12-18 17:50:09,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:50:09,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:50:09,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616829736] [2019-12-18 17:50:09,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:50:09,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:50:09,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:50:09,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:50:09,237 INFO L87 Difference]: Start difference. First operand 24552 states and 75052 transitions. Second operand 9 states. [2019-12-18 17:50:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:50:11,008 INFO L93 Difference]: Finished difference Result 55024 states and 170889 transitions. [2019-12-18 17:50:11,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 17:50:11,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 17:50:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:50:11,096 INFO L225 Difference]: With dead ends: 55024 [2019-12-18 17:50:11,096 INFO L226 Difference]: Without dead ends: 55024 [2019-12-18 17:50:11,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2019-12-18 17:50:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55024 states. [2019-12-18 17:50:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55024 to 26278. [2019-12-18 17:50:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26278 states. [2019-12-18 17:50:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26278 states to 26278 states and 80491 transitions. [2019-12-18 17:50:11,910 INFO L78 Accepts]: Start accepts. Automaton has 26278 states and 80491 transitions. Word has length 67 [2019-12-18 17:50:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:50:11,911 INFO L462 AbstractCegarLoop]: Abstraction has 26278 states and 80491 transitions. [2019-12-18 17:50:11,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:50:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 26278 states and 80491 transitions. [2019-12-18 17:50:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:50:11,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:50:11,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:50:11,940 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:50:11,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:50:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1038037876, now seen corresponding path program 1 times [2019-12-18 17:50:11,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:50:11,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559756252] [2019-12-18 17:50:11,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:50:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:50:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:50:12,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559756252] [2019-12-18 17:50:12,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:50:12,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:50:12,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477149801] [2019-12-18 17:50:12,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:50:12,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:50:12,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:50:12,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:50:12,036 INFO L87 Difference]: Start difference. First operand 26278 states and 80491 transitions. Second operand 5 states. [2019-12-18 17:50:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:50:12,186 INFO L93 Difference]: Finished difference Result 26123 states and 79758 transitions. [2019-12-18 17:50:12,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:50:12,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-18 17:50:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:50:12,222 INFO L225 Difference]: With dead ends: 26123 [2019-12-18 17:50:12,222 INFO L226 Difference]: Without dead ends: 26123 [2019-12-18 17:50:12,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:50:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26123 states. [2019-12-18 17:50:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26123 to 20976. [2019-12-18 17:50:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20976 states. [2019-12-18 17:50:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20976 states to 20976 states and 63290 transitions. [2019-12-18 17:50:12,605 INFO L78 Accepts]: Start accepts. Automaton has 20976 states and 63290 transitions. Word has length 67 [2019-12-18 17:50:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:50:12,605 INFO L462 AbstractCegarLoop]: Abstraction has 20976 states and 63290 transitions. [2019-12-18 17:50:12,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:50:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 20976 states and 63290 transitions. [2019-12-18 17:50:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:50:12,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:50:12,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:50:12,633 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:50:12,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:50:12,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 12 times [2019-12-18 17:50:12,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:50:12,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879730631] [2019-12-18 17:50:12,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:50:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:50:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:50:12,771 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:50:12,772 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:50:12,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t1385~0.base_26| 1)) (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= v_~z$r_buff0_thd2~0_111 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1385~0.base_26| 4)) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= |v_ULTIMATE.start_main_~#t1385~0.offset_19| 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1385~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1385~0.base_26|) |v_ULTIMATE.start_main_~#t1385~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p2_EAX~0_53) (= (select .cse0 |v_ULTIMATE.start_main_~#t1385~0.base_26|) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1385~0.base_26|) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~weak$$choice2~0_107 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, ULTIMATE.start_main_~#t1387~0.offset=|v_ULTIMATE.start_main_~#t1387~0.offset_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ULTIMATE.start_main_~#t1387~0.base=|v_ULTIMATE.start_main_~#t1387~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ULTIMATE.start_main_~#t1385~0.offset=|v_ULTIMATE.start_main_~#t1385~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1386~0.base=|v_ULTIMATE.start_main_~#t1386~0.base_23|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t1386~0.offset=|v_ULTIMATE.start_main_~#t1386~0.offset_19|, ULTIMATE.start_main_~#t1385~0.base=|v_ULTIMATE.start_main_~#t1385~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1387~0.offset, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1386~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1387~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1386~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1385~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1385~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 17:50:12,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1386~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1386~0.base_9|) |v_ULTIMATE.start_main_~#t1386~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1386~0.base_9| 1)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1386~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1386~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1386~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1386~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1386~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1386~0.base=|v_ULTIMATE.start_main_~#t1386~0.base_9|, ULTIMATE.start_main_~#t1386~0.offset=|v_ULTIMATE.start_main_~#t1386~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1386~0.base, ULTIMATE.start_main_~#t1386~0.offset] because there is no mapped edge [2019-12-18 17:50:12,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1~0_Out1971678331 ~z$w_buff0~0_In1971678331) (= ~z$w_buff0~0_Out1971678331 1) (= P0Thread1of1ForFork0_~arg.offset_Out1971678331 |P0Thread1of1ForFork0_#in~arg.offset_In1971678331|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1971678331| 1) (= ~z$w_buff0_used~0_In1971678331 ~z$w_buff1_used~0_Out1971678331) (= |P0Thread1of1ForFork0_#in~arg.base_In1971678331| P0Thread1of1ForFork0_~arg.base_Out1971678331) (= (mod ~z$w_buff1_used~0_Out1971678331 256) 0) (= ~z$w_buff0_used~0_Out1971678331 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1971678331| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1971678331)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1971678331|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1971678331, ~z$w_buff0~0=~z$w_buff0~0_In1971678331, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1971678331|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1971678331|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1971678331, ~z$w_buff0~0=~z$w_buff0~0_Out1971678331, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1971678331, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1971678331, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1971678331|, ~z$w_buff1~0=~z$w_buff1~0_Out1971678331, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1971678331, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1971678331|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1971678331} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:50:12,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1387~0.base_11|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1387~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1387~0.base_11|) (= |v_ULTIMATE.start_main_~#t1387~0.offset_9| 0) (not (= |v_ULTIMATE.start_main_~#t1387~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1387~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1387~0.base_11|) |v_ULTIMATE.start_main_~#t1387~0.offset_9| 2)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1387~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1387~0.offset=|v_ULTIMATE.start_main_~#t1387~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1387~0.base=|v_ULTIMATE.start_main_~#t1387~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1387~0.offset, #length, ULTIMATE.start_main_~#t1387~0.base] because there is no mapped edge [2019-12-18 17:50:12,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-490208310 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-490208310 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out-490208310| |P1Thread1of1ForFork1_#t~ite9_Out-490208310|))) (or (and (= ~z$w_buff1~0_In-490208310 |P1Thread1of1ForFork1_#t~ite9_Out-490208310|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~z~0_In-490208310 |P1Thread1of1ForFork1_#t~ite9_Out-490208310|) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-490208310, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-490208310, ~z$w_buff1~0=~z$w_buff1~0_In-490208310, ~z~0=~z~0_In-490208310} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-490208310|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-490208310, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-490208310, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-490208310|, ~z$w_buff1~0=~z$w_buff1~0_In-490208310, ~z~0=~z~0_In-490208310} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 17:50:12,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In172194063 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In172194063 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out172194063| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In172194063 |P1Thread1of1ForFork1_#t~ite11_Out172194063|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In172194063, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In172194063} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In172194063, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out172194063|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In172194063} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:50:12,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-121754145 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-121754145 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-121754145 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-121754145 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-121754145|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-121754145 |P1Thread1of1ForFork1_#t~ite12_Out-121754145|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-121754145, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-121754145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-121754145, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-121754145} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-121754145, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-121754145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-121754145, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-121754145|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-121754145} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:50:12,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1189482406 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1189482406 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1189482406| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out1189482406| ~z$r_buff0_thd2~0_In1189482406) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1189482406, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1189482406} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1189482406, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1189482406|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1189482406} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 17:50:12,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1373135636 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_In-1373135636| |P2Thread1of1ForFork2_#t~ite23_Out-1373135636|) (= ~z$w_buff1~0_In-1373135636 |P2Thread1of1ForFork2_#t~ite24_Out-1373135636|) (not .cse0)) (and .cse0 (= ~z$w_buff1~0_In-1373135636 |P2Thread1of1ForFork2_#t~ite23_Out-1373135636|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1373135636 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-1373135636 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-1373135636 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1373135636 256)))) (= |P2Thread1of1ForFork2_#t~ite24_Out-1373135636| |P2Thread1of1ForFork2_#t~ite23_Out-1373135636|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1373135636|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1373135636, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1373135636, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1373135636, ~z$w_buff1~0=~z$w_buff1~0_In-1373135636, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1373135636, ~weak$$choice2~0=~weak$$choice2~0_In-1373135636} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1373135636|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1373135636|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1373135636, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1373135636, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1373135636, ~z$w_buff1~0=~z$w_buff1~0_In-1373135636, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1373135636, ~weak$$choice2~0=~weak$$choice2~0_In-1373135636} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 17:50:12,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1484779836 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1484779836| ~z$w_buff0_used~0_In-1484779836) (= |P2Thread1of1ForFork2_#t~ite26_In-1484779836| |P2Thread1of1ForFork2_#t~ite26_Out-1484779836|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1484779836 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In-1484779836 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In-1484779836 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-1484779836 256) 0))) .cse0 (= ~z$w_buff0_used~0_In-1484779836 |P2Thread1of1ForFork2_#t~ite26_Out-1484779836|) (= |P2Thread1of1ForFork2_#t~ite27_Out-1484779836| |P2Thread1of1ForFork2_#t~ite26_Out-1484779836|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1484779836|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1484779836, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1484779836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1484779836, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1484779836, ~weak$$choice2~0=~weak$$choice2~0_In-1484779836} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1484779836|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1484779836, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1484779836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1484779836, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1484779836, ~weak$$choice2~0=~weak$$choice2~0_In-1484779836, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1484779836|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 17:50:12,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-993033696 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-993033696 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-993033696 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-993033696 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-993033696| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out-993033696| ~z$r_buff1_thd2~0_In-993033696) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-993033696, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-993033696, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-993033696, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-993033696} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-993033696, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-993033696, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-993033696, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-993033696|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-993033696} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:50:12,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:50:12,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In497663044 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In497663044 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In497663044 256)) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In497663044 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In497663044 256)))) .cse1 (= |P2Thread1of1ForFork2_#t~ite29_Out497663044| ~z$w_buff1_used~0_In497663044) (= |P2Thread1of1ForFork2_#t~ite29_Out497663044| |P2Thread1of1ForFork2_#t~ite30_Out497663044|)) (and (= |P2Thread1of1ForFork2_#t~ite29_In497663044| |P2Thread1of1ForFork2_#t~ite29_Out497663044|) (= ~z$w_buff1_used~0_In497663044 |P2Thread1of1ForFork2_#t~ite30_Out497663044|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In497663044, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In497663044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In497663044, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In497663044, ~weak$$choice2~0=~weak$$choice2~0_In497663044, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In497663044|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out497663044|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In497663044, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In497663044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In497663044, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In497663044, ~weak$$choice2~0=~weak$$choice2~0_In497663044, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out497663044|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 17:50:12,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:50:12,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:50:12,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-434983935 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-434983935 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-434983935| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-434983935| ~z$w_buff0_used~0_In-434983935)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-434983935, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-434983935} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-434983935|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-434983935, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-434983935} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:50:12,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1011802480 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1011802480 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1011802480 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1011802480 256)))) (or (and (= ~z$w_buff1_used~0_In1011802480 |P0Thread1of1ForFork0_#t~ite6_Out1011802480|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1011802480| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1011802480, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1011802480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1011802480, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1011802480} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1011802480|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1011802480, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1011802480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1011802480, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1011802480} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:50:12,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In820634443 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In820634443 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In820634443 ~z$r_buff0_thd1~0_Out820634443)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out820634443)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In820634443, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In820634443} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In820634443, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out820634443|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out820634443} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:50:12,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1988810949 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1988810949 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1988810949 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1988810949 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1988810949| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1988810949| ~z$r_buff1_thd1~0_In-1988810949) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1988810949, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1988810949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1988810949, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1988810949} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1988810949, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1988810949|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1988810949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1988810949, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1988810949} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:50:12,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:50:12,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-2046214016 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2046214016 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out-2046214016| |P2Thread1of1ForFork2_#t~ite38_Out-2046214016|))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-2046214016| ~z$w_buff1~0_In-2046214016) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-2046214016| ~z~0_In-2046214016) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2046214016, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2046214016, ~z$w_buff1~0=~z$w_buff1~0_In-2046214016, ~z~0=~z~0_In-2046214016} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2046214016, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2046214016, ~z$w_buff1~0=~z$w_buff1~0_In-2046214016, ~z~0=~z~0_In-2046214016, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-2046214016|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-2046214016|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 17:50:12,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In654635642 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In654635642 256) 0))) (or (and (= ~z$w_buff0_used~0_In654635642 |P2Thread1of1ForFork2_#t~ite40_Out654635642|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out654635642|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In654635642, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In654635642} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In654635642, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In654635642, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out654635642|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 17:50:12,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1297337103 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1297337103 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1297337103 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1297337103 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1297337103|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out-1297337103| ~z$w_buff1_used~0_In-1297337103) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1297337103, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1297337103, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1297337103, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1297337103} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1297337103|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1297337103, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1297337103, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1297337103, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1297337103} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 17:50:12,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In322391866 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In322391866 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out322391866| 0)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out322391866| ~z$r_buff0_thd3~0_In322391866) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In322391866, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In322391866} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out322391866|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In322391866, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In322391866} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 17:50:12,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In808630712 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In808630712 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In808630712 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In808630712 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out808630712|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In808630712 |P2Thread1of1ForFork2_#t~ite43_Out808630712|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In808630712, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In808630712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In808630712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In808630712} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In808630712, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In808630712, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out808630712|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In808630712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In808630712} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 17:50:12,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 17:50:12,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:50:12,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In783327899 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In783327899 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite48_Out783327899| |ULTIMATE.start_main_#t~ite47_Out783327899|))) (or (and (= ~z$w_buff1~0_In783327899 |ULTIMATE.start_main_#t~ite47_Out783327899|) .cse0 (not .cse1) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite47_Out783327899| ~z~0_In783327899) (or .cse2 .cse1) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In783327899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In783327899, ~z$w_buff1~0=~z$w_buff1~0_In783327899, ~z~0=~z~0_In783327899} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In783327899, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out783327899|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In783327899, ~z$w_buff1~0=~z$w_buff1~0_In783327899, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out783327899|, ~z~0=~z~0_In783327899} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 17:50:12,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-557616540 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-557616540 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-557616540|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-557616540 |ULTIMATE.start_main_#t~ite49_Out-557616540|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-557616540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-557616540} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-557616540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-557616540, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-557616540|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 17:50:12,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1715302118 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1715302118 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1715302118 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1715302118 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1715302118|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1715302118 |ULTIMATE.start_main_#t~ite50_Out1715302118|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1715302118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1715302118, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1715302118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1715302118} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1715302118|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1715302118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1715302118, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1715302118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1715302118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 17:50:12,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In451680473 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In451680473 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out451680473| 0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In451680473 |ULTIMATE.start_main_#t~ite51_Out451680473|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In451680473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In451680473} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In451680473, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out451680473|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In451680473} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 17:50:12,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In195997061 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In195997061 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In195997061 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In195997061 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In195997061 |ULTIMATE.start_main_#t~ite52_Out195997061|)) (and (= |ULTIMATE.start_main_#t~ite52_Out195997061| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In195997061, ~z$w_buff0_used~0=~z$w_buff0_used~0_In195997061, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In195997061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In195997061} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out195997061|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In195997061, ~z$w_buff0_used~0=~z$w_buff0_used~0_In195997061, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In195997061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In195997061} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 17:50:12,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_47 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:50:12,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:50:12 BasicIcfg [2019-12-18 17:50:12,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:50:12,909 INFO L168 Benchmark]: Toolchain (without parser) took 164628.97 ms. Allocated memory was 146.3 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 17:50:12,909 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 146.3 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 17:50:12,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.62 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 157.2 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:50:12,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.21 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:50:12,911 INFO L168 Benchmark]: Boogie Preprocessor took 40.09 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:50:12,911 INFO L168 Benchmark]: RCFGBuilder took 832.07 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.5 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:50:12,911 INFO L168 Benchmark]: TraceAbstraction took 162950.63 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 17:50:12,913 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.49 ms. Allocated memory is still 146.3 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.62 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 157.2 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.21 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.09 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.07 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.5 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 162950.63 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 162.5s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 80.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11035 SDtfs, 17893 SDslu, 48959 SDs, 0 SdLazy, 49245 SolverSat, 1136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 80 SyntacticMatches, 49 SemanticMatches, 837 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8604 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.8s AutomataMinimizationTime, 42 MinimizatonAttempts, 406288 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2397 NumberOfCodeBlocks, 2397 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2288 ConstructedInterpolants, 0 QuantifiedInterpolants, 757179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...