/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/mix025_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:26:38,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:26:38,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:26:38,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:26:38,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:26:38,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:26:38,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:26:38,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:26:38,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:26:38,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:26:38,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:26:38,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:26:38,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:26:38,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:26:38,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:26:38,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:26:38,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:26:38,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:26:38,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:26:38,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:26:38,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:26:38,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:26:38,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:26:38,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:26:38,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:26:38,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:26:38,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:26:38,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:26:38,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:26:38,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:26:38,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:26:38,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:26:38,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:26:38,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:26:38,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:26:38,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:26:38,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:26:38,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:26:38,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:26:38,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:26:38,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:26:38,880 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 16:26:38,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:26:38,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:26:38,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:26:38,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:26:38,901 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:26:38,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:26:38,901 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:26:38,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:26:38,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:26:38,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:26:38,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:26:38,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:26:38,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:26:38,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:26:38,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:26:38,903 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:26:38,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:26:38,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:26:38,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:26:38,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:26:38,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:26:38,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:26:38,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:26:38,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:26:38,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:26:38,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:26:38,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:26:38,906 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:26:38,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:26:38,906 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:26:38,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:26:39,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:26:39,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:26:39,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:26:39,217 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:26:39,218 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:26:39,218 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2019-12-27 16:26:39,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e55db2e5/d5e496126afd4315901fdfa15a6fb026/FLAGdb0db1738 [2019-12-27 16:26:39,813 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:26:39,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2019-12-27 16:26:39,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e55db2e5/d5e496126afd4315901fdfa15a6fb026/FLAGdb0db1738 [2019-12-27 16:26:40,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e55db2e5/d5e496126afd4315901fdfa15a6fb026 [2019-12-27 16:26:40,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:26:40,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:26:40,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:26:40,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:26:40,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:26:40,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:40,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40, skipping insertion in model container [2019-12-27 16:26:40,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:40,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:26:40,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:26:40,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:26:40,763 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:26:40,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:26:40,909 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:26:40,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40 WrapperNode [2019-12-27 16:26:40,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:26:40,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:26:40,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:26:40,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:26:40,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:40,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:40,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:26:40,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:26:40,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:26:40,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:26:40,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:40,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:40,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:40,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:41,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:41,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:41,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (1/1) ... [2019-12-27 16:26:41,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:26:41,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:26:41,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:26:41,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:26:41,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (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 16:26:41,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:26:41,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:26:41,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:26:41,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:26:41,110 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:26:41,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:26:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:26:41,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:26:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:26:41,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:26:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:26:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:26:41,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:26:41,114 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 16:26:41,867 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:26:41,867 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:26:41,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:26:41 BoogieIcfgContainer [2019-12-27 16:26:41,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:26:41,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:26:41,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:26:41,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:26:41,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:26:40" (1/3) ... [2019-12-27 16:26:41,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6144acc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:26:41, skipping insertion in model container [2019-12-27 16:26:41,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:40" (2/3) ... [2019-12-27 16:26:41,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6144acc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:26:41, skipping insertion in model container [2019-12-27 16:26:41,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:26:41" (3/3) ... [2019-12-27 16:26:41,878 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_rmo.opt.i [2019-12-27 16:26:41,889 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:26:41,889 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:26:41,898 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:26:41,899 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:26:41,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,969 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,969 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,978 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,978 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,988 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,988 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,988 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:41,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,013 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,013 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:26:42,037 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:26:42,059 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:26:42,059 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:26:42,060 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:26:42,060 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:26:42,060 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:26:42,060 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:26:42,060 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:26:42,060 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:26:42,078 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 16:26:42,080 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 16:26:42,177 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 16:26:42,178 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:26:42,197 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 16:26:42,225 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 16:26:42,277 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 16:26:42,277 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:26:42,288 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 16:26:42,313 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 16:26:42,314 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:26:47,464 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-27 16:26:47,873 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 16:26:48,016 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 16:26:48,042 INFO L206 etLargeBlockEncoding]: Checked pairs total: 73051 [2019-12-27 16:26:48,042 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 16:26:48,046 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-27 16:26:58,907 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83162 states. [2019-12-27 16:26:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 83162 states. [2019-12-27 16:26:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 16:26:58,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:58,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 16:26:58,916 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash 800250999, now seen corresponding path program 1 times [2019-12-27 16:26:58,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:58,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551968927] [2019-12-27 16:26:58,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:59,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 16:26:59,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551968927] [2019-12-27 16:26:59,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:59,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:26:59,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2141262351] [2019-12-27 16:26:59,211 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:59,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:59,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 16:26:59,230 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:59,234 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:59,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:59,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:59,251 INFO L87 Difference]: Start difference. First operand 83162 states. Second operand 3 states. [2019-12-27 16:27:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:00,191 INFO L93 Difference]: Finished difference Result 82042 states and 356056 transitions. [2019-12-27 16:27:00,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:27:00,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 16:27:00,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:03,094 INFO L225 Difference]: With dead ends: 82042 [2019-12-27 16:27:03,094 INFO L226 Difference]: Without dead ends: 77338 [2019-12-27 16:27:03,096 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 16:27:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77338 states. [2019-12-27 16:27:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77338 to 77338. [2019-12-27 16:27:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77338 states. [2019-12-27 16:27:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77338 states to 77338 states and 335168 transitions. [2019-12-27 16:27:08,730 INFO L78 Accepts]: Start accepts. Automaton has 77338 states and 335168 transitions. Word has length 5 [2019-12-27 16:27:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:08,730 INFO L462 AbstractCegarLoop]: Abstraction has 77338 states and 335168 transitions. [2019-12-27 16:27:08,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:27:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 77338 states and 335168 transitions. [2019-12-27 16:27:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:27:08,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:08,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:08,740 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash -463413440, now seen corresponding path program 1 times [2019-12-27 16:27:08,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:08,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922594670] [2019-12-27 16:27:08,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:08,842 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 16:27:08,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922594670] [2019-12-27 16:27:08,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:08,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:27:08,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1717835018] [2019-12-27 16:27:08,845 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:08,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:08,853 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:27:08,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:08,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:27:08,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:27:08,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:08,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:27:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:27:08,855 INFO L87 Difference]: Start difference. First operand 77338 states and 335168 transitions. Second operand 4 states. [2019-12-27 16:27:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:13,359 INFO L93 Difference]: Finished difference Result 119002 states and 493831 transitions. [2019-12-27 16:27:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:27:13,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:27:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:13,793 INFO L225 Difference]: With dead ends: 119002 [2019-12-27 16:27:13,794 INFO L226 Difference]: Without dead ends: 118911 [2019-12-27 16:27:13,795 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 16:27:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118911 states. [2019-12-27 16:27:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118911 to 109839. [2019-12-27 16:27:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109839 states. [2019-12-27 16:27:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109839 states to 109839 states and 460824 transitions. [2019-12-27 16:27:19,556 INFO L78 Accepts]: Start accepts. Automaton has 109839 states and 460824 transitions. Word has length 13 [2019-12-27 16:27:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:19,557 INFO L462 AbstractCegarLoop]: Abstraction has 109839 states and 460824 transitions. [2019-12-27 16:27:19,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:27:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 109839 states and 460824 transitions. [2019-12-27 16:27:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:27:19,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:19,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:19,561 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:19,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:19,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2092378622, now seen corresponding path program 1 times [2019-12-27 16:27:19,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:19,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004727329] [2019-12-27 16:27:19,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:19,676 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 16:27:19,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004727329] [2019-12-27 16:27:19,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:19,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:27:19,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1245958829] [2019-12-27 16:27:19,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:19,679 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:19,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:27:19,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:19,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:27:19,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:27:19,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:19,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:27:19,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:27:19,683 INFO L87 Difference]: Start difference. First operand 109839 states and 460824 transitions. Second operand 4 states. [2019-12-27 16:27:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:24,291 INFO L93 Difference]: Finished difference Result 153490 states and 628667 transitions. [2019-12-27 16:27:24,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:27:24,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:27:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:24,802 INFO L225 Difference]: With dead ends: 153490 [2019-12-27 16:27:24,802 INFO L226 Difference]: Without dead ends: 153386 [2019-12-27 16:27:24,802 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 16:27:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153386 states. [2019-12-27 16:27:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153386 to 130549. [2019-12-27 16:27:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130549 states. [2019-12-27 16:27:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130549 states to 130549 states and 543763 transitions. [2019-12-27 16:27:34,983 INFO L78 Accepts]: Start accepts. Automaton has 130549 states and 543763 transitions. Word has length 13 [2019-12-27 16:27:34,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:34,984 INFO L462 AbstractCegarLoop]: Abstraction has 130549 states and 543763 transitions. [2019-12-27 16:27:34,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:27:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 130549 states and 543763 transitions. [2019-12-27 16:27:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:27:34,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:34,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:34,989 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:34,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:34,989 INFO L82 PathProgramCache]: Analyzing trace with hash 740124844, now seen corresponding path program 1 times [2019-12-27 16:27:34,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:34,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489416029] [2019-12-27 16:27:34,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:35,088 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 16:27:35,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489416029] [2019-12-27 16:27:35,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:35,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:27:35,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [691269735] [2019-12-27 16:27:35,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:35,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:35,096 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:27:35,096 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:35,137 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:27:35,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:27:35,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:35,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:27:35,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:27:35,138 INFO L87 Difference]: Start difference. First operand 130549 states and 543763 transitions. Second operand 5 states. [2019-12-27 16:27:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:36,206 INFO L93 Difference]: Finished difference Result 162838 states and 668586 transitions. [2019-12-27 16:27:36,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:27:36,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:27:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:36,676 INFO L225 Difference]: With dead ends: 162838 [2019-12-27 16:27:36,676 INFO L226 Difference]: Without dead ends: 162750 [2019-12-27 16:27:36,676 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 16:27:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162750 states. [2019-12-27 16:27:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162750 to 140790. [2019-12-27 16:27:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140790 states. [2019-12-27 16:27:48,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140790 states to 140790 states and 584562 transitions. [2019-12-27 16:27:48,335 INFO L78 Accepts]: Start accepts. Automaton has 140790 states and 584562 transitions. Word has length 14 [2019-12-27 16:27:48,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:48,336 INFO L462 AbstractCegarLoop]: Abstraction has 140790 states and 584562 transitions. [2019-12-27 16:27:48,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:27:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 140790 states and 584562 transitions. [2019-12-27 16:27:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:27:48,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:48,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:48,340 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:48,341 INFO L82 PathProgramCache]: Analyzing trace with hash 739988072, now seen corresponding path program 1 times [2019-12-27 16:27:48,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:48,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406825459] [2019-12-27 16:27:48,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:49,454 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 16:27:49,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406825459] [2019-12-27 16:27:49,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:49,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:27:49,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2108103853] [2019-12-27 16:27:49,455 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:49,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:49,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:27:49,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:49,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:27:49,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:27:49,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:49,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:27:49,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:27:49,495 INFO L87 Difference]: Start difference. First operand 140790 states and 584562 transitions. Second operand 5 states. [2019-12-27 16:27:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:50,537 INFO L93 Difference]: Finished difference Result 195371 states and 811522 transitions. [2019-12-27 16:27:50,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:27:50,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:27:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:51,112 INFO L225 Difference]: With dead ends: 195371 [2019-12-27 16:27:51,112 INFO L226 Difference]: Without dead ends: 195371 [2019-12-27 16:27:51,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:28:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195371 states. [2019-12-27 16:28:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195371 to 171215. [2019-12-27 16:28:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171215 states. [2019-12-27 16:28:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171215 states to 171215 states and 713371 transitions. [2019-12-27 16:28:05,022 INFO L78 Accepts]: Start accepts. Automaton has 171215 states and 713371 transitions. Word has length 14 [2019-12-27 16:28:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:05,022 INFO L462 AbstractCegarLoop]: Abstraction has 171215 states and 713371 transitions. [2019-12-27 16:28:05,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:28:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 171215 states and 713371 transitions. [2019-12-27 16:28:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:28:05,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:05,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:05,026 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:05,026 INFO L82 PathProgramCache]: Analyzing trace with hash 575422588, now seen corresponding path program 1 times [2019-12-27 16:28:05,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:05,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863438975] [2019-12-27 16:28:05,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:05,087 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 16:28:05,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863438975] [2019-12-27 16:28:05,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:05,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:28:05,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643222304] [2019-12-27 16:28:05,089 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:05,090 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:05,093 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:28:05,093 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:05,107 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:28:05,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:28:05,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:28:05,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:28:05,109 INFO L87 Difference]: Start difference. First operand 171215 states and 713371 transitions. Second operand 5 states. [2019-12-27 16:28:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:07,467 INFO L93 Difference]: Finished difference Result 200032 states and 824493 transitions. [2019-12-27 16:28:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:28:07,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:28:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:08,069 INFO L225 Difference]: With dead ends: 200032 [2019-12-27 16:28:08,069 INFO L226 Difference]: Without dead ends: 199944 [2019-12-27 16:28:08,070 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 16:28:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199944 states. [2019-12-27 16:28:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199944 to 173869. [2019-12-27 16:28:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173869 states. [2019-12-27 16:28:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173869 states to 173869 states and 724501 transitions. [2019-12-27 16:28:22,881 INFO L78 Accepts]: Start accepts. Automaton has 173869 states and 724501 transitions. Word has length 14 [2019-12-27 16:28:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:22,881 INFO L462 AbstractCegarLoop]: Abstraction has 173869 states and 724501 transitions. [2019-12-27 16:28:22,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:28:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 173869 states and 724501 transitions. [2019-12-27 16:28:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 16:28:22,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:22,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:22,901 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:22,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1027045792, now seen corresponding path program 1 times [2019-12-27 16:28:22,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:22,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074721647] [2019-12-27 16:28:22,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:22,988 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 16:28:22,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074721647] [2019-12-27 16:28:22,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:22,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:28:22,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465491990] [2019-12-27 16:28:22,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:22,992 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:22,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 16:28:22,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:22,997 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:28:22,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:28:22,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:22,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:28:22,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:28:22,998 INFO L87 Difference]: Start difference. First operand 173869 states and 724501 transitions. Second operand 3 states. [2019-12-27 16:28:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:25,135 INFO L93 Difference]: Finished difference Result 173738 states and 723945 transitions. [2019-12-27 16:28:25,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:28:25,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 16:28:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:25,656 INFO L225 Difference]: With dead ends: 173738 [2019-12-27 16:28:25,656 INFO L226 Difference]: Without dead ends: 173738 [2019-12-27 16:28:25,657 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 16:28:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173738 states. [2019-12-27 16:28:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173738 to 173738. [2019-12-27 16:28:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173738 states. [2019-12-27 16:28:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173738 states to 173738 states and 723945 transitions. [2019-12-27 16:28:39,929 INFO L78 Accepts]: Start accepts. Automaton has 173738 states and 723945 transitions. Word has length 18 [2019-12-27 16:28:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:39,929 INFO L462 AbstractCegarLoop]: Abstraction has 173738 states and 723945 transitions. [2019-12-27 16:28:39,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:28:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 173738 states and 723945 transitions. [2019-12-27 16:28:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:28:39,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:39,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:39,949 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:39,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:39,950 INFO L82 PathProgramCache]: Analyzing trace with hash 930576187, now seen corresponding path program 1 times [2019-12-27 16:28:39,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:39,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895478993] [2019-12-27 16:28:39,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:39,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895478993] [2019-12-27 16:28:39,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:39,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:28:39,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1443698848] [2019-12-27 16:28:39,994 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:39,997 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:40,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 39 transitions. [2019-12-27 16:28:40,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:40,015 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:28:40,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:28:40,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:28:40,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:28:40,016 INFO L87 Difference]: Start difference. First operand 173738 states and 723945 transitions. Second operand 4 states. [2019-12-27 16:28:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:46,936 INFO L93 Difference]: Finished difference Result 286764 states and 1191382 transitions. [2019-12-27 16:28:46,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:28:46,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 16:28:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:48,230 INFO L225 Difference]: With dead ends: 286764 [2019-12-27 16:28:48,231 INFO L226 Difference]: Without dead ends: 162140 [2019-12-27 16:28:48,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:28:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162140 states. [2019-12-27 16:28:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162140 to 153170. [2019-12-27 16:28:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153170 states. [2019-12-27 16:28:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153170 states to 153170 states and 628295 transitions. [2019-12-27 16:28:59,764 INFO L78 Accepts]: Start accepts. Automaton has 153170 states and 628295 transitions. Word has length 19 [2019-12-27 16:28:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:59,765 INFO L462 AbstractCegarLoop]: Abstraction has 153170 states and 628295 transitions. [2019-12-27 16:28:59,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:28:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 153170 states and 628295 transitions. [2019-12-27 16:28:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:28:59,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:59,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:59,784 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1809324800, now seen corresponding path program 1 times [2019-12-27 16:28:59,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:59,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760153305] [2019-12-27 16:28:59,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:59,859 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 16:28:59,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760153305] [2019-12-27 16:28:59,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:59,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:28:59,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1195424686] [2019-12-27 16:28:59,860 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:59,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:59,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 16:28:59,870 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:59,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:28:59,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:28:59,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:59,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:28:59,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:28:59,873 INFO L87 Difference]: Start difference. First operand 153170 states and 628295 transitions. Second operand 3 states. [2019-12-27 16:29:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:01,916 INFO L93 Difference]: Finished difference Result 145211 states and 588530 transitions. [2019-12-27 16:29:01,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:29:01,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 16:29:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:02,336 INFO L225 Difference]: With dead ends: 145211 [2019-12-27 16:29:02,337 INFO L226 Difference]: Without dead ends: 145211 [2019-12-27 16:29:02,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 16:29:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145211 states. [2019-12-27 16:29:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145211 to 143797. [2019-12-27 16:29:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143797 states. [2019-12-27 16:29:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143797 states to 143797 states and 583330 transitions. [2019-12-27 16:29:14,497 INFO L78 Accepts]: Start accepts. Automaton has 143797 states and 583330 transitions. Word has length 19 [2019-12-27 16:29:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:14,498 INFO L462 AbstractCegarLoop]: Abstraction has 143797 states and 583330 transitions. [2019-12-27 16:29:14,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:29:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 143797 states and 583330 transitions. [2019-12-27 16:29:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:29:14,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:14,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:14,514 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:14,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1754353062, now seen corresponding path program 1 times [2019-12-27 16:29:14,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:14,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712956263] [2019-12-27 16:29:14,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:29:14,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712956263] [2019-12-27 16:29:14,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:14,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:29:14,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [256632228] [2019-12-27 16:29:14,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:14,582 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:14,586 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 47 transitions. [2019-12-27 16:29:14,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:14,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:29:14,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:29:14,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:14,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:29:14,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:29:14,588 INFO L87 Difference]: Start difference. First operand 143797 states and 583330 transitions. Second operand 5 states. [2019-12-27 16:29:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:21,310 INFO L93 Difference]: Finished difference Result 191486 states and 758167 transitions. [2019-12-27 16:29:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:29:21,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 16:29:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:21,864 INFO L225 Difference]: With dead ends: 191486 [2019-12-27 16:29:21,865 INFO L226 Difference]: Without dead ends: 191267 [2019-12-27 16:29:21,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:29:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191267 states. [2019-12-27 16:29:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191267 to 152009. [2019-12-27 16:29:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152009 states. [2019-12-27 16:29:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152009 states to 152009 states and 614599 transitions. [2019-12-27 16:29:28,694 INFO L78 Accepts]: Start accepts. Automaton has 152009 states and 614599 transitions. Word has length 19 [2019-12-27 16:29:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:28,695 INFO L462 AbstractCegarLoop]: Abstraction has 152009 states and 614599 transitions. [2019-12-27 16:29:28,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:29:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 152009 states and 614599 transitions. [2019-12-27 16:29:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:29:28,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:28,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:28,710 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:28,710 INFO L82 PathProgramCache]: Analyzing trace with hash 422869821, now seen corresponding path program 1 times [2019-12-27 16:29:28,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:28,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441306664] [2019-12-27 16:29:28,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:28,773 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 16:29:28,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441306664] [2019-12-27 16:29:28,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:28,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:29:28,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1455834361] [2019-12-27 16:29:28,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:28,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:28,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 41 transitions. [2019-12-27 16:29:28,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:28,783 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:29:28,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:29:28,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:28,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:29:28,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:29:28,784 INFO L87 Difference]: Start difference. First operand 152009 states and 614599 transitions. Second operand 4 states. [2019-12-27 16:29:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:28,953 INFO L93 Difference]: Finished difference Result 37859 states and 130356 transitions. [2019-12-27 16:29:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:29:28,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 16:29:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:29,007 INFO L225 Difference]: With dead ends: 37859 [2019-12-27 16:29:29,007 INFO L226 Difference]: Without dead ends: 29780 [2019-12-27 16:29:29,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:29:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29780 states. [2019-12-27 16:29:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29780 to 29780. [2019-12-27 16:29:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29780 states. [2019-12-27 16:29:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29780 states to 29780 states and 97851 transitions. [2019-12-27 16:29:30,529 INFO L78 Accepts]: Start accepts. Automaton has 29780 states and 97851 transitions. Word has length 19 [2019-12-27 16:29:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:30,529 INFO L462 AbstractCegarLoop]: Abstraction has 29780 states and 97851 transitions. [2019-12-27 16:29:30,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:29:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 29780 states and 97851 transitions. [2019-12-27 16:29:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:29:30,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:30,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:30,536 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:30,536 INFO L82 PathProgramCache]: Analyzing trace with hash -532738305, now seen corresponding path program 1 times [2019-12-27 16:29:30,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:30,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886081915] [2019-12-27 16:29:30,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:30,602 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 16:29:30,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886081915] [2019-12-27 16:29:30,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:30,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:29:30,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [196193747] [2019-12-27 16:29:30,603 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:30,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:30,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 16:29:30,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:30,666 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:29:30,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:29:30,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:30,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:29:30,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:29:30,668 INFO L87 Difference]: Start difference. First operand 29780 states and 97851 transitions. Second operand 7 states. [2019-12-27 16:29:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:31,244 INFO L93 Difference]: Finished difference Result 39465 states and 127242 transitions. [2019-12-27 16:29:31,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:29:31,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 16:29:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:31,309 INFO L225 Difference]: With dead ends: 39465 [2019-12-27 16:29:31,309 INFO L226 Difference]: Without dead ends: 39274 [2019-12-27 16:29:31,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:29:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39274 states. [2019-12-27 16:29:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39274 to 30971. [2019-12-27 16:29:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30971 states. [2019-12-27 16:29:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30971 states to 30971 states and 101410 transitions. [2019-12-27 16:29:34,132 INFO L78 Accepts]: Start accepts. Automaton has 30971 states and 101410 transitions. Word has length 22 [2019-12-27 16:29:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:34,132 INFO L462 AbstractCegarLoop]: Abstraction has 30971 states and 101410 transitions. [2019-12-27 16:29:34,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:29:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 30971 states and 101410 transitions. [2019-12-27 16:29:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:29:34,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:34,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] [2019-12-27 16:29:34,140 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash 828372869, now seen corresponding path program 1 times [2019-12-27 16:29:34,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:34,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262296299] [2019-12-27 16:29:34,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:34,194 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 16:29:34,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262296299] [2019-12-27 16:29:34,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:34,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:29:34,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944802327] [2019-12-27 16:29:34,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:34,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:34,211 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 102 transitions. [2019-12-27 16:29:34,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:34,212 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:29:34,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:29:34,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:34,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:29:34,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:29:34,217 INFO L87 Difference]: Start difference. First operand 30971 states and 101410 transitions. Second operand 5 states. [2019-12-27 16:29:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:34,730 INFO L93 Difference]: Finished difference Result 39564 states and 127608 transitions. [2019-12-27 16:29:34,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:29:34,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:29:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:34,832 INFO L225 Difference]: With dead ends: 39564 [2019-12-27 16:29:34,833 INFO L226 Difference]: Without dead ends: 39295 [2019-12-27 16:29:34,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:29:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39295 states. [2019-12-27 16:29:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39295 to 29549. [2019-12-27 16:29:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29549 states. [2019-12-27 16:29:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29549 states to 29549 states and 96955 transitions. [2019-12-27 16:29:35,432 INFO L78 Accepts]: Start accepts. Automaton has 29549 states and 96955 transitions. Word has length 22 [2019-12-27 16:29:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:35,432 INFO L462 AbstractCegarLoop]: Abstraction has 29549 states and 96955 transitions. [2019-12-27 16:29:35,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:29:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29549 states and 96955 transitions. [2019-12-27 16:29:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:29:35,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:35,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:35,447 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1106278827, now seen corresponding path program 1 times [2019-12-27 16:29:35,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:35,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220043930] [2019-12-27 16:29:35,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:35,505 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 16:29:35,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220043930] [2019-12-27 16:29:35,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:35,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:29:35,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2029825238] [2019-12-27 16:29:35,506 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:35,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:35,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 16:29:35,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:35,581 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:29:35,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:29:35,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:35,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:29:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:29:35,582 INFO L87 Difference]: Start difference. First operand 29549 states and 96955 transitions. Second operand 7 states. [2019-12-27 16:29:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:36,098 INFO L93 Difference]: Finished difference Result 40243 states and 130195 transitions. [2019-12-27 16:29:36,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:29:36,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 16:29:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:36,165 INFO L225 Difference]: With dead ends: 40243 [2019-12-27 16:29:36,165 INFO L226 Difference]: Without dead ends: 40219 [2019-12-27 16:29:36,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:29:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40219 states. [2019-12-27 16:29:36,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40219 to 32671. [2019-12-27 16:29:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32671 states. [2019-12-27 16:29:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32671 states to 32671 states and 106843 transitions. [2019-12-27 16:29:37,036 INFO L78 Accepts]: Start accepts. Automaton has 32671 states and 106843 transitions. Word has length 28 [2019-12-27 16:29:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:37,037 INFO L462 AbstractCegarLoop]: Abstraction has 32671 states and 106843 transitions. [2019-12-27 16:29:37,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:29:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32671 states and 106843 transitions. [2019-12-27 16:29:37,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 16:29:37,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:37,054 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] [2019-12-27 16:29:37,054 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:37,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:37,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1126449648, now seen corresponding path program 1 times [2019-12-27 16:29:37,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:37,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608609189] [2019-12-27 16:29:37,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:29:37,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608609189] [2019-12-27 16:29:37,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:37,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:29:37,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840271540] [2019-12-27 16:29:37,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:37,132 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:37,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 157 transitions. [2019-12-27 16:29:37,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:37,198 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:29:37,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:29:37,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:37,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:29:37,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:29:37,199 INFO L87 Difference]: Start difference. First operand 32671 states and 106843 transitions. Second operand 7 states. [2019-12-27 16:29:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:37,693 INFO L93 Difference]: Finished difference Result 41985 states and 135178 transitions. [2019-12-27 16:29:37,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:29:37,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-27 16:29:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:37,762 INFO L225 Difference]: With dead ends: 41985 [2019-12-27 16:29:37,763 INFO L226 Difference]: Without dead ends: 41961 [2019-12-27 16:29:37,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:29:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41961 states. [2019-12-27 16:29:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41961 to 32060. [2019-12-27 16:29:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32060 states. [2019-12-27 16:29:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32060 states to 32060 states and 104673 transitions. [2019-12-27 16:29:38,690 INFO L78 Accepts]: Start accepts. Automaton has 32060 states and 104673 transitions. Word has length 29 [2019-12-27 16:29:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:38,690 INFO L462 AbstractCegarLoop]: Abstraction has 32060 states and 104673 transitions. [2019-12-27 16:29:38,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:29:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 32060 states and 104673 transitions. [2019-12-27 16:29:38,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 16:29:38,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:38,706 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] [2019-12-27 16:29:38,706 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:38,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:38,707 INFO L82 PathProgramCache]: Analyzing trace with hash -14540022, now seen corresponding path program 1 times [2019-12-27 16:29:38,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:38,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531630934] [2019-12-27 16:29:38,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:38,786 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 16:29:38,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531630934] [2019-12-27 16:29:38,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:38,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:29:38,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1249111144] [2019-12-27 16:29:38,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:38,792 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:38,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 117 transitions. [2019-12-27 16:29:38,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:38,827 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:29:38,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:29:38,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:38,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:29:38,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:29:38,828 INFO L87 Difference]: Start difference. First operand 32060 states and 104673 transitions. Second operand 6 states. [2019-12-27 16:29:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:38,950 INFO L93 Difference]: Finished difference Result 13714 states and 42374 transitions. [2019-12-27 16:29:38,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:29:38,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-27 16:29:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:38,975 INFO L225 Difference]: With dead ends: 13714 [2019-12-27 16:29:38,975 INFO L226 Difference]: Without dead ends: 11900 [2019-12-27 16:29:38,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:29:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2019-12-27 16:29:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 11593. [2019-12-27 16:29:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11593 states. [2019-12-27 16:29:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11593 states to 11593 states and 35673 transitions. [2019-12-27 16:29:39,166 INFO L78 Accepts]: Start accepts. Automaton has 11593 states and 35673 transitions. Word has length 30 [2019-12-27 16:29:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:39,166 INFO L462 AbstractCegarLoop]: Abstraction has 11593 states and 35673 transitions. [2019-12-27 16:29:39,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:29:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 11593 states and 35673 transitions. [2019-12-27 16:29:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:29:39,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:39,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:39,180 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash -761398124, now seen corresponding path program 1 times [2019-12-27 16:29:39,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:39,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773320300] [2019-12-27 16:29:39,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:39,265 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 16:29:39,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773320300] [2019-12-27 16:29:39,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:39,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:29:39,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880222339] [2019-12-27 16:29:39,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:39,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:39,322 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 144 transitions. [2019-12-27 16:29:39,322 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:39,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:29:39,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:29:39,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:39,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:29:39,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:29:39,359 INFO L87 Difference]: Start difference. First operand 11593 states and 35673 transitions. Second operand 6 states. [2019-12-27 16:29:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:39,988 INFO L93 Difference]: Finished difference Result 14689 states and 43755 transitions. [2019-12-27 16:29:39,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:29:39,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 16:29:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:40,017 INFO L225 Difference]: With dead ends: 14689 [2019-12-27 16:29:40,017 INFO L226 Difference]: Without dead ends: 14687 [2019-12-27 16:29:40,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:29:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14687 states. [2019-12-27 16:29:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14687 to 11869. [2019-12-27 16:29:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11869 states. [2019-12-27 16:29:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 36412 transitions. [2019-12-27 16:29:40,296 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 36412 transitions. Word has length 40 [2019-12-27 16:29:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:40,297 INFO L462 AbstractCegarLoop]: Abstraction has 11869 states and 36412 transitions. [2019-12-27 16:29:40,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:29:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 36412 transitions. [2019-12-27 16:29:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:29:40,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:40,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:40,314 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1633369453, now seen corresponding path program 1 times [2019-12-27 16:29:40,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:40,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703200258] [2019-12-27 16:29:40,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29: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 16:29:40,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703200258] [2019-12-27 16:29:40,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:40,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:29:40,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1018129064] [2019-12-27 16:29:40,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:40,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:40,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 147 transitions. [2019-12-27 16:29:40,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:40,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:29:40,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:29:40,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:40,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:29:40,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:29:40,614 INFO L87 Difference]: Start difference. First operand 11869 states and 36412 transitions. Second operand 8 states. [2019-12-27 16:29:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:41,427 INFO L93 Difference]: Finished difference Result 18223 states and 55480 transitions. [2019-12-27 16:29:41,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:29:41,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 16:29:41,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:41,457 INFO L225 Difference]: With dead ends: 18223 [2019-12-27 16:29:41,457 INFO L226 Difference]: Without dead ends: 18223 [2019-12-27 16:29:41,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:29:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18223 states. [2019-12-27 16:29:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18223 to 15984. [2019-12-27 16:29:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15984 states. [2019-12-27 16:29:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15984 states to 15984 states and 49182 transitions. [2019-12-27 16:29:41,822 INFO L78 Accepts]: Start accepts. Automaton has 15984 states and 49182 transitions. Word has length 40 [2019-12-27 16:29:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:41,822 INFO L462 AbstractCegarLoop]: Abstraction has 15984 states and 49182 transitions. [2019-12-27 16:29:41,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:29:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 15984 states and 49182 transitions. [2019-12-27 16:29:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:29:41,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:41,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:41,845 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:41,845 INFO L82 PathProgramCache]: Analyzing trace with hash -308441065, now seen corresponding path program 2 times [2019-12-27 16:29:41,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:41,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736917103] [2019-12-27 16:29:41,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:41,892 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 16:29:41,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736917103] [2019-12-27 16:29:41,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:41,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:29:41,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86696957] [2019-12-27 16:29:41,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:41,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:41,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 116 transitions. [2019-12-27 16:29:41,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:41,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:29:41,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:29:41,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:41,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:29:41,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:29:41,939 INFO L87 Difference]: Start difference. First operand 15984 states and 49182 transitions. Second operand 4 states. [2019-12-27 16:29:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:42,204 INFO L93 Difference]: Finished difference Result 19706 states and 59557 transitions. [2019-12-27 16:29:42,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:29:42,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 16:29:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:42,231 INFO L225 Difference]: With dead ends: 19706 [2019-12-27 16:29:42,231 INFO L226 Difference]: Without dead ends: 19706 [2019-12-27 16:29:42,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 16:29:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19706 states. [2019-12-27 16:29:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19706 to 14516. [2019-12-27 16:29:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14516 states. [2019-12-27 16:29:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14516 states to 14516 states and 44169 transitions. [2019-12-27 16:29:42,472 INFO L78 Accepts]: Start accepts. Automaton has 14516 states and 44169 transitions. Word has length 40 [2019-12-27 16:29:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:42,472 INFO L462 AbstractCegarLoop]: Abstraction has 14516 states and 44169 transitions. [2019-12-27 16:29:42,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:29:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 14516 states and 44169 transitions. [2019-12-27 16:29:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:29:42,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:42,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:42,492 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:42,493 INFO L82 PathProgramCache]: Analyzing trace with hash 797278347, now seen corresponding path program 1 times [2019-12-27 16:29:42,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:42,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698058647] [2019-12-27 16:29:42,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:29:42,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698058647] [2019-12-27 16:29:42,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:42,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:29:42,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210193878] [2019-12-27 16:29:42,562 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:42,572 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:42,637 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 235 transitions. [2019-12-27 16:29:42,637 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:42,703 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:29:42,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:29:42,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:42,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:29:42,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:29:42,704 INFO L87 Difference]: Start difference. First operand 14516 states and 44169 transitions. Second operand 9 states. [2019-12-27 16:29:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:43,492 INFO L93 Difference]: Finished difference Result 18158 states and 53479 transitions. [2019-12-27 16:29:43,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:29:43,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 16:29:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:43,516 INFO L225 Difference]: With dead ends: 18158 [2019-12-27 16:29:43,516 INFO L226 Difference]: Without dead ends: 18156 [2019-12-27 16:29:43,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:29:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18156 states. [2019-12-27 16:29:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18156 to 13885. [2019-12-27 16:29:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13885 states. [2019-12-27 16:29:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13885 states to 13885 states and 42429 transitions. [2019-12-27 16:29:43,743 INFO L78 Accepts]: Start accepts. Automaton has 13885 states and 42429 transitions. Word has length 41 [2019-12-27 16:29:43,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:43,743 INFO L462 AbstractCegarLoop]: Abstraction has 13885 states and 42429 transitions. [2019-12-27 16:29:43,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:29:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 13885 states and 42429 transitions. [2019-12-27 16:29:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:29:43,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:43,757 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] [2019-12-27 16:29:43,757 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:43,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:43,758 INFO L82 PathProgramCache]: Analyzing trace with hash 771947399, now seen corresponding path program 1 times [2019-12-27 16:29:43,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:43,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595302331] [2019-12-27 16:29:43,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:29:43,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595302331] [2019-12-27 16:29:43,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:43,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:29:43,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1919873485] [2019-12-27 16:29:43,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:43,846 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:43,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 146 transitions. [2019-12-27 16:29:43,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:44,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:29:44,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:29:44,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:44,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:29:44,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:29:44,006 INFO L87 Difference]: Start difference. First operand 13885 states and 42429 transitions. Second operand 7 states. [2019-12-27 16:29:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:44,118 INFO L93 Difference]: Finished difference Result 12733 states and 39642 transitions. [2019-12-27 16:29:44,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:29:44,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 16:29:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:44,135 INFO L225 Difference]: With dead ends: 12733 [2019-12-27 16:29:44,135 INFO L226 Difference]: Without dead ends: 11550 [2019-12-27 16:29:44,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:29:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11550 states. [2019-12-27 16:29:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11550 to 11130. [2019-12-27 16:29:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11130 states. [2019-12-27 16:29:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11130 states to 11130 states and 35538 transitions. [2019-12-27 16:29:44,302 INFO L78 Accepts]: Start accepts. Automaton has 11130 states and 35538 transitions. Word has length 41 [2019-12-27 16:29:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:44,302 INFO L462 AbstractCegarLoop]: Abstraction has 11130 states and 35538 transitions. [2019-12-27 16:29:44,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:29:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 11130 states and 35538 transitions. [2019-12-27 16:29:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:29:44,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:44,315 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] [2019-12-27 16:29:44,315 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:44,315 INFO L82 PathProgramCache]: Analyzing trace with hash 852736153, now seen corresponding path program 1 times [2019-12-27 16:29:44,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:44,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013852892] [2019-12-27 16:29:44,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:44,363 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 16:29:44,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013852892] [2019-12-27 16:29:44,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:44,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:29:44,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1125112030] [2019-12-27 16:29:44,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:44,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:44,616 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 317 states and 690 transitions. [2019-12-27 16:29:44,616 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:44,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:29:44,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:29:44,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:44,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:29:44,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:29:44,638 INFO L87 Difference]: Start difference. First operand 11130 states and 35538 transitions. Second operand 4 states. [2019-12-27 16:29:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:44,723 INFO L93 Difference]: Finished difference Result 12575 states and 38277 transitions. [2019-12-27 16:29:44,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:29:44,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-27 16:29:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:44,741 INFO L225 Difference]: With dead ends: 12575 [2019-12-27 16:29:44,741 INFO L226 Difference]: Without dead ends: 12575 [2019-12-27 16:29:44,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:29:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-12-27 16:29:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 9907. [2019-12-27 16:29:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9907 states. [2019-12-27 16:29:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9907 states to 9907 states and 30647 transitions. [2019-12-27 16:29:44,911 INFO L78 Accepts]: Start accepts. Automaton has 9907 states and 30647 transitions. Word has length 56 [2019-12-27 16:29:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:44,911 INFO L462 AbstractCegarLoop]: Abstraction has 9907 states and 30647 transitions. [2019-12-27 16:29:44,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:29:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 9907 states and 30647 transitions. [2019-12-27 16:29:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:29:44,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:44,923 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] [2019-12-27 16:29:44,924 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash -415784116, now seen corresponding path program 1 times [2019-12-27 16:29:44,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:44,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279459720] [2019-12-27 16:29:44,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:44,985 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 16:29:44,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279459720] [2019-12-27 16:29:44,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:44,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:29:44,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2036576769] [2019-12-27 16:29:44,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:45,026 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:45,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 317 states and 690 transitions. [2019-12-27 16:29:45,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:45,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:29:45,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:29:45,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:29:45,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:29:45,499 INFO L87 Difference]: Start difference. First operand 9907 states and 30647 transitions. Second operand 7 states. [2019-12-27 16:29:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:45,788 INFO L93 Difference]: Finished difference Result 19702 states and 60627 transitions. [2019-12-27 16:29:45,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:29:45,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 16:29:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:45,802 INFO L225 Difference]: With dead ends: 19702 [2019-12-27 16:29:45,803 INFO L226 Difference]: Without dead ends: 9431 [2019-12-27 16:29:45,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:29:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9431 states. [2019-12-27 16:29:45,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9431 to 6904. [2019-12-27 16:29:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6904 states. [2019-12-27 16:29:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 21383 transitions. [2019-12-27 16:29:45,923 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 21383 transitions. Word has length 56 [2019-12-27 16:29:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:45,923 INFO L462 AbstractCegarLoop]: Abstraction has 6904 states and 21383 transitions. [2019-12-27 16:29:45,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:29:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 21383 transitions. [2019-12-27 16:29:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:29:45,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:45,931 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] [2019-12-27 16:29:45,931 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1395977884, now seen corresponding path program 2 times [2019-12-27 16:29:45,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:45,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914131131] [2019-12-27 16:29:45,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:46,128 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 16:29:46,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914131131] [2019-12-27 16:29:46,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:46,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:29:46,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [595326039] [2019-12-27 16:29:46,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:46,145 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:46,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 354 transitions. [2019-12-27 16:29:46,324 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:46,668 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:29:46,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 16:29:46,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:46,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 16:29:46,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:29:46,669 INFO L87 Difference]: Start difference. First operand 6904 states and 21383 transitions. Second operand 17 states. [2019-12-27 16:29:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:48,702 INFO L93 Difference]: Finished difference Result 14016 states and 42239 transitions. [2019-12-27 16:29:48,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 16:29:48,703 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 16:29:48,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:48,724 INFO L225 Difference]: With dead ends: 14016 [2019-12-27 16:29:48,724 INFO L226 Difference]: Without dead ends: 13092 [2019-12-27 16:29:48,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=581, Invalid=3201, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 16:29:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13092 states. [2019-12-27 16:29:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13092 to 11843. [2019-12-27 16:29:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11843 states. [2019-12-27 16:29:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11843 states to 11843 states and 36137 transitions. [2019-12-27 16:29:48,923 INFO L78 Accepts]: Start accepts. Automaton has 11843 states and 36137 transitions. Word has length 56 [2019-12-27 16:29:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:48,923 INFO L462 AbstractCegarLoop]: Abstraction has 11843 states and 36137 transitions. [2019-12-27 16:29:48,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 16:29:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 11843 states and 36137 transitions. [2019-12-27 16:29:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:29:48,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:48,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:48,936 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash 637748608, now seen corresponding path program 3 times [2019-12-27 16:29:48,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:48,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413805322] [2019-12-27 16:29:48,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:49,139 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-12-27 16:29:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:29:49,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413805322] [2019-12-27 16:29:49,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:49,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:29:49,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1092954669] [2019-12-27 16:29:49,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:49,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:49,387 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 363 transitions. [2019-12-27 16:29:49,388 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:49,642 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 16:29:49,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:29:49,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:49,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:29:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:29:49,643 INFO L87 Difference]: Start difference. First operand 11843 states and 36137 transitions. Second operand 16 states. [2019-12-27 16:29:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:50,906 INFO L93 Difference]: Finished difference Result 13143 states and 39440 transitions. [2019-12-27 16:29:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 16:29:50,907 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 16:29:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:50,925 INFO L225 Difference]: With dead ends: 13143 [2019-12-27 16:29:50,925 INFO L226 Difference]: Without dead ends: 8719 [2019-12-27 16:29:50,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 10 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:29:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-12-27 16:29:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 7971. [2019-12-27 16:29:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7971 states. [2019-12-27 16:29:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7971 states to 7971 states and 24000 transitions. [2019-12-27 16:29:51,085 INFO L78 Accepts]: Start accepts. Automaton has 7971 states and 24000 transitions. Word has length 56 [2019-12-27 16:29:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:51,085 INFO L462 AbstractCegarLoop]: Abstraction has 7971 states and 24000 transitions. [2019-12-27 16:29:51,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:29:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7971 states and 24000 transitions. [2019-12-27 16:29:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:29:51,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:51,097 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] [2019-12-27 16:29:51,097 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:29:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1474997086, now seen corresponding path program 4 times [2019-12-27 16:29:51,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:51,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107749529] [2019-12-27 16:29:51,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat Received shutdown request... [2019-12-27 16:29:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-12-27 16:29:51,156 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: program execution has not yet been computed at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:451) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:347) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:464) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-27 16:29:51,161 INFO L168 Benchmark]: Toolchain (without parser) took 190997.13 ms. Allocated memory was 136.3 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 98.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:29:51,162 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 16:29:51,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.43 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 98.0 MB in the beginning and 153.9 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:29:51,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.30 ms. Allocated memory is still 200.3 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:29:51,163 INFO L168 Benchmark]: Boogie Preprocessor took 45.96 ms. Allocated memory is still 200.3 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:29:51,167 INFO L168 Benchmark]: RCFGBuilder took 847.66 ms. Allocated memory is still 200.3 MB. Free memory was 149.0 MB in the beginning and 102.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:29:51,168 INFO L168 Benchmark]: TraceAbstraction took 189289.23 ms. Allocated memory was 200.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 16:29:51,171 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 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.43 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 98.0 MB in the beginning and 153.9 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.30 ms. Allocated memory is still 200.3 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.96 ms. Allocated memory is still 200.3 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.66 ms. Allocated memory is still 200.3 MB. Free memory was 149.0 MB in the beginning and 102.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189289.23 ms. Allocated memory was 200.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6794 VarBasedMoverChecksPositive, 260 VarBasedMoverChecksNegative, 81 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 73051 CheckedPairsTotal, 115 TotalNumberOfCompositions - ExceptionOrErrorResult: AssertionError: program execution has not yet been computed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: program execution has not yet been computed: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:451) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown