/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:41:18,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:41:18,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:41:18,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:41:18,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:41:18,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:41:18,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:41:18,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:41:18,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:41:18,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:41:18,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:41:18,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:41:18,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:41:18,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:41:18,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:41:18,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:41:18,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:41:18,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:41:18,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:41:18,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:41:18,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:41:18,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:41:18,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:41:18,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:41:18,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:41:18,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:41:18,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:41:18,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:41:18,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:41:18,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:41:18,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:41:18,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:41:18,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:41:18,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:41:18,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:41:18,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:41:18,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:41:18,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:41:18,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:41:18,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:41:18,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:41:18,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:41:18,949 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:41:18,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:41:18,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:41:18,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:41:18,951 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:41:18,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:41:18,951 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:41:18,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:41:18,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:41:18,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:41:18,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:41:18,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:41:18,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:41:18,953 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:41:18,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:41:18,953 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:41:18,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:41:18,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:41:18,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:41:18,954 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:41:18,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:41:18,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:41:18,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:41:18,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:41:18,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:41:18,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:41:18,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:41:18,955 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:41:18,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:41:18,956 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:41:18,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:41:19,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:41:19,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:41:19,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:41:19,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:41:19,254 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:41:19,255 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i [2019-12-27 17:41:19,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd64b08fd/f9d0873060bf4cbc9df81f18923536c2/FLAG3f1a6beb6 [2019-12-27 17:41:19,903 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:41:19,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i [2019-12-27 17:41:19,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd64b08fd/f9d0873060bf4cbc9df81f18923536c2/FLAG3f1a6beb6 [2019-12-27 17:41:20,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd64b08fd/f9d0873060bf4cbc9df81f18923536c2 [2019-12-27 17:41:20,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:41:20,128 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:41:20,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:41:20,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:41:20,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:41:20,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:20,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20, skipping insertion in model container [2019-12-27 17:41:20,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:20,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:41:20,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:41:20,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:41:20,767 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:41:20,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:41:20,943 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:41:20,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20 WrapperNode [2019-12-27 17:41:20,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:41:20,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:41:20,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:41:20,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:41:20,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:20,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:21,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:41:21,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:41:21,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:41:21,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:41:21,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:21,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:21,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:21,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:21,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:21,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:21,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (1/1) ... [2019-12-27 17:41:21,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:41:21,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:41:21,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:41:21,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:41:21,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:41:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:41:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:41:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:41:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:41:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:41:21,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:41:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:41:21,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:41:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:41:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:41:21,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:41:21,169 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:41:22,198 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:41:22,199 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:41:22,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:41:22 BoogieIcfgContainer [2019-12-27 17:41:22,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:41:22,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:41:22,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:41:22,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:41:22,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:41:20" (1/3) ... [2019-12-27 17:41:22,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b24e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:41:22, skipping insertion in model container [2019-12-27 17:41:22,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:20" (2/3) ... [2019-12-27 17:41:22,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b24e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:41:22, skipping insertion in model container [2019-12-27 17:41:22,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:41:22" (3/3) ... [2019-12-27 17:41:22,209 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.oepc.i [2019-12-27 17:41:22,220 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:41:22,220 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:41:22,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:41:22,233 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:41:22,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,327 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,327 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,366 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:22,386 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:41:22,407 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:41:22,407 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:41:22,407 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:41:22,407 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:41:22,408 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:41:22,408 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:41:22,408 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:41:22,408 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:41:22,427 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 17:41:22,429 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 17:41:22,653 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 17:41:22,653 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:41:22,701 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 17:41:22,798 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 17:41:22,938 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 17:41:22,938 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:41:22,959 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 17:41:23,005 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 17:41:23,006 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:41:31,036 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 17:41:31,182 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:41:31,294 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-27 17:41:31,295 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-27 17:41:31,298 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-27 17:41:45,205 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-27 17:41:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-27 17:41:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:41:45,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:45,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:41:45,214 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-27 17:41:45,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:45,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846328881] [2019-12-27 17:41:45,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:45,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846328881] [2019-12-27 17:41:45,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:45,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:41:45,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711701425] [2019-12-27 17:41:45,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:45,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:45,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:41:45,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:45,565 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:45,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:45,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:45,580 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-27 17:41:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:46,789 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-27 17:41:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:46,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:41:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:50,272 INFO L225 Difference]: With dead ends: 116456 [2019-12-27 17:41:50,272 INFO L226 Difference]: Without dead ends: 114036 [2019-12-27 17:41:50,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-27 17:41:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-27 17:41:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-27 17:42:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-27 17:42:00,242 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-27 17:42:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:00,242 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-27 17:42:00,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:42:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-27 17:42:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:42:00,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:00,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:00,245 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:00,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:00,246 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-27 17:42:00,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:00,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441452269] [2019-12-27 17:42:00,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:00,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441452269] [2019-12-27 17:42:00,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:00,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:42:00,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1782963756] [2019-12-27 17:42:00,350 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:00,352 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:00,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:42:00,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:00,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:42:00,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:42:00,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:42:00,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:00,394 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 5 states. [2019-12-27 17:42:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:04,811 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-27 17:42:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:04,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 17:42:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:05,379 INFO L225 Difference]: With dead ends: 152998 [2019-12-27 17:42:05,380 INFO L226 Difference]: Without dead ends: 152998 [2019-12-27 17:42:05,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-27 17:42:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-27 17:42:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-27 17:42:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-27 17:42:14,775 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-27 17:42:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:14,776 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-27 17:42:14,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-27 17:42:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:42:14,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:14,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:14,779 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-27 17:42:14,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:14,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102040892] [2019-12-27 17:42:14,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:14,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102040892] [2019-12-27 17:42:14,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:14,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:42:14,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1098538611] [2019-12-27 17:42:14,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:14,887 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:14,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:42:14,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:14,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:14,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:42:14,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:14,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:42:14,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:42:14,890 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-27 17:42:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:20,162 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-27 17:42:20,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:20,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:42:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:20,683 INFO L225 Difference]: With dead ends: 198503 [2019-12-27 17:42:20,683 INFO L226 Difference]: Without dead ends: 198503 [2019-12-27 17:42:20,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-27 17:42:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-27 17:42:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-27 17:42:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-27 17:42:30,900 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-27 17:42:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:30,900 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-27 17:42:30,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:42:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-27 17:42:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:42:30,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:30,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:30,910 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-27 17:42:30,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:30,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207636115] [2019-12-27 17:42:30,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:31,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207636115] [2019-12-27 17:42:31,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:31,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:42:31,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [650741531] [2019-12-27 17:42:31,031 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:31,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:31,039 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 17:42:31,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:31,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:42:31,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:42:31,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:31,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:42:31,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:31,125 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 8 states. [2019-12-27 17:42:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:39,097 INFO L93 Difference]: Finished difference Result 252658 states and 902047 transitions. [2019-12-27 17:42:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:42:39,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-27 17:42:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:39,678 INFO L225 Difference]: With dead ends: 252658 [2019-12-27 17:42:39,678 INFO L226 Difference]: Without dead ends: 252658 [2019-12-27 17:42:39,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:42:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252658 states. [2019-12-27 17:42:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252658 to 183475. [2019-12-27 17:42:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183475 states. [2019-12-27 17:42:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183475 states to 183475 states and 667588 transitions. [2019-12-27 17:42:55,545 INFO L78 Accepts]: Start accepts. Automaton has 183475 states and 667588 transitions. Word has length 17 [2019-12-27 17:42:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:55,546 INFO L462 AbstractCegarLoop]: Abstraction has 183475 states and 667588 transitions. [2019-12-27 17:42:55,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:42:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 183475 states and 667588 transitions. [2019-12-27 17:42:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:42:55,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:55,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:55,568 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-27 17:42:55,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:55,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58352854] [2019-12-27 17:42:55,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:55,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58352854] [2019-12-27 17:42:55,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:55,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:42:55,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358785697] [2019-12-27 17:42:55,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:55,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:55,744 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 17:42:55,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:55,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:42:55,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:55,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:55,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:55,833 INFO L87 Difference]: Start difference. First operand 183475 states and 667588 transitions. Second operand 9 states. [2019-12-27 17:43:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:02,914 INFO L93 Difference]: Finished difference Result 255390 states and 912359 transitions. [2019-12-27 17:43:02,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:43:02,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 17:43:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:03,497 INFO L225 Difference]: With dead ends: 255390 [2019-12-27 17:43:03,497 INFO L226 Difference]: Without dead ends: 255390 [2019-12-27 17:43:03,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255390 states. [2019-12-27 17:43:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255390 to 240862. [2019-12-27 17:43:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240862 states. [2019-12-27 17:43:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240862 states to 240862 states and 862677 transitions. [2019-12-27 17:43:22,432 INFO L78 Accepts]: Start accepts. Automaton has 240862 states and 862677 transitions. Word has length 25 [2019-12-27 17:43:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:22,433 INFO L462 AbstractCegarLoop]: Abstraction has 240862 states and 862677 transitions. [2019-12-27 17:43:22,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 240862 states and 862677 transitions. [2019-12-27 17:43:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:43:22,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:22,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:22,457 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:22,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:22,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1942527613, now seen corresponding path program 1 times [2019-12-27 17:43:22,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:22,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361526910] [2019-12-27 17:43:22,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:22,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361526910] [2019-12-27 17:43:22,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:22,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:43:22,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [837024227] [2019-12-27 17:43:22,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:22,529 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:22,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:43:22,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:22,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:22,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:43:22,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:22,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:43:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:43:22,535 INFO L87 Difference]: Start difference. First operand 240862 states and 862677 transitions. Second operand 4 states. [2019-12-27 17:43:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:22,604 INFO L93 Difference]: Finished difference Result 14741 states and 40177 transitions. [2019-12-27 17:43:22,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:43:22,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 17:43:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:22,616 INFO L225 Difference]: With dead ends: 14741 [2019-12-27 17:43:22,617 INFO L226 Difference]: Without dead ends: 10693 [2019-12-27 17:43:22,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:43:22,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2019-12-27 17:43:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10653. [2019-12-27 17:43:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10653 states. [2019-12-27 17:43:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10653 states to 10653 states and 26288 transitions. [2019-12-27 17:43:22,739 INFO L78 Accepts]: Start accepts. Automaton has 10653 states and 26288 transitions. Word has length 25 [2019-12-27 17:43:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:22,739 INFO L462 AbstractCegarLoop]: Abstraction has 10653 states and 26288 transitions. [2019-12-27 17:43:22,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:43:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 10653 states and 26288 transitions. [2019-12-27 17:43:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 17:43:22,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:22,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:22,743 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-27 17:43:22,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:22,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261133760] [2019-12-27 17:43:22,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:22,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261133760] [2019-12-27 17:43:22,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:22,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:43:22,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345364464] [2019-12-27 17:43:22,836 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:22,843 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:22,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 170 transitions. [2019-12-27 17:43:22,870 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:22,918 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:43:22,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:43:22,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:22,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:43:22,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:22,919 INFO L87 Difference]: Start difference. First operand 10653 states and 26288 transitions. Second operand 9 states. [2019-12-27 17:43:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:24,060 INFO L93 Difference]: Finished difference Result 11962 states and 29091 transitions. [2019-12-27 17:43:24,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:43:24,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 17:43:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:24,076 INFO L225 Difference]: With dead ends: 11962 [2019-12-27 17:43:24,076 INFO L226 Difference]: Without dead ends: 11914 [2019-12-27 17:43:24,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:43:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2019-12-27 17:43:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11586. [2019-12-27 17:43:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-27 17:43:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 28348 transitions. [2019-12-27 17:43:24,210 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 28348 transitions. Word has length 38 [2019-12-27 17:43:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:24,210 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 28348 transitions. [2019-12-27 17:43:24,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 28348 transitions. [2019-12-27 17:43:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:43:24,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:24,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:24,217 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-27 17:43:24,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:24,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824070665] [2019-12-27 17:43:24,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:25,554 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 17:43:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:25,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824070665] [2019-12-27 17:43:25,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:25,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:43:25,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842310630] [2019-12-27 17:43:25,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:25,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:25,682 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 206 transitions. [2019-12-27 17:43:25,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:25,708 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:25,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:25,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:25,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:25,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:25,710 INFO L87 Difference]: Start difference. First operand 11586 states and 28348 transitions. Second operand 6 states. [2019-12-27 17:43:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:25,766 INFO L93 Difference]: Finished difference Result 4762 states and 11299 transitions. [2019-12-27 17:43:25,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:43:25,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-12-27 17:43:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:25,777 INFO L225 Difference]: With dead ends: 4762 [2019-12-27 17:43:25,777 INFO L226 Difference]: Without dead ends: 4575 [2019-12-27 17:43:25,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-12-27 17:43:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4507. [2019-12-27 17:43:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4507 states. [2019-12-27 17:43:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 10763 transitions. [2019-12-27 17:43:25,849 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 10763 transitions. Word has length 50 [2019-12-27 17:43:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:25,850 INFO L462 AbstractCegarLoop]: Abstraction has 4507 states and 10763 transitions. [2019-12-27 17:43:25,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 10763 transitions. [2019-12-27 17:43:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:25,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:25,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:25,860 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:25,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:25,860 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-27 17:43:25,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:25,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326935619] [2019-12-27 17:43:25,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:26,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326935619] [2019-12-27 17:43:26,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:26,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:43:26,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1102789983] [2019-12-27 17:43:26,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:26,120 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:26,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-27 17:43:26,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:26,282 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:26,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:26,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:26,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:26,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:26,283 INFO L87 Difference]: Start difference. First operand 4507 states and 10763 transitions. Second operand 6 states. [2019-12-27 17:43:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:27,027 INFO L93 Difference]: Finished difference Result 6100 states and 14382 transitions. [2019-12-27 17:43:27,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:43:27,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:43:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:27,036 INFO L225 Difference]: With dead ends: 6100 [2019-12-27 17:43:27,036 INFO L226 Difference]: Without dead ends: 6100 [2019-12-27 17:43:27,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:43:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states. [2019-12-27 17:43:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 5765. [2019-12-27 17:43:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-12-27 17:43:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 13657 transitions. [2019-12-27 17:43:27,098 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 13657 transitions. Word has length 94 [2019-12-27 17:43:27,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:27,098 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 13657 transitions. [2019-12-27 17:43:27,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 13657 transitions. [2019-12-27 17:43:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:27,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:27,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:27,106 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-27 17:43:27,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:27,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537621371] [2019-12-27 17:43:27,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:27,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537621371] [2019-12-27 17:43:27,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:27,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:43:27,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761704206] [2019-12-27 17:43:27,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:27,307 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:27,487 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 202 transitions. [2019-12-27 17:43:27,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:27,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:43:27,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:43:27,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:27,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:43:27,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:27,501 INFO L87 Difference]: Start difference. First operand 5765 states and 13657 transitions. Second operand 8 states. [2019-12-27 17:43:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:29,975 INFO L93 Difference]: Finished difference Result 11959 states and 26581 transitions. [2019-12-27 17:43:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:43:29,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 17:43:29,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:29,989 INFO L225 Difference]: With dead ends: 11959 [2019-12-27 17:43:29,990 INFO L226 Difference]: Without dead ends: 11959 [2019-12-27 17:43:29,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:43:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11959 states. [2019-12-27 17:43:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11959 to 9563. [2019-12-27 17:43:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9563 states. [2019-12-27 17:43:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9563 states to 9563 states and 21687 transitions. [2019-12-27 17:43:30,102 INFO L78 Accepts]: Start accepts. Automaton has 9563 states and 21687 transitions. Word has length 94 [2019-12-27 17:43:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:30,103 INFO L462 AbstractCegarLoop]: Abstraction has 9563 states and 21687 transitions. [2019-12-27 17:43:30,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:43:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 9563 states and 21687 transitions. [2019-12-27 17:43:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:30,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:30,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:30,115 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:30,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:30,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-27 17:43:30,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:30,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127526332] [2019-12-27 17:43:30,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:30,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127526332] [2019-12-27 17:43:30,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:30,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:30,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798009833] [2019-12-27 17:43:30,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:30,269 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:30,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 185 transitions. [2019-12-27 17:43:30,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:30,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:43:30,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:43:30,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:43:30,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:43:30,428 INFO L87 Difference]: Start difference. First operand 9563 states and 21687 transitions. Second operand 5 states. [2019-12-27 17:43:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:30,969 INFO L93 Difference]: Finished difference Result 10326 states and 23243 transitions. [2019-12-27 17:43:30,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:43:30,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 17:43:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:30,982 INFO L225 Difference]: With dead ends: 10326 [2019-12-27 17:43:30,982 INFO L226 Difference]: Without dead ends: 10326 [2019-12-27 17:43:30,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10326 states. [2019-12-27 17:43:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10326 to 9685. [2019-12-27 17:43:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9685 states. [2019-12-27 17:43:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9685 states to 9685 states and 21977 transitions. [2019-12-27 17:43:31,087 INFO L78 Accepts]: Start accepts. Automaton has 9685 states and 21977 transitions. Word has length 94 [2019-12-27 17:43:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:31,088 INFO L462 AbstractCegarLoop]: Abstraction has 9685 states and 21977 transitions. [2019-12-27 17:43:31,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:43:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9685 states and 21977 transitions. [2019-12-27 17:43:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:31,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:31,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:31,101 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:31,101 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-27 17:43:31,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:31,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656956874] [2019-12-27 17:43:31,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:31,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656956874] [2019-12-27 17:43:31,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:31,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:43:31,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [976343192] [2019-12-27 17:43:31,242 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:31,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:32,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 240 transitions. [2019-12-27 17:43:32,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:32,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:32,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:32,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:32,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:32,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:32,116 INFO L87 Difference]: Start difference. First operand 9685 states and 21977 transitions. Second operand 6 states. [2019-12-27 17:43:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:32,775 INFO L93 Difference]: Finished difference Result 10615 states and 23848 transitions. [2019-12-27 17:43:32,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:43:32,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 17:43:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:32,788 INFO L225 Difference]: With dead ends: 10615 [2019-12-27 17:43:32,788 INFO L226 Difference]: Without dead ends: 10615 [2019-12-27 17:43:32,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10615 states. [2019-12-27 17:43:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10615 to 10275. [2019-12-27 17:43:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10275 states. [2019-12-27 17:43:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10275 states to 10275 states and 23193 transitions. [2019-12-27 17:43:32,895 INFO L78 Accepts]: Start accepts. Automaton has 10275 states and 23193 transitions. Word has length 94 [2019-12-27 17:43:32,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:32,895 INFO L462 AbstractCegarLoop]: Abstraction has 10275 states and 23193 transitions. [2019-12-27 17:43:32,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 10275 states and 23193 transitions. [2019-12-27 17:43:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:32,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:32,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:32,909 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-27 17:43:32,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:32,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065378420] [2019-12-27 17:43:32,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:33,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065378420] [2019-12-27 17:43:33,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:33,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:43:33,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2132531703] [2019-12-27 17:43:33,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:33,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:33,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 232 transitions. [2019-12-27 17:43:33,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:33,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:33,303 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:43:33,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:43:33,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:33,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:43:33,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:33,305 INFO L87 Difference]: Start difference. First operand 10275 states and 23193 transitions. Second operand 9 states. [2019-12-27 17:43:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:37,893 INFO L93 Difference]: Finished difference Result 38141 states and 85824 transitions. [2019-12-27 17:43:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 17:43:37,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 17:43:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:37,936 INFO L225 Difference]: With dead ends: 38141 [2019-12-27 17:43:37,936 INFO L226 Difference]: Without dead ends: 38141 [2019-12-27 17:43:37,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2019-12-27 17:43:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38141 states. [2019-12-27 17:43:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38141 to 14848. [2019-12-27 17:43:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14848 states. [2019-12-27 17:43:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14848 states to 14848 states and 34091 transitions. [2019-12-27 17:43:38,226 INFO L78 Accepts]: Start accepts. Automaton has 14848 states and 34091 transitions. Word has length 94 [2019-12-27 17:43:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:38,226 INFO L462 AbstractCegarLoop]: Abstraction has 14848 states and 34091 transitions. [2019-12-27 17:43:38,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 14848 states and 34091 transitions. [2019-12-27 17:43:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:43:38,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:38,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:38,240 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:38,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1949821147, now seen corresponding path program 6 times [2019-12-27 17:43:38,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:38,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170177498] [2019-12-27 17:43:38,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:38,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170177498] [2019-12-27 17:43:38,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:38,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:43:38,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862317324] [2019-12-27 17:43:38,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:38,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:38,548 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 210 transitions. [2019-12-27 17:43:38,548 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:38,549 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:43:38,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:43:38,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:38,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:43:38,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:43:38,550 INFO L87 Difference]: Start difference. First operand 14848 states and 34091 transitions. Second operand 3 states. [2019-12-27 17:43:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:38,618 INFO L93 Difference]: Finished difference Result 14848 states and 34090 transitions. [2019-12-27 17:43:38,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:43:38,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-27 17:43:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:38,636 INFO L225 Difference]: With dead ends: 14848 [2019-12-27 17:43:38,636 INFO L226 Difference]: Without dead ends: 14848 [2019-12-27 17:43:38,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:43:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14848 states. [2019-12-27 17:43:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14848 to 13422. [2019-12-27 17:43:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13422 states. [2019-12-27 17:43:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13422 states to 13422 states and 31107 transitions. [2019-12-27 17:43:38,911 INFO L78 Accepts]: Start accepts. Automaton has 13422 states and 31107 transitions. Word has length 94 [2019-12-27 17:43:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:38,912 INFO L462 AbstractCegarLoop]: Abstraction has 13422 states and 31107 transitions. [2019-12-27 17:43:38,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:43:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 13422 states and 31107 transitions. [2019-12-27 17:43:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:38,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:38,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:38,926 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:38,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:38,926 INFO L82 PathProgramCache]: Analyzing trace with hash -524016775, now seen corresponding path program 1 times [2019-12-27 17:43:38,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:38,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868561042] [2019-12-27 17:43:38,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:39,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868561042] [2019-12-27 17:43:39,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:39,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:43:39,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547667132] [2019-12-27 17:43:39,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:39,126 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:39,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 186 transitions. [2019-12-27 17:43:39,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:39,258 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:39,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:43:39,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:39,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:43:39,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:43:39,260 INFO L87 Difference]: Start difference. First operand 13422 states and 31107 transitions. Second operand 9 states. [2019-12-27 17:43:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:40,100 INFO L93 Difference]: Finished difference Result 22234 states and 50904 transitions. [2019-12-27 17:43:40,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:43:40,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-27 17:43:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:40,122 INFO L225 Difference]: With dead ends: 22234 [2019-12-27 17:43:40,122 INFO L226 Difference]: Without dead ends: 18657 [2019-12-27 17:43:40,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:43:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18657 states. [2019-12-27 17:43:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18657 to 15690. [2019-12-27 17:43:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15690 states. [2019-12-27 17:43:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15690 states to 15690 states and 36069 transitions. [2019-12-27 17:43:40,320 INFO L78 Accepts]: Start accepts. Automaton has 15690 states and 36069 transitions. Word has length 95 [2019-12-27 17:43:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:40,321 INFO L462 AbstractCegarLoop]: Abstraction has 15690 states and 36069 transitions. [2019-12-27 17:43:40,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:43:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 15690 states and 36069 transitions. [2019-12-27 17:43:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:40,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:40,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:40,340 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:40,340 INFO L82 PathProgramCache]: Analyzing trace with hash 283458299, now seen corresponding path program 2 times [2019-12-27 17:43:40,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:40,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883010162] [2019-12-27 17:43:40,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:40,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883010162] [2019-12-27 17:43:40,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:40,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:43:40,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1385408121] [2019-12-27 17:43:40,422 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:40,458 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:40,721 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 174 transitions. [2019-12-27 17:43:40,721 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:40,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:40,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:43:40,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:40,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:43:40,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:43:40,733 INFO L87 Difference]: Start difference. First operand 15690 states and 36069 transitions. Second operand 4 states. [2019-12-27 17:43:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:41,204 INFO L93 Difference]: Finished difference Result 18631 states and 42525 transitions. [2019-12-27 17:43:41,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:43:41,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-27 17:43:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:41,225 INFO L225 Difference]: With dead ends: 18631 [2019-12-27 17:43:41,225 INFO L226 Difference]: Without dead ends: 18631 [2019-12-27 17:43:41,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:43:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18631 states. [2019-12-27 17:43:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18631 to 16520. [2019-12-27 17:43:41,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16520 states. [2019-12-27 17:43:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16520 states to 16520 states and 37910 transitions. [2019-12-27 17:43:41,417 INFO L78 Accepts]: Start accepts. Automaton has 16520 states and 37910 transitions. Word has length 95 [2019-12-27 17:43:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:41,417 INFO L462 AbstractCegarLoop]: Abstraction has 16520 states and 37910 transitions. [2019-12-27 17:43:41,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:43:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 16520 states and 37910 transitions. [2019-12-27 17:43:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:41,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:41,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:41,438 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:41,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:41,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-27 17:43:41,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:41,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666616069] [2019-12-27 17:43:41,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:41,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666616069] [2019-12-27 17:43:41,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:41,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 17:43:41,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1024343458] [2019-12-27 17:43:41,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:41,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:42,043 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 162 transitions. [2019-12-27 17:43:42,043 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:42,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:43:42,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 17:43:42,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:42,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 17:43:42,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:43:42,291 INFO L87 Difference]: Start difference. First operand 16520 states and 37910 transitions. Second operand 22 states. [2019-12-27 17:43:42,554 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 17:43:42,835 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-12-27 17:43:43,049 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-12-27 17:44:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:12,673 INFO L93 Difference]: Finished difference Result 75923 states and 170638 transitions. [2019-12-27 17:44:12,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2019-12-27 17:44:12,673 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2019-12-27 17:44:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:12,731 INFO L225 Difference]: With dead ends: 75923 [2019-12-27 17:44:12,731 INFO L226 Difference]: Without dead ends: 53402 [2019-12-27 17:44:12,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24413 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=6055, Invalid=51785, Unknown=0, NotChecked=0, Total=57840 [2019-12-27 17:44:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53402 states. [2019-12-27 17:44:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53402 to 29569. [2019-12-27 17:44:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29569 states. [2019-12-27 17:44:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29569 states to 29569 states and 69122 transitions. [2019-12-27 17:44:13,228 INFO L78 Accepts]: Start accepts. Automaton has 29569 states and 69122 transitions. Word has length 96 [2019-12-27 17:44:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:13,229 INFO L462 AbstractCegarLoop]: Abstraction has 29569 states and 69122 transitions. [2019-12-27 17:44:13,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 17:44:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 29569 states and 69122 transitions. [2019-12-27 17:44:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:13,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:13,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:13,256 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:13,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1923547038, now seen corresponding path program 2 times [2019-12-27 17:44:13,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:13,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393532004] [2019-12-27 17:44:13,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:13,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393532004] [2019-12-27 17:44:13,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:13,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:44:13,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1978202191] [2019-12-27 17:44:13,545 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:13,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:14,220 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 215 transitions. [2019-12-27 17:44:14,222 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:14,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 17:44:14,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:44:14,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:14,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:44:14,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:44:14,314 INFO L87 Difference]: Start difference. First operand 29569 states and 69122 transitions. Second operand 17 states. [2019-12-27 17:44:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:21,206 INFO L93 Difference]: Finished difference Result 44197 states and 100392 transitions. [2019-12-27 17:44:21,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 17:44:21,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-27 17:44:21,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:21,247 INFO L225 Difference]: With dead ends: 44197 [2019-12-27 17:44:21,248 INFO L226 Difference]: Without dead ends: 42061 [2019-12-27 17:44:21,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=694, Invalid=4418, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 17:44:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42061 states. [2019-12-27 17:44:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42061 to 31152. [2019-12-27 17:44:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31152 states. [2019-12-27 17:44:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31152 states to 31152 states and 72707 transitions. [2019-12-27 17:44:21,677 INFO L78 Accepts]: Start accepts. Automaton has 31152 states and 72707 transitions. Word has length 96 [2019-12-27 17:44:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:21,678 INFO L462 AbstractCegarLoop]: Abstraction has 31152 states and 72707 transitions. [2019-12-27 17:44:21,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:44:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 31152 states and 72707 transitions. [2019-12-27 17:44:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:21,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:21,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:21,707 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1937169854, now seen corresponding path program 3 times [2019-12-27 17:44:21,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:21,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285073421] [2019-12-27 17:44:21,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:21,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285073421] [2019-12-27 17:44:21,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:21,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:44:21,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2003890306] [2019-12-27 17:44:21,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:21,837 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:22,006 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 220 transitions. [2019-12-27 17:44:22,006 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:22,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:44:22,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:44:22,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:22,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:44:22,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:44:22,014 INFO L87 Difference]: Start difference. First operand 31152 states and 72707 transitions. Second operand 6 states. [2019-12-27 17:44:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:23,252 INFO L93 Difference]: Finished difference Result 37061 states and 85668 transitions. [2019-12-27 17:44:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:44:23,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 17:44:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:23,292 INFO L225 Difference]: With dead ends: 37061 [2019-12-27 17:44:23,292 INFO L226 Difference]: Without dead ends: 37061 [2019-12-27 17:44:23,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:44:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37061 states. [2019-12-27 17:44:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37061 to 32741. [2019-12-27 17:44:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32741 states. [2019-12-27 17:44:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32741 states to 32741 states and 76358 transitions. [2019-12-27 17:44:23,728 INFO L78 Accepts]: Start accepts. Automaton has 32741 states and 76358 transitions. Word has length 96 [2019-12-27 17:44:23,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:23,728 INFO L462 AbstractCegarLoop]: Abstraction has 32741 states and 76358 transitions. [2019-12-27 17:44:23,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:44:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 32741 states and 76358 transitions. [2019-12-27 17:44:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:23,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:23,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:23,760 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 4 times [2019-12-27 17:44:23,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:23,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288205280] [2019-12-27 17:44:23,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:23,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288205280] [2019-12-27 17:44:23,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:23,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:44:23,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050032321] [2019-12-27 17:44:23,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:23,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:24,117 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 147 transitions. [2019-12-27 17:44:24,117 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:24,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:44:24,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:44:24,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:24,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:44:24,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:44:24,139 INFO L87 Difference]: Start difference. First operand 32741 states and 76358 transitions. Second operand 10 states. [2019-12-27 17:44:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:25,257 INFO L93 Difference]: Finished difference Result 53842 states and 123735 transitions. [2019-12-27 17:44:25,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:44:25,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 17:44:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:25,319 INFO L225 Difference]: With dead ends: 53842 [2019-12-27 17:44:25,319 INFO L226 Difference]: Without dead ends: 51450 [2019-12-27 17:44:25,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:44:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51450 states. [2019-12-27 17:44:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51450 to 42200. [2019-12-27 17:44:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42200 states. [2019-12-27 17:44:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42200 states to 42200 states and 98614 transitions. [2019-12-27 17:44:26,102 INFO L78 Accepts]: Start accepts. Automaton has 42200 states and 98614 transitions. Word has length 96 [2019-12-27 17:44:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:26,102 INFO L462 AbstractCegarLoop]: Abstraction has 42200 states and 98614 transitions. [2019-12-27 17:44:26,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:44:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 42200 states and 98614 transitions. [2019-12-27 17:44:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:26,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:26,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:26,139 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:26,139 INFO L82 PathProgramCache]: Analyzing trace with hash -517412620, now seen corresponding path program 5 times [2019-12-27 17:44:26,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:26,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698936019] [2019-12-27 17:44:26,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:26,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698936019] [2019-12-27 17:44:26,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:26,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:44:26,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [412059534] [2019-12-27 17:44:26,393 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:26,419 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:26,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 164 transitions. [2019-12-27 17:44:26,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:26,661 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:44:26,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 17:44:26,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 17:44:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:44:26,664 INFO L87 Difference]: Start difference. First operand 42200 states and 98614 transitions. Second operand 18 states. [2019-12-27 17:44:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:40,194 INFO L93 Difference]: Finished difference Result 62925 states and 138190 transitions. [2019-12-27 17:44:40,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-27 17:44:40,195 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-27 17:44:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:40,260 INFO L225 Difference]: With dead ends: 62925 [2019-12-27 17:44:40,260 INFO L226 Difference]: Without dead ends: 60535 [2019-12-27 17:44:40,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3954 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1811, Invalid=9531, Unknown=0, NotChecked=0, Total=11342 [2019-12-27 17:44:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60535 states. [2019-12-27 17:44:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60535 to 33025. [2019-12-27 17:44:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33025 states. [2019-12-27 17:44:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33025 states to 33025 states and 75382 transitions. [2019-12-27 17:44:40,810 INFO L78 Accepts]: Start accepts. Automaton has 33025 states and 75382 transitions. Word has length 96 [2019-12-27 17:44:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:40,811 INFO L462 AbstractCegarLoop]: Abstraction has 33025 states and 75382 transitions. [2019-12-27 17:44:40,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 17:44:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 33025 states and 75382 transitions. [2019-12-27 17:44:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:40,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:40,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:40,842 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:40,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:40,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1281102864, now seen corresponding path program 6 times [2019-12-27 17:44:40,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:40,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715422691] [2019-12-27 17:44:40,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:41,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715422691] [2019-12-27 17:44:41,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:41,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:44:41,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1238695663] [2019-12-27 17:44:41,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:41,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:41,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 217 transitions. [2019-12-27 17:44:41,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:41,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 17:44:41,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:44:41,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:41,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:44:41,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:44:41,463 INFO L87 Difference]: Start difference. First operand 33025 states and 75382 transitions. Second operand 14 states. [2019-12-27 17:44:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:45,565 INFO L93 Difference]: Finished difference Result 55132 states and 123785 transitions. [2019-12-27 17:44:45,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 17:44:45,567 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 17:44:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:45,629 INFO L225 Difference]: With dead ends: 55132 [2019-12-27 17:44:45,629 INFO L226 Difference]: Without dead ends: 54167 [2019-12-27 17:44:45,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=497, Invalid=2155, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 17:44:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54167 states. [2019-12-27 17:44:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54167 to 38044. [2019-12-27 17:44:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38044 states. [2019-12-27 17:44:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38044 states to 38044 states and 87070 transitions. [2019-12-27 17:44:46,411 INFO L78 Accepts]: Start accepts. Automaton has 38044 states and 87070 transitions. Word has length 96 [2019-12-27 17:44:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:46,412 INFO L462 AbstractCegarLoop]: Abstraction has 38044 states and 87070 transitions. [2019-12-27 17:44:46,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:44:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 38044 states and 87070 transitions. [2019-12-27 17:44:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:44:46,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:46,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:46,444 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:46,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:46,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1267480048, now seen corresponding path program 7 times [2019-12-27 17:44:46,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:46,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873741296] [2019-12-27 17:44:46,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:46,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873741296] [2019-12-27 17:44:46,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:46,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:44:46,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1402033183] [2019-12-27 17:44:46,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:46,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:46,821 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 222 transitions. [2019-12-27 17:44:46,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:46,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:44:46,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:44:46,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:46,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:44:46,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:44:46,855 INFO L87 Difference]: Start difference. First operand 38044 states and 87070 transitions. Second operand 12 states. Received shutdown request... [2019-12-27 17:44:47,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:44:47,733 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 17:44:47,739 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 17:44:47,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:44:47 BasicIcfg [2019-12-27 17:44:47,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:44:47,741 INFO L168 Benchmark]: Toolchain (without parser) took 207614.13 ms. Allocated memory was 145.2 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 99.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 17:44:47,741 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:44:47,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.29 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 99.7 MB in the beginning and 155.7 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:47,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.81 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 151.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:47,743 INFO L168 Benchmark]: Boogie Preprocessor took 53.12 ms. Allocated memory is still 204.5 MB. Free memory was 151.7 MB in the beginning and 149.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:47,743 INFO L168 Benchmark]: RCFGBuilder took 1122.38 ms. Allocated memory was 204.5 MB in the beginning and 237.0 MB in the end (delta: 32.5 MB). Free memory was 149.1 MB in the beginning and 193.8 MB in the end (delta: -44.7 MB). Peak memory consumption was 65.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:47,744 INFO L168 Benchmark]: TraceAbstraction took 205538.33 ms. Allocated memory was 237.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 192.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 17:44:47,747 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.29 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 99.7 MB in the beginning and 155.7 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.81 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 151.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.12 ms. Allocated memory is still 204.5 MB. Free memory was 151.7 MB in the beginning and 149.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1122.38 ms. Allocated memory was 204.5 MB in the beginning and 237.0 MB in the end (delta: 32.5 MB). Free memory was 149.1 MB in the beginning and 193.8 MB in the end (delta: -44.7 MB). Peak memory consumption was 65.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205538.33 ms. Allocated memory was 237.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 192.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.8s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.4s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (38044states) and FLOYD_HOARE automaton (currently 21 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (4760 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (38044states) and FLOYD_HOARE automaton (currently 21 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (4760 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 205.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 102.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11176 SDtfs, 20166 SDslu, 55633 SDs, 0 SdLazy, 47182 SolverSat, 2472 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 227 SyntacticMatches, 24 SemanticMatches, 654 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31225 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240862occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 69.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 223782 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1608 NumberOfCodeBlocks, 1608 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1585 ConstructedInterpolants, 0 QuantifiedInterpolants, 522954 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown