/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:40:37,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:40:37,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:40:37,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:40:37,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:40:37,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:40:37,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:40:37,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:40:37,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:40:37,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:40:37,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:40:37,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:40:37,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:40:37,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:40:37,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:40:37,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:40:37,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:40:37,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:40:37,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:40:37,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:40:37,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:40:37,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:40:37,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:40:37,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:40:37,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:40:37,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:40:37,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:40:37,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:40:37,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:40:37,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:40:37,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:40:37,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:40:37,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:40:38,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:40:38,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:40:38,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:40:38,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:40:38,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:40:38,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:40:38,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:40:38,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:40:38,005 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.epf [2019-12-27 05:40:38,029 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:40:38,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:40:38,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:40:38,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:40:38,032 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:40:38,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:40:38,032 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:40:38,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:40:38,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:40:38,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:40:38,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:40:38,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:40:38,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:40:38,034 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:40:38,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:40:38,034 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:40:38,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:40:38,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:40:38,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:40:38,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:40:38,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:40:38,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:40:38,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:40:38,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:40:38,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:40:38,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:40:38,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:40:38,038 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:40:38,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:40:38,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:40:38,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:40:38,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:40:38,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:40:38,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:40:38,358 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:40:38,359 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2019-12-27 05:40:38,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6107c81a/4165eea91e8f4ec7ae4d6e54ab90321c/FLAG0e6d7ffb0 [2019-12-27 05:40:38,962 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:40:38,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2019-12-27 05:40:38,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6107c81a/4165eea91e8f4ec7ae4d6e54ab90321c/FLAG0e6d7ffb0 [2019-12-27 05:40:39,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6107c81a/4165eea91e8f4ec7ae4d6e54ab90321c [2019-12-27 05:40:39,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:40:39,215 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:40:39,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:40:39,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:40:39,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:40:39,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:39,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce39b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39, skipping insertion in model container [2019-12-27 05:40:39,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:39,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:40:39,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:40:39,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:40:39,805 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:40:39,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:40:39,970 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:40:39,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39 WrapperNode [2019-12-27 05:40:39,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:40:39,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:40:39,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:40:39,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:40:39,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:40,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:40,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:40:40,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:40:40,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:40:40,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:40:40,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:40,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:40,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:40,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:40,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:40,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:40,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (1/1) ... [2019-12-27 05:40:40,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:40:40,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:40:40,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:40:40,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:40:40,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (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 05:40:40,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:40:40,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:40:40,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:40:40,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:40:40,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:40:40,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:40:40,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:40:40,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:40:40,145 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:40:40,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:40:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:40:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:40:40,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:40:40,148 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 05:40:40,933 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:40:40,933 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:40:40,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:40:40 BoogieIcfgContainer [2019-12-27 05:40:40,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:40:40,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:40:40,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:40:40,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:40:40,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:40:39" (1/3) ... [2019-12-27 05:40:40,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c520c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:40:40, skipping insertion in model container [2019-12-27 05:40:40,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:39" (2/3) ... [2019-12-27 05:40:40,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c520c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:40:40, skipping insertion in model container [2019-12-27 05:40:40,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:40:40" (3/3) ... [2019-12-27 05:40:40,944 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2019-12-27 05:40:40,954 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:40:40,954 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:40:40,961 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:40:40,962 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:40:41,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,001 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,001 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,038 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,039 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,049 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,050 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,052 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,053 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,053 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,057 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,058 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:40:41,074 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:40:41,095 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:40:41,096 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:40:41,096 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:40:41,096 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:40:41,096 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:40:41,096 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:40:41,096 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:40:41,097 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:40:41,115 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 05:40:41,117 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 05:40:41,220 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 05:40:41,221 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:40:41,239 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:40:41,264 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 05:40:41,319 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 05:40:41,319 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:40:41,328 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:40:41,348 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 05:40:41,349 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:40:44,694 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-27 05:40:44,818 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-27 05:40:44,963 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 05:40:45,121 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 05:40:45,153 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93012 [2019-12-27 05:40:45,154 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 05:40:45,157 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-27 05:41:09,182 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129054 states. [2019-12-27 05:41:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 129054 states. [2019-12-27 05:41:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 05:41:09,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:09,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 05:41:09,195 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:41:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash 816286795, now seen corresponding path program 1 times [2019-12-27 05:41:09,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:09,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142023464] [2019-12-27 05:41:09,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:09,507 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 05:41:09,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142023464] [2019-12-27 05:41:09,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:09,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:41:09,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609635009] [2019-12-27 05:41:09,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:41:09,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:41:09,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:41:09,532 INFO L87 Difference]: Start difference. First operand 129054 states. Second operand 3 states. [2019-12-27 05:41:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:10,839 INFO L93 Difference]: Finished difference Result 128356 states and 547037 transitions. [2019-12-27 05:41:10,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:41:10,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 05:41:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:11,631 INFO L225 Difference]: With dead ends: 128356 [2019-12-27 05:41:11,631 INFO L226 Difference]: Without dead ends: 125612 [2019-12-27 05:41:11,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:41:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125612 states. [2019-12-27 05:41:22,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125612 to 125612. [2019-12-27 05:41:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125612 states. [2019-12-27 05:41:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125612 states to 125612 states and 535865 transitions. [2019-12-27 05:41:23,102 INFO L78 Accepts]: Start accepts. Automaton has 125612 states and 535865 transitions. Word has length 5 [2019-12-27 05:41:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:23,103 INFO L462 AbstractCegarLoop]: Abstraction has 125612 states and 535865 transitions. [2019-12-27 05:41:23,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:41:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 125612 states and 535865 transitions. [2019-12-27 05:41:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:41:23,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:23,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:41:23,107 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:41:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash -711336831, now seen corresponding path program 1 times [2019-12-27 05:41:23,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:23,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535895787] [2019-12-27 05:41:23,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:23,226 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 05:41:23,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535895787] [2019-12-27 05:41:23,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:23,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:41:23,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812306214] [2019-12-27 05:41:23,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:41:23,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:23,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:41:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:41:23,231 INFO L87 Difference]: Start difference. First operand 125612 states and 535865 transitions. Second operand 4 states. [2019-12-27 05:41:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:29,112 INFO L93 Difference]: Finished difference Result 196058 states and 801209 transitions. [2019-12-27 05:41:29,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:41:29,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:41:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:29,754 INFO L225 Difference]: With dead ends: 196058 [2019-12-27 05:41:29,754 INFO L226 Difference]: Without dead ends: 196009 [2019-12-27 05:41:29,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196009 states. [2019-12-27 05:41:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196009 to 178565. [2019-12-27 05:41:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178565 states. [2019-12-27 05:41:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178565 states to 178565 states and 738966 transitions. [2019-12-27 05:41:44,065 INFO L78 Accepts]: Start accepts. Automaton has 178565 states and 738966 transitions. Word has length 11 [2019-12-27 05:41:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:44,066 INFO L462 AbstractCegarLoop]: Abstraction has 178565 states and 738966 transitions. [2019-12-27 05:41:44,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:41:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 178565 states and 738966 transitions. [2019-12-27 05:41:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:41:44,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:44,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:41:44,075 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:41:44,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1631802286, now seen corresponding path program 1 times [2019-12-27 05:41:44,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:44,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25940627] [2019-12-27 05:41:44,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:44,158 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 05:41:44,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25940627] [2019-12-27 05:41:44,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:44,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:41:44,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047141098] [2019-12-27 05:41:44,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:41:44,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:41:44,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:41:44,162 INFO L87 Difference]: Start difference. First operand 178565 states and 738966 transitions. Second operand 4 states. [2019-12-27 05:41:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:52,659 INFO L93 Difference]: Finished difference Result 255083 states and 1028836 transitions. [2019-12-27 05:41:52,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:41:52,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 05:41:52,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:53,594 INFO L225 Difference]: With dead ends: 255083 [2019-12-27 05:41:53,594 INFO L226 Difference]: Without dead ends: 255020 [2019-12-27 05:41:53,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:42:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255020 states. [2019-12-27 05:42:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255020 to 215778. [2019-12-27 05:42:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215778 states. [2019-12-27 05:42:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215778 states to 215778 states and 885553 transitions. [2019-12-27 05:42:15,491 INFO L78 Accepts]: Start accepts. Automaton has 215778 states and 885553 transitions. Word has length 13 [2019-12-27 05:42:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:42:15,493 INFO L462 AbstractCegarLoop]: Abstraction has 215778 states and 885553 transitions. [2019-12-27 05:42:15,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:42:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 215778 states and 885553 transitions. [2019-12-27 05:42:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:42:15,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:42:15,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:42:15,497 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:42:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:42:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash 93405852, now seen corresponding path program 1 times [2019-12-27 05:42:15,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:42:15,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666489538] [2019-12-27 05:42:15,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:42:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:42:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:42:15,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666489538] [2019-12-27 05:42:15,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:42:15,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:42:15,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858722482] [2019-12-27 05:42:15,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:42:15,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:42:15,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:42:15,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:42:15,576 INFO L87 Difference]: Start difference. First operand 215778 states and 885553 transitions. Second operand 4 states. [2019-12-27 05:42:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:42:17,031 INFO L93 Difference]: Finished difference Result 262115 states and 1067109 transitions. [2019-12-27 05:42:17,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:42:17,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 05:42:17,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:42:26,195 INFO L225 Difference]: With dead ends: 262115 [2019-12-27 05:42:26,195 INFO L226 Difference]: Without dead ends: 262115 [2019-12-27 05:42:26,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:42:32,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262115 states. [2019-12-27 05:42:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262115 to 223915. [2019-12-27 05:42:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223915 states. [2019-12-27 05:42:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223915 states to 223915 states and 920985 transitions. [2019-12-27 05:42:37,903 INFO L78 Accepts]: Start accepts. Automaton has 223915 states and 920985 transitions. Word has length 13 [2019-12-27 05:42:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:42:37,903 INFO L462 AbstractCegarLoop]: Abstraction has 223915 states and 920985 transitions. [2019-12-27 05:42:37,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:42:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 223915 states and 920985 transitions. [2019-12-27 05:42:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 05:42:37,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:42:37,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:42:37,926 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:42:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:42:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2054469766, now seen corresponding path program 1 times [2019-12-27 05:42:37,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:42:37,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731589281] [2019-12-27 05:42:37,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:42:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:42:38,009 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 05:42:38,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731589281] [2019-12-27 05:42:38,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:42:38,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:42:38,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066741654] [2019-12-27 05:42:38,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:42:38,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:42:38,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:42:38,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:42:38,012 INFO L87 Difference]: Start difference. First operand 223915 states and 920985 transitions. Second operand 5 states. [2019-12-27 05:42:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:42:46,498 INFO L93 Difference]: Finished difference Result 323259 states and 1298060 transitions. [2019-12-27 05:42:46,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:42:46,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 05:42:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:42:48,213 INFO L225 Difference]: With dead ends: 323259 [2019-12-27 05:42:48,214 INFO L226 Difference]: Without dead ends: 323112 [2019-12-27 05:42:48,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:43:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323112 states. [2019-12-27 05:43:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323112 to 244992. [2019-12-27 05:43:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244992 states. [2019-12-27 05:43:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244992 states to 244992 states and 1002998 transitions. [2019-12-27 05:43:07,151 INFO L78 Accepts]: Start accepts. Automaton has 244992 states and 1002998 transitions. Word has length 19 [2019-12-27 05:43:07,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:07,152 INFO L462 AbstractCegarLoop]: Abstraction has 244992 states and 1002998 transitions. [2019-12-27 05:43:07,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:43:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 244992 states and 1002998 transitions. [2019-12-27 05:43:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 05:43:07,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:07,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:07,172 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:07,172 INFO L82 PathProgramCache]: Analyzing trace with hash -111762930, now seen corresponding path program 1 times [2019-12-27 05:43:07,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:07,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576734987] [2019-12-27 05:43:07,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:07,243 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 05:43:07,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576734987] [2019-12-27 05:43:07,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:07,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:43:07,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986115538] [2019-12-27 05:43:07,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:43:07,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:07,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:43:07,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:43:07,245 INFO L87 Difference]: Start difference. First operand 244992 states and 1002998 transitions. Second operand 5 states. [2019-12-27 05:43:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:16,417 INFO L93 Difference]: Finished difference Result 349235 states and 1399140 transitions. [2019-12-27 05:43:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:43:16,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 05:43:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:18,264 INFO L225 Difference]: With dead ends: 349235 [2019-12-27 05:43:18,264 INFO L226 Difference]: Without dead ends: 349172 [2019-12-27 05:43:18,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:43:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349172 states. [2019-12-27 05:43:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349172 to 247992. [2019-12-27 05:43:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247992 states. [2019-12-27 05:43:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247992 states to 247992 states and 1014301 transitions. [2019-12-27 05:43:37,787 INFO L78 Accepts]: Start accepts. Automaton has 247992 states and 1014301 transitions. Word has length 19 [2019-12-27 05:43:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:37,788 INFO L462 AbstractCegarLoop]: Abstraction has 247992 states and 1014301 transitions. [2019-12-27 05:43:37,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:43:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 247992 states and 1014301 transitions. [2019-12-27 05:43:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 05:43:37,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:37,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:37,806 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:37,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:37,807 INFO L82 PathProgramCache]: Analyzing trace with hash 863573751, now seen corresponding path program 1 times [2019-12-27 05:43:37,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:37,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766597648] [2019-12-27 05:43:37,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:37,890 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 05:43:37,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766597648] [2019-12-27 05:43:37,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:37,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:43:37,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094297178] [2019-12-27 05:43:37,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:43:37,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:43:37,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:43:37,892 INFO L87 Difference]: Start difference. First operand 247992 states and 1014301 transitions. Second operand 4 states. [2019-12-27 05:43:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:38,085 INFO L93 Difference]: Finished difference Result 51369 states and 166947 transitions. [2019-12-27 05:43:38,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:43:38,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 05:43:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:38,159 INFO L225 Difference]: With dead ends: 51369 [2019-12-27 05:43:38,160 INFO L226 Difference]: Without dead ends: 45307 [2019-12-27 05:43:38,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:43:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45307 states. [2019-12-27 05:43:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45307 to 45307. [2019-12-27 05:43:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45307 states. [2019-12-27 05:43:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45307 states to 45307 states and 144919 transitions. [2019-12-27 05:43:40,470 INFO L78 Accepts]: Start accepts. Automaton has 45307 states and 144919 transitions. Word has length 19 [2019-12-27 05:43:40,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:40,470 INFO L462 AbstractCegarLoop]: Abstraction has 45307 states and 144919 transitions. [2019-12-27 05:43:40,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:43:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 45307 states and 144919 transitions. [2019-12-27 05:43:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:43:40,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:40,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:40,479 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 599047535, now seen corresponding path program 1 times [2019-12-27 05:43:40,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:40,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420489752] [2019-12-27 05:43:40,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:40,580 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 05:43:40,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420489752] [2019-12-27 05:43:40,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:40,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:43:40,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762165269] [2019-12-27 05:43:40,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:43:40,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:40,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:43:40,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:43:40,583 INFO L87 Difference]: Start difference. First operand 45307 states and 144919 transitions. Second operand 5 states. [2019-12-27 05:43:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:40,669 INFO L93 Difference]: Finished difference Result 10589 states and 28895 transitions. [2019-12-27 05:43:40,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:43:40,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 05:43:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:40,684 INFO L225 Difference]: With dead ends: 10589 [2019-12-27 05:43:40,684 INFO L226 Difference]: Without dead ends: 9225 [2019-12-27 05:43:40,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:43:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9225 states. [2019-12-27 05:43:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9225 to 9050. [2019-12-27 05:43:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9050 states. [2019-12-27 05:43:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9050 states to 9050 states and 24444 transitions. [2019-12-27 05:43:40,862 INFO L78 Accepts]: Start accepts. Automaton has 9050 states and 24444 transitions. Word has length 25 [2019-12-27 05:43:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:40,863 INFO L462 AbstractCegarLoop]: Abstraction has 9050 states and 24444 transitions. [2019-12-27 05:43:40,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:43:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 9050 states and 24444 transitions. [2019-12-27 05:43:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:43:40,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:40,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:40,877 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:40,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:40,878 INFO L82 PathProgramCache]: Analyzing trace with hash -646393868, now seen corresponding path program 1 times [2019-12-27 05:43:40,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:40,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853057613] [2019-12-27 05:43:40,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:41,039 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 05:43:41,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853057613] [2019-12-27 05:43:41,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:41,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:43:41,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515627649] [2019-12-27 05:43:41,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:43:41,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:41,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:43:41,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:43:41,041 INFO L87 Difference]: Start difference. First operand 9050 states and 24444 transitions. Second operand 5 states. [2019-12-27 05:43:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:41,426 INFO L93 Difference]: Finished difference Result 10995 states and 29072 transitions. [2019-12-27 05:43:41,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:43:41,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 05:43:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:41,442 INFO L225 Difference]: With dead ends: 10995 [2019-12-27 05:43:41,442 INFO L226 Difference]: Without dead ends: 10995 [2019-12-27 05:43:41,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:43:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10995 states. [2019-12-27 05:43:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10995 to 9339. [2019-12-27 05:43:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9339 states. [2019-12-27 05:43:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9339 states to 9339 states and 25166 transitions. [2019-12-27 05:43:41,569 INFO L78 Accepts]: Start accepts. Automaton has 9339 states and 25166 transitions. Word has length 37 [2019-12-27 05:43:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:41,569 INFO L462 AbstractCegarLoop]: Abstraction has 9339 states and 25166 transitions. [2019-12-27 05:43:41,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:43:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 9339 states and 25166 transitions. [2019-12-27 05:43:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:43:41,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:41,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:41,580 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1766908770, now seen corresponding path program 2 times [2019-12-27 05:43:41,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:41,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348382916] [2019-12-27 05:43:41,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:41,667 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 05:43:41,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348382916] [2019-12-27 05:43:41,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:41,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:43:41,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147834041] [2019-12-27 05:43:41,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:43:41,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:41,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:43:41,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:43:41,669 INFO L87 Difference]: Start difference. First operand 9339 states and 25166 transitions. Second operand 6 states. [2019-12-27 05:43:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:42,435 INFO L93 Difference]: Finished difference Result 10307 states and 27318 transitions. [2019-12-27 05:43:42,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:43:42,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 05:43:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:42,454 INFO L225 Difference]: With dead ends: 10307 [2019-12-27 05:43:42,455 INFO L226 Difference]: Without dead ends: 10307 [2019-12-27 05:43:42,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:43:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10307 states. [2019-12-27 05:43:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10307 to 8244. [2019-12-27 05:43:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8244 states. [2019-12-27 05:43:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8244 states to 8244 states and 22236 transitions. [2019-12-27 05:43:42,649 INFO L78 Accepts]: Start accepts. Automaton has 8244 states and 22236 transitions. Word has length 37 [2019-12-27 05:43:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:42,650 INFO L462 AbstractCegarLoop]: Abstraction has 8244 states and 22236 transitions. [2019-12-27 05:43:42,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:43:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 8244 states and 22236 transitions. [2019-12-27 05:43:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:43:42,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:42,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:42,665 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:42,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:42,665 INFO L82 PathProgramCache]: Analyzing trace with hash 557051732, now seen corresponding path program 1 times [2019-12-27 05:43:42,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:42,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318008769] [2019-12-27 05:43:42,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:42,742 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 05:43:42,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318008769] [2019-12-27 05:43:42,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:42,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:43:42,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300487975] [2019-12-27 05:43:42,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:43:42,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:42,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:43:42,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:43:42,745 INFO L87 Difference]: Start difference. First operand 8244 states and 22236 transitions. Second operand 3 states. [2019-12-27 05:43:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:42,812 INFO L93 Difference]: Finished difference Result 8861 states and 23656 transitions. [2019-12-27 05:43:42,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:43:42,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 05:43:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:42,825 INFO L225 Difference]: With dead ends: 8861 [2019-12-27 05:43:42,826 INFO L226 Difference]: Without dead ends: 8861 [2019-12-27 05:43:42,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:43:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8861 states. [2019-12-27 05:43:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8861 to 8607. [2019-12-27 05:43:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8607 states. [2019-12-27 05:43:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8607 states to 8607 states and 23137 transitions. [2019-12-27 05:43:42,955 INFO L78 Accepts]: Start accepts. Automaton has 8607 states and 23137 transitions. Word has length 51 [2019-12-27 05:43:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:42,955 INFO L462 AbstractCegarLoop]: Abstraction has 8607 states and 23137 transitions. [2019-12-27 05:43:42,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:43:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 8607 states and 23137 transitions. [2019-12-27 05:43:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:43:42,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:42,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:42,966 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:42,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 557170462, now seen corresponding path program 1 times [2019-12-27 05:43:42,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:42,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486939631] [2019-12-27 05:43:42,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:44,900 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 05:43:44,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486939631] [2019-12-27 05:43:44,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:44,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:43:44,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198986041] [2019-12-27 05:43:44,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:43:44,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:44,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:43:44,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:43:44,902 INFO L87 Difference]: Start difference. First operand 8607 states and 23137 transitions. Second operand 6 states. [2019-12-27 05:43:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:44,988 INFO L93 Difference]: Finished difference Result 5822 states and 16638 transitions. [2019-12-27 05:43:44,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:43:44,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 05:43:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:44,999 INFO L225 Difference]: With dead ends: 5822 [2019-12-27 05:43:44,999 INFO L226 Difference]: Without dead ends: 5739 [2019-12-27 05:43:44,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:43:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5739 states. [2019-12-27 05:43:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5739 to 5326. [2019-12-27 05:43:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5326 states. [2019-12-27 05:43:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 15356 transitions. [2019-12-27 05:43:45,080 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 15356 transitions. Word has length 51 [2019-12-27 05:43:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:45,080 INFO L462 AbstractCegarLoop]: Abstraction has 5326 states and 15356 transitions. [2019-12-27 05:43:45,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:43:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 15356 transitions. [2019-12-27 05:43:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:43:45,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:45,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:45,091 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash 624009926, now seen corresponding path program 1 times [2019-12-27 05:43:45,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:45,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499618493] [2019-12-27 05:43:45,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:45,183 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 05:43:45,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499618493] [2019-12-27 05:43:45,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:45,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:43:45,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886925602] [2019-12-27 05:43:45,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:43:45,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:45,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:43:45,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:43:45,186 INFO L87 Difference]: Start difference. First operand 5326 states and 15356 transitions. Second operand 5 states. [2019-12-27 05:43:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:45,491 INFO L93 Difference]: Finished difference Result 7819 states and 22329 transitions. [2019-12-27 05:43:45,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:43:45,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 05:43:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:45,502 INFO L225 Difference]: With dead ends: 7819 [2019-12-27 05:43:45,502 INFO L226 Difference]: Without dead ends: 7819 [2019-12-27 05:43:45,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:43:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2019-12-27 05:43:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 6920. [2019-12-27 05:43:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6920 states. [2019-12-27 05:43:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6920 states to 6920 states and 19850 transitions. [2019-12-27 05:43:45,606 INFO L78 Accepts]: Start accepts. Automaton has 6920 states and 19850 transitions. Word has length 65 [2019-12-27 05:43:45,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:45,606 INFO L462 AbstractCegarLoop]: Abstraction has 6920 states and 19850 transitions. [2019-12-27 05:43:45,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:43:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6920 states and 19850 transitions. [2019-12-27 05:43:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:43:45,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:45,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:45,615 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:45,615 INFO L82 PathProgramCache]: Analyzing trace with hash 946955186, now seen corresponding path program 2 times [2019-12-27 05:43:45,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:45,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077274087] [2019-12-27 05:43:45,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:45,706 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 05:43:45,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077274087] [2019-12-27 05:43:45,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:45,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:43:45,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759404583] [2019-12-27 05:43:45,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:43:45,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:45,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:43:45,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:43:45,709 INFO L87 Difference]: Start difference. First operand 6920 states and 19850 transitions. Second operand 6 states. [2019-12-27 05:43:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:46,215 INFO L93 Difference]: Finished difference Result 11634 states and 33228 transitions. [2019-12-27 05:43:46,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:43:46,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 05:43:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:46,230 INFO L225 Difference]: With dead ends: 11634 [2019-12-27 05:43:46,231 INFO L226 Difference]: Without dead ends: 11634 [2019-12-27 05:43:46,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:43:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2019-12-27 05:43:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 7934. [2019-12-27 05:43:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7934 states. [2019-12-27 05:43:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7934 states to 7934 states and 22824 transitions. [2019-12-27 05:43:46,367 INFO L78 Accepts]: Start accepts. Automaton has 7934 states and 22824 transitions. Word has length 65 [2019-12-27 05:43:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:46,367 INFO L462 AbstractCegarLoop]: Abstraction has 7934 states and 22824 transitions. [2019-12-27 05:43:46,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:43:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 7934 states and 22824 transitions. [2019-12-27 05:43:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:43:46,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:46,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:46,375 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:46,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:46,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1361750556, now seen corresponding path program 3 times [2019-12-27 05:43:46,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:46,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148760273] [2019-12-27 05:43:46,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:46,461 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 05:43:46,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148760273] [2019-12-27 05:43:46,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:46,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:43:46,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434128886] [2019-12-27 05:43:46,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:43:46,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:46,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:43:46,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:43:46,463 INFO L87 Difference]: Start difference. First operand 7934 states and 22824 transitions. Second operand 3 states. [2019-12-27 05:43:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:46,501 INFO L93 Difference]: Finished difference Result 6536 states and 18462 transitions. [2019-12-27 05:43:46,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:43:46,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:43:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:46,511 INFO L225 Difference]: With dead ends: 6536 [2019-12-27 05:43:46,511 INFO L226 Difference]: Without dead ends: 6536 [2019-12-27 05:43:46,511 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 05:43:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6536 states. [2019-12-27 05:43:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6536 to 6380. [2019-12-27 05:43:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6380 states. [2019-12-27 05:43:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 18032 transitions. [2019-12-27 05:43:46,646 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 18032 transitions. Word has length 65 [2019-12-27 05:43:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:46,647 INFO L462 AbstractCegarLoop]: Abstraction has 6380 states and 18032 transitions. [2019-12-27 05:43:46,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:43:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 18032 transitions. [2019-12-27 05:43:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:43:46,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:46,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:46,656 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:46,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2054835301, now seen corresponding path program 1 times [2019-12-27 05:43:46,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:46,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642612690] [2019-12-27 05:43:46,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:46,791 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 05:43:46,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642612690] [2019-12-27 05:43:46,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:46,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:43:46,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136200890] [2019-12-27 05:43:46,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:43:46,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:46,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:43:46,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:43:46,793 INFO L87 Difference]: Start difference. First operand 6380 states and 18032 transitions. Second operand 6 states. [2019-12-27 05:43:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:47,333 INFO L93 Difference]: Finished difference Result 8924 states and 24906 transitions. [2019-12-27 05:43:47,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 05:43:47,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 05:43:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:47,344 INFO L225 Difference]: With dead ends: 8924 [2019-12-27 05:43:47,344 INFO L226 Difference]: Without dead ends: 8924 [2019-12-27 05:43:47,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:43:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8924 states. [2019-12-27 05:43:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8924 to 7101. [2019-12-27 05:43:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7101 states. [2019-12-27 05:43:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7101 states to 7101 states and 20031 transitions. [2019-12-27 05:43:47,452 INFO L78 Accepts]: Start accepts. Automaton has 7101 states and 20031 transitions. Word has length 66 [2019-12-27 05:43:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:47,452 INFO L462 AbstractCegarLoop]: Abstraction has 7101 states and 20031 transitions. [2019-12-27 05:43:47,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:43:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7101 states and 20031 transitions. [2019-12-27 05:43:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:43:47,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:47,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:47,459 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:47,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:47,459 INFO L82 PathProgramCache]: Analyzing trace with hash -155123355, now seen corresponding path program 2 times [2019-12-27 05:43:47,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:47,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074639158] [2019-12-27 05:43:47,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:47,559 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 05:43:47,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074639158] [2019-12-27 05:43:47,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:47,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:43:47,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861453455] [2019-12-27 05:43:47,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:43:47,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:47,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:43:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:43:47,561 INFO L87 Difference]: Start difference. First operand 7101 states and 20031 transitions. Second operand 6 states. [2019-12-27 05:43:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:48,019 INFO L93 Difference]: Finished difference Result 10964 states and 30889 transitions. [2019-12-27 05:43:48,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:43:48,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 05:43:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:48,034 INFO L225 Difference]: With dead ends: 10964 [2019-12-27 05:43:48,035 INFO L226 Difference]: Without dead ends: 10964 [2019-12-27 05:43:48,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:43:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10964 states. [2019-12-27 05:43:48,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10964 to 7549. [2019-12-27 05:43:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7549 states. [2019-12-27 05:43:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7549 states to 7549 states and 21364 transitions. [2019-12-27 05:43:48,207 INFO L78 Accepts]: Start accepts. Automaton has 7549 states and 21364 transitions. Word has length 66 [2019-12-27 05:43:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:48,207 INFO L462 AbstractCegarLoop]: Abstraction has 7549 states and 21364 transitions. [2019-12-27 05:43:48,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:43:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 7549 states and 21364 transitions. [2019-12-27 05:43:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:43:48,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:48,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:48,215 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:48,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:48,215 INFO L82 PathProgramCache]: Analyzing trace with hash 60179339, now seen corresponding path program 3 times [2019-12-27 05:43:48,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:48,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314328620] [2019-12-27 05:43:48,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:48,285 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 05:43:48,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314328620] [2019-12-27 05:43:48,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:48,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:43:48,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416645810] [2019-12-27 05:43:48,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:43:48,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:48,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:43:48,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:43:48,287 INFO L87 Difference]: Start difference. First operand 7549 states and 21364 transitions. Second operand 3 states. [2019-12-27 05:43:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:48,346 INFO L93 Difference]: Finished difference Result 7549 states and 21363 transitions. [2019-12-27 05:43:48,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:43:48,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:43:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:48,357 INFO L225 Difference]: With dead ends: 7549 [2019-12-27 05:43:48,357 INFO L226 Difference]: Without dead ends: 7549 [2019-12-27 05:43:48,358 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 05:43:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7549 states. [2019-12-27 05:43:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7549 to 5672. [2019-12-27 05:43:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5672 states. [2019-12-27 05:43:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5672 states to 5672 states and 16148 transitions. [2019-12-27 05:43:48,457 INFO L78 Accepts]: Start accepts. Automaton has 5672 states and 16148 transitions. Word has length 66 [2019-12-27 05:43:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:48,457 INFO L462 AbstractCegarLoop]: Abstraction has 5672 states and 16148 transitions. [2019-12-27 05:43:48,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:43:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5672 states and 16148 transitions. [2019-12-27 05:43:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:43:48,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:48,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:48,463 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:48,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:48,464 INFO L82 PathProgramCache]: Analyzing trace with hash 657587798, now seen corresponding path program 1 times [2019-12-27 05:43:48,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:48,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303981146] [2019-12-27 05:43:48,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:48,551 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 05:43:48,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303981146] [2019-12-27 05:43:48,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:48,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:43:48,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907516730] [2019-12-27 05:43:48,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:43:48,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:48,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:43:48,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:43:48,553 INFO L87 Difference]: Start difference. First operand 5672 states and 16148 transitions. Second operand 6 states. [2019-12-27 05:43:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:48,626 INFO L93 Difference]: Finished difference Result 9768 states and 27796 transitions. [2019-12-27 05:43:48,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:43:48,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 05:43:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:48,633 INFO L225 Difference]: With dead ends: 9768 [2019-12-27 05:43:48,633 INFO L226 Difference]: Without dead ends: 4478 [2019-12-27 05:43:48,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:43:48,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-12-27 05:43:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 4478. [2019-12-27 05:43:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4478 states. [2019-12-27 05:43:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 12695 transitions. [2019-12-27 05:43:48,732 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 12695 transitions. Word has length 67 [2019-12-27 05:43:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:48,733 INFO L462 AbstractCegarLoop]: Abstraction has 4478 states and 12695 transitions. [2019-12-27 05:43:48,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:43:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 12695 transitions. [2019-12-27 05:43:48,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:43:48,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:48,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:48,739 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:48,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1675709448, now seen corresponding path program 2 times [2019-12-27 05:43:48,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:48,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114111283] [2019-12-27 05:43:48,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:48,816 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 05:43:48,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114111283] [2019-12-27 05:43:48,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:48,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:43:48,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266776547] [2019-12-27 05:43:48,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:43:48,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:48,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:43:48,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:43:48,818 INFO L87 Difference]: Start difference. First operand 4478 states and 12695 transitions. Second operand 6 states. [2019-12-27 05:43:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:49,343 INFO L93 Difference]: Finished difference Result 7470 states and 20847 transitions. [2019-12-27 05:43:49,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 05:43:49,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 05:43:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:49,354 INFO L225 Difference]: With dead ends: 7470 [2019-12-27 05:43:49,355 INFO L226 Difference]: Without dead ends: 7470 [2019-12-27 05:43:49,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:43:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2019-12-27 05:43:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 4484. [2019-12-27 05:43:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-12-27 05:43:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 12712 transitions. [2019-12-27 05:43:49,442 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 12712 transitions. Word has length 67 [2019-12-27 05:43:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:49,442 INFO L462 AbstractCegarLoop]: Abstraction has 4484 states and 12712 transitions. [2019-12-27 05:43:49,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:43:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 12712 transitions. [2019-12-27 05:43:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:43:49,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:49,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:49,448 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1956990500, now seen corresponding path program 3 times [2019-12-27 05:43:49,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:49,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415262290] [2019-12-27 05:43:49,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:49,499 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 05:43:49,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415262290] [2019-12-27 05:43:49,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:49,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:43:49,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388389891] [2019-12-27 05:43:49,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:43:49,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:49,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:43:49,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:43:49,501 INFO L87 Difference]: Start difference. First operand 4484 states and 12712 transitions. Second operand 3 states. [2019-12-27 05:43:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:49,524 INFO L93 Difference]: Finished difference Result 4057 states and 11230 transitions. [2019-12-27 05:43:49,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:43:49,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 05:43:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:49,530 INFO L225 Difference]: With dead ends: 4057 [2019-12-27 05:43:49,530 INFO L226 Difference]: Without dead ends: 4057 [2019-12-27 05:43:49,531 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 05:43:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states. [2019-12-27 05:43:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 3901. [2019-12-27 05:43:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2019-12-27 05:43:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 10814 transitions. [2019-12-27 05:43:49,608 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 10814 transitions. Word has length 67 [2019-12-27 05:43:49,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:49,608 INFO L462 AbstractCegarLoop]: Abstraction has 3901 states and 10814 transitions. [2019-12-27 05:43:49,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:43:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 10814 transitions. [2019-12-27 05:43:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 05:43:49,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:49,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:49,613 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:49,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:49,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2040170996, now seen corresponding path program 1 times [2019-12-27 05:43:49,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:49,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948796321] [2019-12-27 05:43:49,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:49,825 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 05:43:49,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948796321] [2019-12-27 05:43:49,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:49,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:43:49,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990018292] [2019-12-27 05:43:49,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:43:49,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:49,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:43:49,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:43:49,832 INFO L87 Difference]: Start difference. First operand 3901 states and 10814 transitions. Second operand 12 states. [2019-12-27 05:43:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:50,320 INFO L93 Difference]: Finished difference Result 7783 states and 21556 transitions. [2019-12-27 05:43:50,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 05:43:50,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-27 05:43:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:50,331 INFO L225 Difference]: With dead ends: 7783 [2019-12-27 05:43:50,332 INFO L226 Difference]: Without dead ends: 7269 [2019-12-27 05:43:50,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:43:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2019-12-27 05:43:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 4897. [2019-12-27 05:43:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4897 states. [2019-12-27 05:43:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 13487 transitions. [2019-12-27 05:43:50,443 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 13487 transitions. Word has length 68 [2019-12-27 05:43:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:50,443 INFO L462 AbstractCegarLoop]: Abstraction has 4897 states and 13487 transitions. [2019-12-27 05:43:50,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:43:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 13487 transitions. [2019-12-27 05:43:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 05:43:50,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:50,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:50,448 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash 966783114, now seen corresponding path program 2 times [2019-12-27 05:43:50,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:50,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891820815] [2019-12-27 05:43:50,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:50,674 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 05:43:50,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891820815] [2019-12-27 05:43:50,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:50,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:43:50,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905719758] [2019-12-27 05:43:50,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:43:50,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:50,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:43:50,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:43:50,677 INFO L87 Difference]: Start difference. First operand 4897 states and 13487 transitions. Second operand 12 states. [2019-12-27 05:43:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:51,247 INFO L93 Difference]: Finished difference Result 9006 states and 24868 transitions. [2019-12-27 05:43:51,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 05:43:51,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-27 05:43:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:51,264 INFO L225 Difference]: With dead ends: 9006 [2019-12-27 05:43:51,264 INFO L226 Difference]: Without dead ends: 8324 [2019-12-27 05:43:51,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:43:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8324 states. [2019-12-27 05:43:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8324 to 5513. [2019-12-27 05:43:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5513 states. [2019-12-27 05:43:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5513 states to 5513 states and 15237 transitions. [2019-12-27 05:43:51,509 INFO L78 Accepts]: Start accepts. Automaton has 5513 states and 15237 transitions. Word has length 68 [2019-12-27 05:43:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:51,510 INFO L462 AbstractCegarLoop]: Abstraction has 5513 states and 15237 transitions. [2019-12-27 05:43:51,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:43:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 5513 states and 15237 transitions. [2019-12-27 05:43:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 05:43:51,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:51,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:51,520 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:51,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:51,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1590070474, now seen corresponding path program 3 times [2019-12-27 05:43:51,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:51,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371553834] [2019-12-27 05:43:51,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:43:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:43:51,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371553834] [2019-12-27 05:43:51,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:43:51,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 05:43:51,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014988312] [2019-12-27 05:43:51,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 05:43:51,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:43:51,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 05:43:51,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:43:51,846 INFO L87 Difference]: Start difference. First operand 5513 states and 15237 transitions. Second operand 14 states. [2019-12-27 05:43:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:43:53,182 INFO L93 Difference]: Finished difference Result 10800 states and 29912 transitions. [2019-12-27 05:43:53,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:43:53,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 05:43:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:43:53,196 INFO L225 Difference]: With dead ends: 10800 [2019-12-27 05:43:53,196 INFO L226 Difference]: Without dead ends: 10286 [2019-12-27 05:43:53,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:43:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-12-27 05:43:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 6345. [2019-12-27 05:43:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-27 05:43:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 17639 transitions. [2019-12-27 05:43:53,312 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 17639 transitions. Word has length 68 [2019-12-27 05:43:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:43:53,312 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 17639 transitions. [2019-12-27 05:43:53,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 05:43:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 17639 transitions. [2019-12-27 05:43:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 05:43:53,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:43:53,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:43:53,321 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:43:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:43:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash 414874314, now seen corresponding path program 4 times [2019-12-27 05:43:53,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:43:53,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084391369] [2019-12-27 05:43:53,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:43:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2019-12-27 05:43:53,552 WARN L209 SmtUtils]: Removed 1 from assertion stack [2019-12-27 05:43:53,553 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 05:43:53,556 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 05:43:53,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:43:53 BasicIcfg [2019-12-27 05:43:53,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:43:53,557 INFO L168 Benchmark]: Toolchain (without parser) took 194343.56 ms. Allocated memory was 145.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.3 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 750.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:43:53,558 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 05:43:53,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.01 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 100.1 MB in the beginning and 155.6 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:43:53,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.27 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 05:43:53,559 INFO L168 Benchmark]: Boogie Preprocessor took 40.42 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:43:53,560 INFO L168 Benchmark]: RCFGBuilder took 854.10 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 99.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:43:53,560 INFO L168 Benchmark]: TraceAbstraction took 192619.86 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.8 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 692.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:43:53,563 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.56 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.01 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 100.1 MB in the beginning and 155.6 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.27 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.42 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.10 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 99.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192619.86 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.8 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 692.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 5894 VarBasedMoverChecksPositive, 186 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 93012 CheckedPairsTotal, 112 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 25 for 10ms.. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 69 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 25 for 10ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: TIMEOUT, OverallTime: 192.4s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 56.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4078 SDtfs, 4072 SDslu, 9684 SDs, 0 SdLazy, 5610 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 48 SyntacticMatches, 21 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247992occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 102.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 302883 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1098 NumberOfCodeBlocks, 1098 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 207321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown