/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:08:30,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:08:30,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:08:30,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:08:30,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:08:30,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:08:30,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:08:30,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:08:30,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:08:30,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:08:30,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:08:30,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:08:30,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:08:30,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:08:30,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:08:30,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:08:30,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:08:30,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:08:30,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:08:30,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:08:30,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:08:30,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:08:30,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:08:30,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:08:30,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:08:30,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:08:30,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:08:30,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:08:30,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:08:30,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:08:30,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:08:30,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:08:30,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:08:30,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:08:30,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:08:30,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:08:30,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:08:30,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:08:30,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:08:30,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:08:30,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:08:30,937 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-VariableLbe-MCR.epf [2019-12-27 23:08:30,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:08:30,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:08:30,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:08:30,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:08:30,970 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:08:30,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:08:30,970 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:08:30,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:08:30,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:08:30,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:08:30,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:08:30,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:08:30,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:08:30,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:08:30,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:08:30,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:08:30,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:08:30,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:08:30,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:08:30,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:08:30,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:08:30,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:08:30,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:08:30,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:08:30,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:08:30,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:08:30,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:08:30,976 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:08:30,976 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:08:30,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:08:30,977 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:08:30,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:08:31,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:08:31,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:08:31,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:08:31,306 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:08:31,306 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:08:31,307 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2019-12-27 23:08:31,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4168e638f/f303d1c702e34d13a5b0862952a26981/FLAGedf58824d [2019-12-27 23:08:32,055 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:08:32,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2019-12-27 23:08:32,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4168e638f/f303d1c702e34d13a5b0862952a26981/FLAGedf58824d [2019-12-27 23:08:32,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4168e638f/f303d1c702e34d13a5b0862952a26981 [2019-12-27 23:08:32,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:08:32,244 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:08:32,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:08:32,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:08:32,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:08:32,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:08:32" (1/1) ... [2019-12-27 23:08:32,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79aefccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:32, skipping insertion in model container [2019-12-27 23:08:32,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:08:32" (1/1) ... [2019-12-27 23:08:32,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:08:32,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:08:33,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:08:33,197 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:08:33,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:08:33,868 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:08:33,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33 WrapperNode [2019-12-27 23:08:33,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:08:33,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:08:33,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:08:33,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:08:33,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (1/1) ... [2019-12-27 23:08:33,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (1/1) ... [2019-12-27 23:08:34,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:08:34,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:08:34,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:08:34,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:08:34,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (1/1) ... [2019-12-27 23:08:34,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (1/1) ... [2019-12-27 23:08:34,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (1/1) ... [2019-12-27 23:08:34,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (1/1) ... [2019-12-27 23:08:34,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (1/1) ... [2019-12-27 23:08:34,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (1/1) ... [2019-12-27 23:08:34,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (1/1) ... [2019-12-27 23:08:34,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:08:34,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:08:34,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:08:34,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:08:34,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (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 23:08:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:08:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 23:08:34,235 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 23:08:34,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 23:08:34,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:08:34,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:08:34,236 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-27 23:08:34,236 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-27 23:08:34,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:08:34,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:08:34,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 23:08:34,239 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 23:08:35,242 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:08:35,242 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 23:08:35,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:08:35 BoogieIcfgContainer [2019-12-27 23:08:35,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:08:35,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:08:35,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:08:35,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:08:35,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:08:32" (1/3) ... [2019-12-27 23:08:35,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f8ba16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:08:35, skipping insertion in model container [2019-12-27 23:08:35,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:08:33" (2/3) ... [2019-12-27 23:08:35,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f8ba16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:08:35, skipping insertion in model container [2019-12-27 23:08:35,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:08:35" (3/3) ... [2019-12-27 23:08:35,253 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2019-12-27 23:08:35,263 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:08:35,263 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:08:35,271 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-27 23:08:35,272 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:08:35,304 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,305 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,305 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,305 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,306 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,306 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,306 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,306 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,307 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,307 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,307 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,307 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,307 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,308 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,308 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,308 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,308 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,309 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,309 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,309 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,309 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,310 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,310 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,310 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,310 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,311 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,311 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,311 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,311 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,312 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,312 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,312 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,312 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,313 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,313 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,313 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,313 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,314 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,314 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,314 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,314 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,315 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,315 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,315 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,316 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,316 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,316 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,316 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,317 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,317 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,317 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,317 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,317 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,318 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,318 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,318 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,319 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,319 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,323 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,323 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,323 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,324 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,324 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,324 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,324 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,324 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,325 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,325 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,336 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,337 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,338 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,338 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,338 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,338 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,339 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,339 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,339 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,339 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:08:35,375 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 23:08:35,393 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:08:35,394 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:08:35,394 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:08:35,394 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:08:35,394 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:08:35,394 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:08:35,395 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:08:35,395 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:08:35,413 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions [2019-12-27 23:08:35,415 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions [2019-12-27 23:08:35,499 INFO L132 PetriNetUnfolder]: 11/192 cut-off events. [2019-12-27 23:08:35,499 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 23:08:35,507 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-27 23:08:35,514 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions [2019-12-27 23:08:35,588 INFO L132 PetriNetUnfolder]: 11/192 cut-off events. [2019-12-27 23:08:35,588 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 23:08:35,591 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-27 23:08:35,596 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2652 [2019-12-27 23:08:35,597 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:08:37,422 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:08:37,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:37,464 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:08:37,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:37,496 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 23:08:37,496 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2019-12-27 23:08:39,144 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-27 23:08:40,332 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:08:40,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:40,381 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:08:40,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:40,406 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 23:08:40,407 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-27 23:08:41,342 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-27 23:08:41,930 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-27 23:08:42,104 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-27 23:08:43,193 WARN L192 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2019-12-27 23:08:43,212 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:08:43,425 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-27 23:08:43,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:43,432 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 23:08:43,643 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 23:08:43,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:08:43,646 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-27 23:08:43,646 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2019-12-27 23:08:43,847 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 23:08:44,162 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-12-27 23:08:44,288 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 23:08:44,475 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-27 23:08:45,146 WARN L192 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2019-12-27 23:08:45,410 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-27 23:08:46,395 WARN L192 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-12-27 23:08:46,777 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-27 23:08:46,789 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5214 [2019-12-27 23:08:46,789 INFO L214 etLargeBlockEncoding]: Total number of compositions: 166 [2019-12-27 23:08:46,793 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 39 transitions [2019-12-27 23:08:46,822 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2019-12-27 23:08:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2019-12-27 23:08:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 23:08:46,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:46,848 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 23:08:46,849 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:46,855 INFO L82 PathProgramCache]: Analyzing trace with hash 562, now seen corresponding path program 1 times [2019-12-27 23:08:46,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:46,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607812166] [2019-12-27 23:08:46,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:47,169 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 23:08:47,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607812166] [2019-12-27 23:08:47,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:47,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 23:08:47,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1461825884] [2019-12-27 23:08:47,173 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:47,179 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:47,187 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 2 states and 1 transitions. [2019-12-27 23:08:47,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:47,192 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:47,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 23:08:47,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:47,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 23:08:47,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 23:08:47,208 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2019-12-27 23:08:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:47,245 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2019-12-27 23:08:47,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 23:08:47,248 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 23:08:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:47,262 INFO L225 Difference]: With dead ends: 423 [2019-12-27 23:08:47,262 INFO L226 Difference]: Without dead ends: 348 [2019-12-27 23:08:47,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 23:08:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-27 23:08:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-12-27 23:08:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-27 23:08:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2019-12-27 23:08:47,337 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2019-12-27 23:08:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:47,338 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2019-12-27 23:08:47,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 23:08:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2019-12-27 23:08:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 23:08:47,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:47,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 23:08:47,339 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:47,340 INFO L82 PathProgramCache]: Analyzing trace with hash 17204672, now seen corresponding path program 1 times [2019-12-27 23:08:47,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:47,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514340422] [2019-12-27 23:08:47,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:47,531 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 23:08:47,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514340422] [2019-12-27 23:08:47,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:47,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:08:47,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2036378962] [2019-12-27 23:08:47,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:47,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:47,534 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 23:08:47,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:47,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:47,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:08:47,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:47,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:08:47,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:08:47,537 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2019-12-27 23:08:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:47,665 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2019-12-27 23:08:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:08:47,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 23:08:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:47,671 INFO L225 Difference]: With dead ends: 471 [2019-12-27 23:08:47,671 INFO L226 Difference]: Without dead ends: 471 [2019-12-27 23:08:47,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:08:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-27 23:08:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2019-12-27 23:08:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-27 23:08:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2019-12-27 23:08:47,728 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2019-12-27 23:08:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:47,729 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2019-12-27 23:08:47,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:08:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2019-12-27 23:08:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 23:08:47,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:47,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 23:08:47,733 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:47,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:47,733 INFO L82 PathProgramCache]: Analyzing trace with hash 533344430, now seen corresponding path program 1 times [2019-12-27 23:08:47,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:47,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29721059] [2019-12-27 23:08:47,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:47,843 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 23:08:47,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29721059] [2019-12-27 23:08:47,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:47,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:08:47,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [505806684] [2019-12-27 23:08:47,844 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:47,845 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:47,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 23:08:47,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:47,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:47,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:08:47,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:47,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:08:47,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:08:47,847 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2019-12-27 23:08:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:47,947 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2019-12-27 23:08:47,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:08:47,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 23:08:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:47,951 INFO L225 Difference]: With dead ends: 498 [2019-12-27 23:08:47,951 INFO L226 Difference]: Without dead ends: 482 [2019-12-27 23:08:47,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:08:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-27 23:08:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2019-12-27 23:08:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-12-27 23:08:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2019-12-27 23:08:47,970 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2019-12-27 23:08:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:47,970 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2019-12-27 23:08:47,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:08:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2019-12-27 23:08:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 23:08:47,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:47,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:08:47,973 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:47,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:47,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1592212615, now seen corresponding path program 1 times [2019-12-27 23:08:47,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:47,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449617029] [2019-12-27 23:08:47,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:48,032 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 23:08:48,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449617029] [2019-12-27 23:08:48,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:48,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:08:48,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1022807860] [2019-12-27 23:08:48,033 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:48,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:48,037 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 20 transitions. [2019-12-27 23:08:48,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:48,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:08:48,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:08:48,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:48,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:08:48,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:08:48,076 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 5 states. [2019-12-27 23:08:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:48,141 INFO L93 Difference]: Finished difference Result 114 states and 195 transitions. [2019-12-27 23:08:48,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:08:48,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-27 23:08:48,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:48,142 INFO L225 Difference]: With dead ends: 114 [2019-12-27 23:08:48,142 INFO L226 Difference]: Without dead ends: 114 [2019-12-27 23:08:48,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:08:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-27 23:08:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-12-27 23:08:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-27 23:08:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 195 transitions. [2019-12-27 23:08:48,147 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 195 transitions. Word has length 10 [2019-12-27 23:08:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:48,148 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 195 transitions. [2019-12-27 23:08:48,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:08:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 195 transitions. [2019-12-27 23:08:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:08:48,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:48,150 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 23:08:48,150 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:48,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:48,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1401747938, now seen corresponding path program 1 times [2019-12-27 23:08:48,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:48,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378840492] [2019-12-27 23:08:48,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:48,661 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-12-27 23:08:48,801 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-12-27 23:08:48,939 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2019-12-27 23:08:49,123 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2019-12-27 23:08:49,282 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-12-27 23:08:49,801 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 23:08:49,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378840492] [2019-12-27 23:08:49,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:49,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:08:49,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122875334] [2019-12-27 23:08:49,802 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:49,808 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:49,819 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 36 transitions. [2019-12-27 23:08:49,819 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:50,048 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:08:50,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:08:50,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:50,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:08:50,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:08:50,050 INFO L87 Difference]: Start difference. First operand 114 states and 195 transitions. Second operand 16 states. [2019-12-27 23:08:50,443 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-27 23:08:51,683 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-12-27 23:08:51,937 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-12-27 23:08:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:52,322 INFO L93 Difference]: Finished difference Result 145 states and 242 transitions. [2019-12-27 23:08:52,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:08:52,322 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 23:08:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:52,324 INFO L225 Difference]: With dead ends: 145 [2019-12-27 23:08:52,324 INFO L226 Difference]: Without dead ends: 145 [2019-12-27 23:08:52,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:08:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-27 23:08:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-12-27 23:08:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-27 23:08:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 242 transitions. [2019-12-27 23:08:52,330 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 242 transitions. Word has length 22 [2019-12-27 23:08:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:52,330 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 242 transitions. [2019-12-27 23:08:52,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:08:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 242 transitions. [2019-12-27 23:08:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:08:52,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:52,332 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 23:08:52,332 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:52,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1401747950, now seen corresponding path program 1 times [2019-12-27 23:08:52,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:52,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84625839] [2019-12-27 23:08:52,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:52,670 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 23:08:52,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84625839] [2019-12-27 23:08:52,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:52,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:08:52,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406280531] [2019-12-27 23:08:52,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:52,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:52,686 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 36 transitions. [2019-12-27 23:08:52,686 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:52,742 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:08:52,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:08:52,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:52,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:08:52,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:08:52,743 INFO L87 Difference]: Start difference. First operand 145 states and 242 transitions. Second operand 9 states. [2019-12-27 23:08:53,192 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-12-27 23:08:53,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:53,369 INFO L93 Difference]: Finished difference Result 203 states and 329 transitions. [2019-12-27 23:08:53,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:08:53,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 23:08:53,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:53,370 INFO L225 Difference]: With dead ends: 203 [2019-12-27 23:08:53,370 INFO L226 Difference]: Without dead ends: 170 [2019-12-27 23:08:53,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:08:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-27 23:08:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-12-27 23:08:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-27 23:08:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 228 transitions. [2019-12-27 23:08:53,375 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 228 transitions. Word has length 22 [2019-12-27 23:08:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:53,375 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 228 transitions. [2019-12-27 23:08:53,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:08:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 228 transitions. [2019-12-27 23:08:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:08:53,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:53,377 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 23:08:53,377 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:53,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1297988672, now seen corresponding path program 2 times [2019-12-27 23:08:53,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:53,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96498278] [2019-12-27 23:08:53,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:53,697 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-27 23:08:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:08:54,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96498278] [2019-12-27 23:08:54,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:54,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:08:54,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774873335] [2019-12-27 23:08:54,453 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:54,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:54,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 23:08:54,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:54,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:08:54,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:08:54,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:54,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:08:54,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:08:54,614 INFO L87 Difference]: Start difference. First operand 137 states and 228 transitions. Second operand 16 states. [2019-12-27 23:08:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:55,862 INFO L93 Difference]: Finished difference Result 171 states and 279 transitions. [2019-12-27 23:08:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:08:55,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 23:08:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:55,864 INFO L225 Difference]: With dead ends: 171 [2019-12-27 23:08:55,864 INFO L226 Difference]: Without dead ends: 140 [2019-12-27 23:08:55,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:08:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-27 23:08:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2019-12-27 23:08:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-27 23:08:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 226 transitions. [2019-12-27 23:08:55,869 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 226 transitions. Word has length 22 [2019-12-27 23:08:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:55,870 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 226 transitions. [2019-12-27 23:08:55,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:08:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 226 transitions. [2019-12-27 23:08:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:08:55,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:55,871 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 23:08:55,871 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash 666257692, now seen corresponding path program 3 times [2019-12-27 23:08:55,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:55,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784671] [2019-12-27 23:08:55,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:56,204 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-27 23:08:56,315 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-27 23:08:56,556 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-12-27 23:08:56,689 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-12-27 23:08:57,120 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 23:08:57,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784671] [2019-12-27 23:08:57,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:57,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:08:57,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1828565437] [2019-12-27 23:08:57,121 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:57,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:57,136 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 56 transitions. [2019-12-27 23:08:57,136 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:57,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 23:08:57,462 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-27 23:08:57,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 23:08:57,978 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 23:08:57,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:08:57,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:08:57,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:08:57,980 INFO L87 Difference]: Start difference. First operand 136 states and 226 transitions. Second operand 19 states. [2019-12-27 23:08:58,900 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2019-12-27 23:08:59,189 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 39 [2019-12-27 23:08:59,542 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 41 [2019-12-27 23:08:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:59,979 INFO L93 Difference]: Finished difference Result 158 states and 255 transitions. [2019-12-27 23:08:59,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:08:59,979 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-27 23:08:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:59,980 INFO L225 Difference]: With dead ends: 158 [2019-12-27 23:08:59,981 INFO L226 Difference]: Without dead ends: 128 [2019-12-27 23:08:59,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:08:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-27 23:08:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2019-12-27 23:08:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-27 23:08:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 202 transitions. [2019-12-27 23:08:59,985 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 202 transitions. Word has length 22 [2019-12-27 23:08:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:59,986 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 202 transitions. [2019-12-27 23:08:59,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:08:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 202 transitions. [2019-12-27 23:08:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:08:59,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:59,987 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 23:08:59,987 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash -677505502, now seen corresponding path program 2 times [2019-12-27 23:08:59,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:59,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541034133] [2019-12-27 23:08:59,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:00,311 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 23:09:00,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541034133] [2019-12-27 23:09:00,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:00,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:09:00,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [833477388] [2019-12-27 23:09:00,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:00,317 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:00,328 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 56 transitions. [2019-12-27 23:09:00,329 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:00,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:09:00,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:09:00,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:00,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:09:00,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:09:00,413 INFO L87 Difference]: Start difference. First operand 123 states and 202 transitions. Second operand 11 states. [2019-12-27 23:09:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:01,725 INFO L93 Difference]: Finished difference Result 134 states and 213 transitions. [2019-12-27 23:09:01,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:09:01,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-27 23:09:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:01,727 INFO L225 Difference]: With dead ends: 134 [2019-12-27 23:09:01,727 INFO L226 Difference]: Without dead ends: 109 [2019-12-27 23:09:01,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:09:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-27 23:09:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-12-27 23:09:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-27 23:09:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 174 transitions. [2019-12-27 23:09:01,731 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 174 transitions. Word has length 22 [2019-12-27 23:09:01,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:01,731 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 174 transitions. [2019-12-27 23:09:01,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:09:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 174 transitions. [2019-12-27 23:09:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:01,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:01,732 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 23:09:01,733 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:01,733 INFO L82 PathProgramCache]: Analyzing trace with hash -680803282, now seen corresponding path program 4 times [2019-12-27 23:09:01,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:01,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072808136] [2019-12-27 23:09:01,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:02,753 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 23:09:02,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072808136] [2019-12-27 23:09:02,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:02,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 23:09:02,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1276954162] [2019-12-27 23:09:02,755 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:02,762 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:02,777 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 23:09:02,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:02,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:09:02,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:09:02,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:02,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:09:02,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:09:02,863 INFO L87 Difference]: Start difference. First operand 109 states and 174 transitions. Second operand 14 states. [2019-12-27 23:09:03,704 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-27 23:09:03,957 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-27 23:09:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:04,258 INFO L93 Difference]: Finished difference Result 118 states and 183 transitions. [2019-12-27 23:09:04,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:09:04,259 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-27 23:09:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:04,260 INFO L225 Difference]: With dead ends: 118 [2019-12-27 23:09:04,260 INFO L226 Difference]: Without dead ends: 101 [2019-12-27 23:09:04,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:09:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-27 23:09:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-12-27 23:09:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-27 23:09:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2019-12-27 23:09:04,264 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 22 [2019-12-27 23:09:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:04,264 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2019-12-27 23:09:04,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:09:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2019-12-27 23:09:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:04,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:04,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:09:04,266 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:04,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash 382303790, now seen corresponding path program 5 times [2019-12-27 23:09:04,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:04,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032462697] [2019-12-27 23:09:04,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:04,689 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-12-27 23:09:04,844 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-12-27 23:09:04,975 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-12-27 23:09:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:09:05,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032462697] [2019-12-27 23:09:05,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:05,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:09:05,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1580026056] [2019-12-27 23:09:05,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:05,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:05,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 62 transitions. [2019-12-27 23:09:05,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:05,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:09:05,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:09:05,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:05,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:09:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:09:05,508 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand 15 states. [2019-12-27 23:09:06,220 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-12-27 23:09:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:06,530 INFO L93 Difference]: Finished difference Result 103 states and 160 transitions. [2019-12-27 23:09:06,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:09:06,531 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-27 23:09:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:06,531 INFO L225 Difference]: With dead ends: 103 [2019-12-27 23:09:06,531 INFO L226 Difference]: Without dead ends: 64 [2019-12-27 23:09:06,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:09:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-27 23:09:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-12-27 23:09:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-27 23:09:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. [2019-12-27 23:09:06,534 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 22 [2019-12-27 23:09:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:06,534 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. [2019-12-27 23:09:06,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:09:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2019-12-27 23:09:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:06,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:06,535 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 23:09:06,536 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1025584882, now seen corresponding path program 1 times [2019-12-27 23:09:06,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:06,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132170318] [2019-12-27 23:09:06,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:06,642 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 23:09:06,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132170318] [2019-12-27 23:09:06,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:06,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:09:06,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880233083] [2019-12-27 23:09:06,643 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:06,647 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:06,654 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 32 transitions. [2019-12-27 23:09:06,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:06,677 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:09:06,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:09:06,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:06,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:09:06,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:09:06,679 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand 6 states. [2019-12-27 23:09:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:07,075 INFO L93 Difference]: Finished difference Result 89 states and 136 transitions. [2019-12-27 23:09:07,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:09:07,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 23:09:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:07,077 INFO L225 Difference]: With dead ends: 89 [2019-12-27 23:09:07,077 INFO L226 Difference]: Without dead ends: 89 [2019-12-27 23:09:07,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:09:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-27 23:09:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-12-27 23:09:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-27 23:09:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2019-12-27 23:09:07,080 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 22 [2019-12-27 23:09:07,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:07,080 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2019-12-27 23:09:07,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:09:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2019-12-27 23:09:07,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:07,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:07,081 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 23:09:07,081 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:07,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash -524064374, now seen corresponding path program 6 times [2019-12-27 23:09:07,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:07,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915615441] [2019-12-27 23:09:07,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:08,063 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 23:09:08,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915615441] [2019-12-27 23:09:08,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:08,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:09:08,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [39958160] [2019-12-27 23:09:08,064 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:08,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:08,074 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 23:09:08,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:08,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:09:08,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:09:08,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:08,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:09:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:09:08,177 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 15 states. [2019-12-27 23:09:09,351 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-12-27 23:09:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:09,678 INFO L93 Difference]: Finished difference Result 107 states and 160 transitions. [2019-12-27 23:09:09,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:09:09,678 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-27 23:09:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:09,679 INFO L225 Difference]: With dead ends: 107 [2019-12-27 23:09:09,679 INFO L226 Difference]: Without dead ends: 107 [2019-12-27 23:09:09,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:09:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-27 23:09:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2019-12-27 23:09:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-27 23:09:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2019-12-27 23:09:09,683 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 22 [2019-12-27 23:09:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:09,683 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2019-12-27 23:09:09,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:09:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2019-12-27 23:09:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:09,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:09,684 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 23:09:09,684 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:09,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:09,685 INFO L82 PathProgramCache]: Analyzing trace with hash -524064386, now seen corresponding path program 3 times [2019-12-27 23:09:09,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:09,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713514495] [2019-12-27 23:09:09,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:09:09,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713514495] [2019-12-27 23:09:09,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:09,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:09:09,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894422709] [2019-12-27 23:09:09,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:09,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:09,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 23:09:09,941 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:09,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:09:09,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:09:09,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:09,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:09:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:09:10,010 INFO L87 Difference]: Start difference. First operand 102 states and 153 transitions. Second operand 9 states. [2019-12-27 23:09:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:10,507 INFO L93 Difference]: Finished difference Result 127 states and 190 transitions. [2019-12-27 23:09:10,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:09:10,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 23:09:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:10,509 INFO L225 Difference]: With dead ends: 127 [2019-12-27 23:09:10,509 INFO L226 Difference]: Without dead ends: 84 [2019-12-27 23:09:10,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:09:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-27 23:09:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-12-27 23:09:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-27 23:09:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2019-12-27 23:09:10,512 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 22 [2019-12-27 23:09:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:10,512 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2019-12-27 23:09:10,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:09:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2019-12-27 23:09:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:10,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:10,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, 1, 1, 1] [2019-12-27 23:09:10,514 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash -615135152, now seen corresponding path program 2 times [2019-12-27 23:09:10,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:10,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032092311] [2019-12-27 23:09:10,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:10,686 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 23:09:10,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032092311] [2019-12-27 23:09:10,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:10,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:09:10,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973900719] [2019-12-27 23:09:10,687 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:10,691 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:10,699 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 36 transitions. [2019-12-27 23:09:10,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:10,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:09:10,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:09:10,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:09:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:09:10,702 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand 6 states. [2019-12-27 23:09:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:11,050 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2019-12-27 23:09:11,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:09:11,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 23:09:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:11,052 INFO L225 Difference]: With dead ends: 69 [2019-12-27 23:09:11,052 INFO L226 Difference]: Without dead ends: 69 [2019-12-27 23:09:11,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:09:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-27 23:09:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-12-27 23:09:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-27 23:09:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2019-12-27 23:09:11,058 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 22 [2019-12-27 23:09:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:11,058 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2019-12-27 23:09:11,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:09:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2019-12-27 23:09:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:11,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:11,059 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 23:09:11,059 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -113614644, now seen corresponding path program 7 times [2019-12-27 23:09:11,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:11,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959848005] [2019-12-27 23:09:11,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:11,983 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 23:09:11,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959848005] [2019-12-27 23:09:11,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:11,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:09:11,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882501850] [2019-12-27 23:09:11,985 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:11,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:11,994 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 30 transitions. [2019-12-27 23:09:11,994 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:12,046 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:09:12,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:09:12,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:12,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:09:12,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:09:12,047 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand 15 states. [2019-12-27 23:09:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:13,177 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2019-12-27 23:09:13,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:09:13,178 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-27 23:09:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:13,179 INFO L225 Difference]: With dead ends: 79 [2019-12-27 23:09:13,179 INFO L226 Difference]: Without dead ends: 66 [2019-12-27 23:09:13,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:09:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-27 23:09:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-27 23:09:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-27 23:09:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2019-12-27 23:09:13,182 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 22 [2019-12-27 23:09:13,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:13,183 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2019-12-27 23:09:13,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:09:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2019-12-27 23:09:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:13,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:13,183 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 23:09:13,183 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:13,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:13,184 INFO L82 PathProgramCache]: Analyzing trace with hash -138827586, now seen corresponding path program 8 times [2019-12-27 23:09:13,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:13,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723630185] [2019-12-27 23:09:13,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:14,024 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 23:09:14,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723630185] [2019-12-27 23:09:14,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:14,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:09:14,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [649076337] [2019-12-27 23:09:14,025 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:14,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:14,037 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 23:09:14,038 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:14,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 23:09:14,303 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:09:14,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:09:14,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:14,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:09:14,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:09:14,304 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 16 states. [2019-12-27 23:09:15,005 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-12-27 23:09:15,523 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2019-12-27 23:09:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:15,755 INFO L93 Difference]: Finished difference Result 84 states and 114 transitions. [2019-12-27 23:09:15,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:09:15,755 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 23:09:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:15,756 INFO L225 Difference]: With dead ends: 84 [2019-12-27 23:09:15,756 INFO L226 Difference]: Without dead ends: 72 [2019-12-27 23:09:15,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:09:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-27 23:09:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-12-27 23:09:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-27 23:09:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2019-12-27 23:09:15,760 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 22 [2019-12-27 23:09:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:15,760 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-12-27 23:09:15,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:09:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2019-12-27 23:09:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:15,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:15,761 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 23:09:15,761 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1653182376, now seen corresponding path program 4 times [2019-12-27 23:09:15,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:15,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887498503] [2019-12-27 23:09:15,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:15,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 23:09:15,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887498503] [2019-12-27 23:09:15,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:15,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:09:15,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [114062764] [2019-12-27 23:09:15,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:15,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:16,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 23:09:16,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:16,112 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:09:16,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:09:16,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:16,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:09:16,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:09:16,113 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand 10 states. [2019-12-27 23:09:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:16,659 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2019-12-27 23:09:16,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:09:16,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-27 23:09:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:16,660 INFO L225 Difference]: With dead ends: 70 [2019-12-27 23:09:16,661 INFO L226 Difference]: Without dead ends: 44 [2019-12-27 23:09:16,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:09:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-27 23:09:16,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-27 23:09:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-27 23:09:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2019-12-27 23:09:16,668 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 22 [2019-12-27 23:09:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:16,669 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2019-12-27 23:09:16,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:09:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2019-12-27 23:09:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:16,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:16,670 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 23:09:16,670 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 468192644, now seen corresponding path program 3 times [2019-12-27 23:09:16,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:16,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382761242] [2019-12-27 23:09:16,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:09:16,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382761242] [2019-12-27 23:09:16,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:16,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:09:16,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805121641] [2019-12-27 23:09:16,916 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:16,919 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:16,927 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 23:09:16,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:16,928 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 23:09:16,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:09:16,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:16,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:09:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:09:16,929 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand 8 states. [2019-12-27 23:09:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:17,219 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-12-27 23:09:17,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:09:17,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 23:09:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:17,220 INFO L225 Difference]: With dead ends: 35 [2019-12-27 23:09:17,220 INFO L226 Difference]: Without dead ends: 35 [2019-12-27 23:09:17,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:09:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-27 23:09:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-27 23:09:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-27 23:09:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-12-27 23:09:17,222 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2019-12-27 23:09:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:17,223 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-12-27 23:09:17,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:09:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-12-27 23:09:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:17,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:17,224 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 23:09:17,224 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1814694994, now seen corresponding path program 9 times [2019-12-27 23:09:17,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:17,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057418216] [2019-12-27 23:09:17,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:17,513 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-12-27 23:09:17,665 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-12-27 23:09:17,811 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-27 23:09:18,189 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-12-27 23:09:18,464 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 23:09:18,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057418216] [2019-12-27 23:09:18,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:18,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:09:18,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928554206] [2019-12-27 23:09:18,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:18,468 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:18,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 40 transitions. [2019-12-27 23:09:18,494 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:18,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:09:18,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:09:18,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:18,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:09:18,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:09:18,541 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 15 states. [2019-12-27 23:09:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:19,446 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-12-27 23:09:19,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:09:19,446 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-27 23:09:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:19,447 INFO L225 Difference]: With dead ends: 42 [2019-12-27 23:09:19,447 INFO L226 Difference]: Without dead ends: 34 [2019-12-27 23:09:19,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:09:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-27 23:09:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-27 23:09:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 23:09:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-12-27 23:09:19,449 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 22 [2019-12-27 23:09:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:19,449 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-12-27 23:09:19,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:09:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2019-12-27 23:09:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:09:19,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:09:19,450 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 23:09:19,450 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:09:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:09:19,450 INFO L82 PathProgramCache]: Analyzing trace with hash -437525002, now seen corresponding path program 10 times [2019-12-27 23:09:19,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:09:19,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114212717] [2019-12-27 23:09:19,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:09:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:09:20,272 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 23:09:20,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114212717] [2019-12-27 23:09:20,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:09:20,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:09:20,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522363733] [2019-12-27 23:09:20,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:09:20,276 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:09:20,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 23:09:20,283 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:09:20,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:09:20,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:09:20,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:09:20,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:09:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:09:20,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:09:20,462 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 16 states. [2019-12-27 23:09:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:09:21,292 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-12-27 23:09:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:09:21,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-27 23:09:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:09:21,293 INFO L225 Difference]: With dead ends: 33 [2019-12-27 23:09:21,293 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 23:09:21,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:09:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 23:09:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 23:09:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 23:09:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 23:09:21,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-27 23:09:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:09:21,294 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 23:09:21,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:09:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 23:09:21,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 23:09:21,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:09:21 BasicIcfg [2019-12-27 23:09:21,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:09:21,301 INFO L168 Benchmark]: Toolchain (without parser) took 49057.93 ms. Allocated memory was 139.5 MB in the beginning and 434.1 MB in the end (delta: 294.6 MB). Free memory was 98.4 MB in the beginning and 107.0 MB in the end (delta: -8.6 MB). Peak memory consumption was 286.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:09:21,301 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 139.5 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 23:09:21,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1624.29 ms. Allocated memory was 139.5 MB in the beginning and 237.5 MB in the end (delta: 98.0 MB). Free memory was 98.1 MB in the beginning and 170.2 MB in the end (delta: -72.0 MB). Peak memory consumption was 76.2 MB. Max. memory is 7.1 GB. [2019-12-27 23:09:21,302 INFO L168 Benchmark]: Boogie Procedure Inliner took 175.17 ms. Allocated memory is still 237.5 MB. Free memory was 170.2 MB in the beginning and 167.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:09:21,303 INFO L168 Benchmark]: Boogie Preprocessor took 108.61 ms. Allocated memory is still 237.5 MB. Free memory was 167.2 MB in the beginning and 164.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:09:21,303 INFO L168 Benchmark]: RCFGBuilder took 1089.16 ms. Allocated memory is still 237.5 MB. Free memory was 164.3 MB in the beginning and 116.0 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:09:21,304 INFO L168 Benchmark]: TraceAbstraction took 46053.88 ms. Allocated memory was 237.5 MB in the beginning and 434.1 MB in the end (delta: 196.6 MB). Free memory was 116.0 MB in the beginning and 107.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 205.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:09:21,306 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.16 ms. Allocated memory is still 139.5 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1624.29 ms. Allocated memory was 139.5 MB in the beginning and 237.5 MB in the end (delta: 98.0 MB). Free memory was 98.1 MB in the beginning and 170.2 MB in the end (delta: -72.0 MB). Peak memory consumption was 76.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 175.17 ms. Allocated memory is still 237.5 MB. Free memory was 170.2 MB in the beginning and 167.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.61 ms. Allocated memory is still 237.5 MB. Free memory was 167.2 MB in the beginning and 164.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1089.16 ms. Allocated memory is still 237.5 MB. Free memory was 164.3 MB in the beginning and 116.0 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46053.88 ms. Allocated memory was 237.5 MB in the beginning and 434.1 MB in the end (delta: 196.6 MB). Free memory was 116.0 MB in the beginning and 107.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 205.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 11.3s, 150 ProgramPointsBefore, 40 ProgramPointsAfterwards, 154 TransitionsBefore, 39 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 15 ConcurrentYvCompositions, 6 ChoiceCompositions, 1364 VarBasedMoverChecksPositive, 37 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5214 CheckedPairsTotal, 166 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Result: SAFE, OverallTime: 45.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 490 SDtfs, 708 SDslu, 1788 SDs, 0 SdLazy, 4173 SolverSat, 424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 78 SyntacticMatches, 37 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 21.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 166 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 153342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...