/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-17 22:47:51,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-17 22:47:51,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-17 22:47:51,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-17 22:47:51,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-17 22:47:51,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-17 22:47:51,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-17 22:47:51,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-17 22:47:51,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-17 22:47:51,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-17 22:47:51,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-17 22:47:51,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-17 22:47:51,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-17 22:47:51,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-17 22:47:51,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-17 22:47:51,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-17 22:47:51,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-17 22:47:51,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-17 22:47:51,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-17 22:47:51,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-17 22:47:51,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-17 22:47:51,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-17 22:47:51,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-17 22:47:51,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-17 22:47:51,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-17 22:47:51,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-17 22:47:51,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-17 22:47:51,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-17 22:47:51,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-17 22:47:51,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-17 22:47:51,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-17 22:47:51,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-17 22:47:51,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-17 22:47:51,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-17 22:47:51,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-17 22:47:51,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-17 22:47:51,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-17 22:47:51,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-17 22:47:51,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-17 22:47:51,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-17 22:47:51,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-17 22:47:51,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-04-17 22:47:51,934 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-17 22:47:51,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-17 22:47:51,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-17 22:47:51,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-17 22:47:51,936 INFO L138 SettingsManager]: * Use SBE=true [2020-04-17 22:47:51,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-17 22:47:51,936 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-17 22:47:51,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-17 22:47:51,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-17 22:47:51,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-17 22:47:51,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-17 22:47:51,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-17 22:47:51,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-17 22:47:51,938 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-17 22:47:51,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-17 22:47:51,938 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-17 22:47:51,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-17 22:47:51,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-17 22:47:51,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-17 22:47:51,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-17 22:47:51,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-17 22:47:51,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-17 22:47:51,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-17 22:47:51,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-17 22:47:51,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-17 22:47:51,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-04-17 22:47:51,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-17 22:47:51,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-17 22:47:51,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-17 22:47:52,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-17 22:47:52,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-17 22:47:52,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-17 22:47:52,238 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-17 22:47:52,238 INFO L275 PluginConnector]: CDTParser initialized [2020-04-17 22:47:52,242 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2020-04-17 22:47:52,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd3c9e3d6/68970b9b7412401d906f9c2eaec4ea76/FLAG420d58196 [2020-04-17 22:47:52,870 INFO L306 CDTParser]: Found 1 translation units. [2020-04-17 22:47:52,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2020-04-17 22:47:52,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd3c9e3d6/68970b9b7412401d906f9c2eaec4ea76/FLAG420d58196 [2020-04-17 22:47:53,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd3c9e3d6/68970b9b7412401d906f9c2eaec4ea76 [2020-04-17 22:47:53,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-17 22:47:53,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-17 22:47:53,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-17 22:47:53,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-17 22:47:53,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-17 22:47:53,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.04 10:47:53" (1/1) ... [2020-04-17 22:47:53,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1953b11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:53, skipping insertion in model container [2020-04-17 22:47:53,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.04 10:47:53" (1/1) ... [2020-04-17 22:47:53,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-17 22:47:53,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-17 22:47:53,432 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-17 22:47:53,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-17 22:47:53,875 INFO L203 MainTranslator]: Completed pre-run [2020-04-17 22:47:53,890 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-17 22:47:53,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-17 22:47:54,080 INFO L208 MainTranslator]: Completed translation [2020-04-17 22:47:54,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54 WrapperNode [2020-04-17 22:47:54,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-17 22:47:54,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-17 22:47:54,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-17 22:47:54,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-17 22:47:54,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (1/1) ... [2020-04-17 22:47:54,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (1/1) ... [2020-04-17 22:47:54,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-17 22:47:54,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-17 22:47:54,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-17 22:47:54,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-17 22:47:54,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (1/1) ... [2020-04-17 22:47:54,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (1/1) ... [2020-04-17 22:47:54,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (1/1) ... [2020-04-17 22:47:54,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (1/1) ... [2020-04-17 22:47:54,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (1/1) ... [2020-04-17 22:47:54,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (1/1) ... [2020-04-17 22:47:54,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (1/1) ... [2020-04-17 22:47:54,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-17 22:47:54,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-17 22:47:54,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-17 22:47:54,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-17 22:47:54,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (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 [2020-04-17 22:47:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2020-04-17 22:47:54,347 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2020-04-17 22:47:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-17 22:47:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-04-17 22:47:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-17 22:47:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-17 22:47:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-17 22:47:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-04-17 22:47:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-04-17 22:47:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-17 22:47:54,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-17 22:47:54,351 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-17 22:47:55,399 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-17 22:47:55,400 INFO L295 CfgBuilder]: Removed 40 assume(true) statements. [2020-04-17 22:47:55,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.04 10:47:55 BoogieIcfgContainer [2020-04-17 22:47:55,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-17 22:47:55,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-17 22:47:55,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-17 22:47:55,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-17 22:47:55,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.04 10:47:53" (1/3) ... [2020-04-17 22:47:55,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fcf915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.04 10:47:55, skipping insertion in model container [2020-04-17 22:47:55,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:47:54" (2/3) ... [2020-04-17 22:47:55,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fcf915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.04 10:47:55, skipping insertion in model container [2020-04-17 22:47:55,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.04 10:47:55" (3/3) ... [2020-04-17 22:47:55,427 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2020-04-17 22:47:55,439 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-17 22:47:55,440 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-17 22:47:55,453 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-04-17 22:47:55,454 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-17 22:47:55,535 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,535 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,536 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,536 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,537 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,537 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,537 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,537 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,538 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,538 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,538 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,538 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,539 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,539 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,539 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,539 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,539 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,540 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,540 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,541 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,541 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,541 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,542 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,542 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,542 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,542 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,543 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,543 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,543 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,544 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,545 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,545 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,545 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,545 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,545 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,545 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,546 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,547 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,547 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,547 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,547 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,548 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,548 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,548 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,549 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,549 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,549 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,549 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,549 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,550 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,550 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,550 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,550 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,550 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,551 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,551 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,551 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,551 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,551 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,552 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,552 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,552 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,552 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,552 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,553 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,553 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,553 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,554 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,554 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,554 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,554 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,554 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,554 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,554 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,555 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,555 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,555 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,555 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,555 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,556 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,556 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,557 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,557 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,557 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,557 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,557 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,558 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,559 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,560 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,561 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,561 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,561 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,562 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,562 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,562 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,563 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,563 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,563 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,564 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,564 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,564 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,565 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,566 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,569 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,569 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,569 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,570 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,576 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,576 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,576 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,577 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,577 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,577 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,577 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,577 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,577 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,577 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,578 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,578 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,579 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,579 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,579 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,579 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,579 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,579 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,580 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,580 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,580 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,580 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,580 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,580 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,581 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,581 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,581 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,581 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,581 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,581 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,582 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,582 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,582 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,582 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,582 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,582 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,583 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,583 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,583 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,583 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,583 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,583 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,583 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,584 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,584 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,584 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,584 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,584 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,584 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,585 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,585 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,585 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,585 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,585 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,585 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,586 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,586 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,586 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,586 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,586 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,586 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,586 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,587 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,587 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,588 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,589 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,589 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,589 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,589 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,589 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,589 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,590 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,590 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,590 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,590 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,590 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,590 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,591 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,591 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,591 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,591 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,591 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,591 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,595 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,596 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,596 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,596 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,596 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,596 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,597 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,597 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,597 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,597 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,597 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,597 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,598 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,598 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,598 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,598 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,598 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,598 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,599 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,599 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,599 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,599 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,599 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,599 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,600 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,600 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,600 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,600 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,601 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,605 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,605 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,605 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,606 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,606 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,606 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,606 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,606 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,606 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,607 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,608 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,611 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,611 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,612 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,612 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:47:55,637 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-04-17 22:47:55,658 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-17 22:47:55,658 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-17 22:47:55,659 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-17 22:47:55,659 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-17 22:47:55,659 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-17 22:47:55,659 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-17 22:47:55,659 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-17 22:47:55,659 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-17 22:47:55,687 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 443 transitions, 894 flow [2020-04-17 22:47:55,689 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions, 894 flow [2020-04-17 22:47:55,863 INFO L129 PetriNetUnfolder]: 32/442 cut-off events. [2020-04-17 22:47:55,864 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-04-17 22:47:55,877 INFO L80 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 32/442 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1074 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2020-04-17 22:47:55,907 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions, 894 flow [2020-04-17 22:47:56,024 INFO L129 PetriNetUnfolder]: 32/442 cut-off events. [2020-04-17 22:47:56,024 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-04-17 22:47:56,030 INFO L80 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 32/442 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1074 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2020-04-17 22:47:56,061 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 30326 [2020-04-17 22:47:56,062 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-17 22:47:57,579 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:57,595 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:47:57,596 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:57,597 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2020-04-17 22:47:58,049 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:58,067 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:47:58,068 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:47:58,068 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2020-04-17 22:48:00,451 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:00,466 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:00,467 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:00,467 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2020-04-17 22:48:06,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:48:06,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:48:06,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:48:07,831 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2020-04-17 22:48:08,128 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-04-17 22:48:08,367 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2020-04-17 22:48:08,586 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2020-04-17 22:48:08,893 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-04-17 22:48:09,038 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2020-04-17 22:48:10,886 WARN L192 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 153 DAG size of output: 141 [2020-04-17 22:48:10,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:48:10,918 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:10,928 INFO L539 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:13,218 WARN L192 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 133 [2020-04-17 22:48:13,218 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:13,220 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2020-04-17 22:48:13,220 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:559, output treesize:577 [2020-04-17 22:48:15,493 WARN L192 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 137 [2020-04-17 22:48:17,256 WARN L192 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 159 DAG size of output: 135 [2020-04-17 22:48:17,649 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-04-17 22:48:19,766 WARN L192 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 171 DAG size of output: 165 [2020-04-17 22:48:19,780 INFO L539 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:20,563 WARN L192 SmtUtils]: Spent 781.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-04-17 22:48:20,563 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-17 22:48:20,564 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-04-17 22:48:20,564 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2020-04-17 22:48:21,344 WARN L192 SmtUtils]: Spent 779.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-04-17 22:48:21,874 INFO L206 etLargeBlockEncoding]: Checked pairs total: 106197 [2020-04-17 22:48:21,874 INFO L214 etLargeBlockEncoding]: Total number of compositions: 459 [2020-04-17 22:48:21,878 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 121 transitions, 250 flow [2020-04-17 22:48:21,935 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1414 states. [2020-04-17 22:48:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states. [2020-04-17 22:48:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-17 22:48:21,943 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:21,945 INFO L425 BasicCegarLoop]: trace histogram [1] [2020-04-17 22:48:21,946 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:21,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:21,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1582, now seen corresponding path program 1 times [2020-04-17 22:48:21,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:21,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391025892] [2020-04-17 22:48:21,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:22,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391025892] [2020-04-17 22:48:22,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:22,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-04-17 22:48:22,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087505021] [2020-04-17 22:48:22,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-17 22:48:22,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:22,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-17 22:48:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-17 22:48:22,124 INFO L87 Difference]: Start difference. First operand 1414 states. Second operand 2 states. [2020-04-17 22:48:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:22,185 INFO L93 Difference]: Finished difference Result 1413 states and 3158 transitions. [2020-04-17 22:48:22,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-17 22:48:22,187 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-04-17 22:48:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:22,222 INFO L225 Difference]: With dead ends: 1413 [2020-04-17 22:48:22,222 INFO L226 Difference]: Without dead ends: 1412 [2020-04-17 22:48:22,223 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-17 22:48:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-04-17 22:48:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2020-04-17 22:48:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2020-04-17 22:48:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3157 transitions. [2020-04-17 22:48:22,371 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3157 transitions. Word has length 1 [2020-04-17 22:48:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:22,371 INFO L479 AbstractCegarLoop]: Abstraction has 1412 states and 3157 transitions. [2020-04-17 22:48:22,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-17 22:48:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3157 transitions. [2020-04-17 22:48:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-04-17 22:48:22,372 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:22,373 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-04-17 22:48:22,373 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash -936407040, now seen corresponding path program 1 times [2020-04-17 22:48:22,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:22,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199117720] [2020-04-17 22:48:22,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:22,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199117720] [2020-04-17 22:48:22,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:22,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-17 22:48:22,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415773580] [2020-04-17 22:48:22,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-17 22:48:22,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-17 22:48:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-17 22:48:22,527 INFO L87 Difference]: Start difference. First operand 1412 states and 3157 transitions. Second operand 3 states. [2020-04-17 22:48:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:22,620 INFO L93 Difference]: Finished difference Result 2647 states and 5928 transitions. [2020-04-17 22:48:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-17 22:48:22,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-04-17 22:48:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:22,641 INFO L225 Difference]: With dead ends: 2647 [2020-04-17 22:48:22,642 INFO L226 Difference]: Without dead ends: 2647 [2020-04-17 22:48:22,643 INFO L678 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 [2020-04-17 22:48:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2020-04-17 22:48:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1431. [2020-04-17 22:48:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2020-04-17 22:48:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3197 transitions. [2020-04-17 22:48:22,702 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3197 transitions. Word has length 6 [2020-04-17 22:48:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:22,703 INFO L479 AbstractCegarLoop]: Abstraction has 1431 states and 3197 transitions. [2020-04-17 22:48:22,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-17 22:48:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3197 transitions. [2020-04-17 22:48:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-17 22:48:22,705 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:22,705 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:22,705 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1033817622, now seen corresponding path program 1 times [2020-04-17 22:48:22,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:22,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418582921] [2020-04-17 22:48:22,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:22,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418582921] [2020-04-17 22:48:22,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:22,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-17 22:48:22,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541910873] [2020-04-17 22:48:22,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-17 22:48:22,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:22,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-17 22:48:22,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-17 22:48:22,813 INFO L87 Difference]: Start difference. First operand 1431 states and 3197 transitions. Second operand 3 states. [2020-04-17 22:48:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:22,830 INFO L93 Difference]: Finished difference Result 1431 states and 3178 transitions. [2020-04-17 22:48:22,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-17 22:48:22,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-04-17 22:48:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:22,839 INFO L225 Difference]: With dead ends: 1431 [2020-04-17 22:48:22,839 INFO L226 Difference]: Without dead ends: 1431 [2020-04-17 22:48:22,840 INFO L678 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 [2020-04-17 22:48:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-04-17 22:48:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2020-04-17 22:48:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2020-04-17 22:48:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3178 transitions. [2020-04-17 22:48:22,956 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3178 transitions. Word has length 7 [2020-04-17 22:48:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:22,957 INFO L479 AbstractCegarLoop]: Abstraction has 1431 states and 3178 transitions. [2020-04-17 22:48:22,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-17 22:48:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3178 transitions. [2020-04-17 22:48:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-17 22:48:22,959 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:22,959 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:22,959 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1989177922, now seen corresponding path program 1 times [2020-04-17 22:48:22,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:22,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794339232] [2020-04-17 22:48:22,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:23,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794339232] [2020-04-17 22:48:23,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:23,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-17 22:48:23,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229134008] [2020-04-17 22:48:23,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-17 22:48:23,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:23,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-17 22:48:23,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-17 22:48:23,140 INFO L87 Difference]: Start difference. First operand 1431 states and 3178 transitions. Second operand 6 states. [2020-04-17 22:48:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:23,761 INFO L93 Difference]: Finished difference Result 1817 states and 4039 transitions. [2020-04-17 22:48:23,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-17 22:48:23,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-04-17 22:48:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:23,773 INFO L225 Difference]: With dead ends: 1817 [2020-04-17 22:48:23,773 INFO L226 Difference]: Without dead ends: 1817 [2020-04-17 22:48:23,773 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-04-17 22:48:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2020-04-17 22:48:23,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1538. [2020-04-17 22:48:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2020-04-17 22:48:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 3423 transitions. [2020-04-17 22:48:23,816 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 3423 transitions. Word has length 8 [2020-04-17 22:48:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:23,817 INFO L479 AbstractCegarLoop]: Abstraction has 1538 states and 3423 transitions. [2020-04-17 22:48:23,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-17 22:48:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 3423 transitions. [2020-04-17 22:48:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-17 22:48:23,819 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:23,819 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:23,819 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 339945620, now seen corresponding path program 1 times [2020-04-17 22:48:23,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:23,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907112930] [2020-04-17 22:48:23,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:23,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907112930] [2020-04-17 22:48:23,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:23,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-17 22:48:23,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407038770] [2020-04-17 22:48:23,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-17 22:48:23,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:23,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-17 22:48:23,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-17 22:48:23,899 INFO L87 Difference]: Start difference. First operand 1538 states and 3423 transitions. Second operand 3 states. [2020-04-17 22:48:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:23,964 INFO L93 Difference]: Finished difference Result 2508 states and 5570 transitions. [2020-04-17 22:48:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-17 22:48:23,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-04-17 22:48:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:23,978 INFO L225 Difference]: With dead ends: 2508 [2020-04-17 22:48:23,979 INFO L226 Difference]: Without dead ends: 2508 [2020-04-17 22:48:23,979 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-17 22:48:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2020-04-17 22:48:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1595. [2020-04-17 22:48:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2020-04-17 22:48:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3543 transitions. [2020-04-17 22:48:24,031 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3543 transitions. Word has length 10 [2020-04-17 22:48:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:24,032 INFO L479 AbstractCegarLoop]: Abstraction has 1595 states and 3543 transitions. [2020-04-17 22:48:24,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-17 22:48:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3543 transitions. [2020-04-17 22:48:24,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-17 22:48:24,039 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:24,039 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:24,039 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:24,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:24,040 INFO L82 PathProgramCache]: Analyzing trace with hash 801389952, now seen corresponding path program 1 times [2020-04-17 22:48:24,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:24,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75643573] [2020-04-17 22:48:24,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:24,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75643573] [2020-04-17 22:48:24,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:24,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-17 22:48:24,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736174871] [2020-04-17 22:48:24,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-17 22:48:24,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:24,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-17 22:48:24,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-04-17 22:48:24,184 INFO L87 Difference]: Start difference. First operand 1595 states and 3543 transitions. Second operand 8 states. [2020-04-17 22:48:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:25,312 INFO L93 Difference]: Finished difference Result 1987 states and 4399 transitions. [2020-04-17 22:48:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-04-17 22:48:25,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-04-17 22:48:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:25,325 INFO L225 Difference]: With dead ends: 1987 [2020-04-17 22:48:25,325 INFO L226 Difference]: Without dead ends: 1987 [2020-04-17 22:48:25,326 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:48:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2020-04-17 22:48:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1609. [2020-04-17 22:48:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2020-04-17 22:48:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3575 transitions. [2020-04-17 22:48:25,369 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3575 transitions. Word has length 14 [2020-04-17 22:48:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:25,371 INFO L479 AbstractCegarLoop]: Abstraction has 1609 states and 3575 transitions. [2020-04-17 22:48:25,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-17 22:48:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3575 transitions. [2020-04-17 22:48:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-17 22:48:25,372 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:25,372 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:25,372 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:25,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1825561204, now seen corresponding path program 2 times [2020-04-17 22:48:25,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:25,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052852703] [2020-04-17 22:48:25,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:25,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052852703] [2020-04-17 22:48:25,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:25,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-17 22:48:25,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965222058] [2020-04-17 22:48:25,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-17 22:48:25,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:25,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-17 22:48:25,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-04-17 22:48:25,559 INFO L87 Difference]: Start difference. First operand 1609 states and 3575 transitions. Second operand 11 states. [2020-04-17 22:48:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:27,471 INFO L93 Difference]: Finished difference Result 2023 states and 4477 transitions. [2020-04-17 22:48:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:48:27,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-04-17 22:48:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:27,483 INFO L225 Difference]: With dead ends: 2023 [2020-04-17 22:48:27,484 INFO L226 Difference]: Without dead ends: 2023 [2020-04-17 22:48:27,484 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:48:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2020-04-17 22:48:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1611. [2020-04-17 22:48:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2020-04-17 22:48:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 3579 transitions. [2020-04-17 22:48:27,525 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 3579 transitions. Word has length 14 [2020-04-17 22:48:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:27,526 INFO L479 AbstractCegarLoop]: Abstraction has 1611 states and 3579 transitions. [2020-04-17 22:48:27,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-17 22:48:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 3579 transitions. [2020-04-17 22:48:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-17 22:48:27,527 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:27,527 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:27,527 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:27,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1831581956, now seen corresponding path program 3 times [2020-04-17 22:48:27,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:27,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223766919] [2020-04-17 22:48:27,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:27,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223766919] [2020-04-17 22:48:27,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:27,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-17 22:48:27,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614955959] [2020-04-17 22:48:27,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-17 22:48:27,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:27,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-17 22:48:27,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-04-17 22:48:27,677 INFO L87 Difference]: Start difference. First operand 1611 states and 3579 transitions. Second operand 11 states. [2020-04-17 22:48:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:30,022 INFO L93 Difference]: Finished difference Result 2052 states and 4538 transitions. [2020-04-17 22:48:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-17 22:48:30,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-04-17 22:48:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:30,034 INFO L225 Difference]: With dead ends: 2052 [2020-04-17 22:48:30,034 INFO L226 Difference]: Without dead ends: 2052 [2020-04-17 22:48:30,035 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2020-04-17 22:48:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2020-04-17 22:48:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1604. [2020-04-17 22:48:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2020-04-17 22:48:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3563 transitions. [2020-04-17 22:48:30,074 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3563 transitions. Word has length 14 [2020-04-17 22:48:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:30,074 INFO L479 AbstractCegarLoop]: Abstraction has 1604 states and 3563 transitions. [2020-04-17 22:48:30,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-17 22:48:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3563 transitions. [2020-04-17 22:48:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-17 22:48:30,075 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:30,075 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:30,076 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1112722442, now seen corresponding path program 1 times [2020-04-17 22:48:30,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:30,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945516930] [2020-04-17 22:48:30,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:30,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945516930] [2020-04-17 22:48:30,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:30,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-17 22:48:30,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591382594] [2020-04-17 22:48:30,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-17 22:48:30,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:30,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-17 22:48:30,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-17 22:48:30,232 INFO L87 Difference]: Start difference. First operand 1604 states and 3563 transitions. Second operand 8 states. [2020-04-17 22:48:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:31,363 INFO L93 Difference]: Finished difference Result 2382 states and 5288 transitions. [2020-04-17 22:48:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-04-17 22:48:31,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-04-17 22:48:31,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:31,376 INFO L225 Difference]: With dead ends: 2382 [2020-04-17 22:48:31,376 INFO L226 Difference]: Without dead ends: 2345 [2020-04-17 22:48:31,376 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:48:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2020-04-17 22:48:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1762. [2020-04-17 22:48:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-04-17 22:48:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 3963 transitions. [2020-04-17 22:48:31,429 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 3963 transitions. Word has length 14 [2020-04-17 22:48:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:31,430 INFO L479 AbstractCegarLoop]: Abstraction has 1762 states and 3963 transitions. [2020-04-17 22:48:31,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-17 22:48:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 3963 transitions. [2020-04-17 22:48:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:48:31,431 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:31,432 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:31,432 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:31,432 INFO L82 PathProgramCache]: Analyzing trace with hash 19280512, now seen corresponding path program 1 times [2020-04-17 22:48:31,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:31,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640391176] [2020-04-17 22:48:31,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:31,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:31,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640391176] [2020-04-17 22:48:31,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:31,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-17 22:48:31,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336923260] [2020-04-17 22:48:31,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-17 22:48:31,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:31,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-17 22:48:31,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-17 22:48:31,619 INFO L87 Difference]: Start difference. First operand 1762 states and 3963 transitions. Second operand 7 states. [2020-04-17 22:48:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:32,613 INFO L93 Difference]: Finished difference Result 2376 states and 5313 transitions. [2020-04-17 22:48:32,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-17 22:48:32,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-04-17 22:48:32,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:32,625 INFO L225 Difference]: With dead ends: 2376 [2020-04-17 22:48:32,625 INFO L226 Difference]: Without dead ends: 2376 [2020-04-17 22:48:32,626 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-04-17 22:48:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2020-04-17 22:48:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1843. [2020-04-17 22:48:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2020-04-17 22:48:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 4143 transitions. [2020-04-17 22:48:32,671 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 4143 transitions. Word has length 15 [2020-04-17 22:48:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:32,672 INFO L479 AbstractCegarLoop]: Abstraction has 1843 states and 4143 transitions. [2020-04-17 22:48:32,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-17 22:48:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 4143 transitions. [2020-04-17 22:48:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:48:32,676 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:32,676 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:32,676 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:32,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:32,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1220177490, now seen corresponding path program 2 times [2020-04-17 22:48:32,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:32,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862588586] [2020-04-17 22:48:32,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:33,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862588586] [2020-04-17 22:48:33,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:33,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:48:33,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494720192] [2020-04-17 22:48:33,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:48:33,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:33,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:48:33,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:48:33,135 INFO L87 Difference]: Start difference. First operand 1843 states and 4143 transitions. Second operand 14 states. [2020-04-17 22:48:35,205 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-04-17 22:48:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:37,587 INFO L93 Difference]: Finished difference Result 2692 states and 6004 transitions. [2020-04-17 22:48:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-04-17 22:48:37,587 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:48:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:37,595 INFO L225 Difference]: With dead ends: 2692 [2020-04-17 22:48:37,595 INFO L226 Difference]: Without dead ends: 2692 [2020-04-17 22:48:37,596 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=347, Invalid=775, Unknown=0, NotChecked=0, Total=1122 [2020-04-17 22:48:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2020-04-17 22:48:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 1903. [2020-04-17 22:48:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2020-04-17 22:48:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4284 transitions. [2020-04-17 22:48:37,638 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4284 transitions. Word has length 15 [2020-04-17 22:48:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:37,639 INFO L479 AbstractCegarLoop]: Abstraction has 1903 states and 4284 transitions. [2020-04-17 22:48:37,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:48:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4284 transitions. [2020-04-17 22:48:37,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:48:37,640 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:37,640 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:37,640 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:37,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:37,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1964238774, now seen corresponding path program 1 times [2020-04-17 22:48:37,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:37,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389448598] [2020-04-17 22:48:37,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:37,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389448598] [2020-04-17 22:48:37,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:37,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-17 22:48:37,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731352349] [2020-04-17 22:48:37,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-04-17 22:48:37,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:37,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-17 22:48:37,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-04-17 22:48:37,752 INFO L87 Difference]: Start difference. First operand 1903 states and 4284 transitions. Second operand 10 states. [2020-04-17 22:48:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:39,001 INFO L93 Difference]: Finished difference Result 2467 states and 5511 transitions. [2020-04-17 22:48:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 22:48:39,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-04-17 22:48:39,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:39,006 INFO L225 Difference]: With dead ends: 2467 [2020-04-17 22:48:39,006 INFO L226 Difference]: Without dead ends: 2467 [2020-04-17 22:48:39,007 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2020-04-17 22:48:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2020-04-17 22:48:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 1964. [2020-04-17 22:48:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2020-04-17 22:48:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 4426 transitions. [2020-04-17 22:48:39,054 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 4426 transitions. Word has length 15 [2020-04-17 22:48:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:39,055 INFO L479 AbstractCegarLoop]: Abstraction has 1964 states and 4426 transitions. [2020-04-17 22:48:39,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-04-17 22:48:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 4426 transitions. [2020-04-17 22:48:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:48:39,056 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:39,056 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:39,057 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:39,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:39,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2009581754, now seen corresponding path program 3 times [2020-04-17 22:48:39,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:39,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140756564] [2020-04-17 22:48:39,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:39,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140756564] [2020-04-17 22:48:39,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:39,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:48:39,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882425146] [2020-04-17 22:48:39,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:48:39,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:39,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:48:39,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:48:39,639 INFO L87 Difference]: Start difference. First operand 1964 states and 4426 transitions. Second operand 13 states. [2020-04-17 22:48:40,291 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2020-04-17 22:48:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:42,668 INFO L93 Difference]: Finished difference Result 2999 states and 6699 transitions. [2020-04-17 22:48:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 22:48:42,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:48:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:42,676 INFO L225 Difference]: With dead ends: 2999 [2020-04-17 22:48:42,676 INFO L226 Difference]: Without dead ends: 2999 [2020-04-17 22:48:42,677 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:48:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2020-04-17 22:48:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1966. [2020-04-17 22:48:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-04-17 22:48:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 4432 transitions. [2020-04-17 22:48:42,721 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 4432 transitions. Word has length 15 [2020-04-17 22:48:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:42,722 INFO L479 AbstractCegarLoop]: Abstraction has 1966 states and 4432 transitions. [2020-04-17 22:48:42,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:48:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 4432 transitions. [2020-04-17 22:48:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:48:42,723 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:42,723 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:42,724 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash 266967168, now seen corresponding path program 4 times [2020-04-17 22:48:42,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:42,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464209019] [2020-04-17 22:48:42,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:43,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464209019] [2020-04-17 22:48:43,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:43,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:48:43,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355328001] [2020-04-17 22:48:43,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:48:43,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:48:43,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:48:43,235 INFO L87 Difference]: Start difference. First operand 1966 states and 4432 transitions. Second operand 14 states. [2020-04-17 22:48:44,692 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-04-17 22:48:44,940 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2020-04-17 22:48:45,180 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2020-04-17 22:48:45,657 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2020-04-17 22:48:46,217 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2020-04-17 22:48:46,615 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2020-04-17 22:48:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:47,683 INFO L93 Difference]: Finished difference Result 2966 states and 6625 transitions. [2020-04-17 22:48:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-17 22:48:47,683 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:48:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:47,691 INFO L225 Difference]: With dead ends: 2966 [2020-04-17 22:48:47,691 INFO L226 Difference]: Without dead ends: 2966 [2020-04-17 22:48:47,692 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=438, Invalid=1044, Unknown=0, NotChecked=0, Total=1482 [2020-04-17 22:48:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-04-17 22:48:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1968. [2020-04-17 22:48:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2020-04-17 22:48:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 4437 transitions. [2020-04-17 22:48:47,738 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 4437 transitions. Word has length 15 [2020-04-17 22:48:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:47,738 INFO L479 AbstractCegarLoop]: Abstraction has 1968 states and 4437 transitions. [2020-04-17 22:48:47,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:48:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 4437 transitions. [2020-04-17 22:48:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:48:47,740 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:47,740 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:47,741 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1795382902, now seen corresponding path program 2 times [2020-04-17 22:48:47,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:47,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763559261] [2020-04-17 22:48:47,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:47,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763559261] [2020-04-17 22:48:47,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:47,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:48:47,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180850066] [2020-04-17 22:48:47,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:48:47,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:47,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:48:47,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:48:47,936 INFO L87 Difference]: Start difference. First operand 1968 states and 4437 transitions. Second operand 14 states. [2020-04-17 22:48:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:52,217 INFO L93 Difference]: Finished difference Result 3807 states and 8456 transitions. [2020-04-17 22:48:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-17 22:48:52,218 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:48:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:52,227 INFO L225 Difference]: With dead ends: 3807 [2020-04-17 22:48:52,227 INFO L226 Difference]: Without dead ends: 3807 [2020-04-17 22:48:52,228 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2020-04-17 22:48:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2020-04-17 22:48:52,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 1947. [2020-04-17 22:48:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2020-04-17 22:48:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 4387 transitions. [2020-04-17 22:48:52,278 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 4387 transitions. Word has length 15 [2020-04-17 22:48:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:52,279 INFO L479 AbstractCegarLoop]: Abstraction has 1947 states and 4387 transitions. [2020-04-17 22:48:52,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:48:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 4387 transitions. [2020-04-17 22:48:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:48:52,280 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:52,280 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:52,281 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:52,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:52,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2019057122, now seen corresponding path program 5 times [2020-04-17 22:48:52,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:52,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752718714] [2020-04-17 22:48:52,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:52,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752718714] [2020-04-17 22:48:52,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:52,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:48:52,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604508188] [2020-04-17 22:48:52,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:48:52,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:52,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:48:52,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:48:52,745 INFO L87 Difference]: Start difference. First operand 1947 states and 4387 transitions. Second operand 14 states. [2020-04-17 22:48:55,245 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2020-04-17 22:48:56,341 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2020-04-17 22:48:56,789 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2020-04-17 22:48:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:48:58,031 INFO L93 Difference]: Finished difference Result 2764 states and 6171 transitions. [2020-04-17 22:48:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-04-17 22:48:58,032 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:48:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:48:58,036 INFO L225 Difference]: With dead ends: 2764 [2020-04-17 22:48:58,036 INFO L226 Difference]: Without dead ends: 2764 [2020-04-17 22:48:58,037 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=519, Invalid=1287, Unknown=0, NotChecked=0, Total=1806 [2020-04-17 22:48:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2020-04-17 22:48:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 1926. [2020-04-17 22:48:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2020-04-17 22:48:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 4335 transitions. [2020-04-17 22:48:58,082 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 4335 transitions. Word has length 15 [2020-04-17 22:48:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:48:58,083 INFO L479 AbstractCegarLoop]: Abstraction has 1926 states and 4335 transitions. [2020-04-17 22:48:58,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:48:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 4335 transitions. [2020-04-17 22:48:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:48:58,084 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:48:58,084 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:48:58,084 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:48:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:48:58,085 INFO L82 PathProgramCache]: Analyzing trace with hash 769294464, now seen corresponding path program 6 times [2020-04-17 22:48:58,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:48:58,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335439042] [2020-04-17 22:48:58,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:48:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:48:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:48:58,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335439042] [2020-04-17 22:48:58,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:48:58,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:48:58,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180648569] [2020-04-17 22:48:58,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:48:58,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:48:58,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:48:58,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:48:58,565 INFO L87 Difference]: Start difference. First operand 1926 states and 4335 transitions. Second operand 14 states. [2020-04-17 22:48:59,962 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2020-04-17 22:49:00,515 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2020-04-17 22:49:00,645 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2020-04-17 22:49:00,897 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2020-04-17 22:49:01,223 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2020-04-17 22:49:01,962 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2020-04-17 22:49:02,223 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2020-04-17 22:49:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:03,370 INFO L93 Difference]: Finished difference Result 2468 states and 5513 transitions. [2020-04-17 22:49:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-04-17 22:49:03,370 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:49:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:03,374 INFO L225 Difference]: With dead ends: 2468 [2020-04-17 22:49:03,374 INFO L226 Difference]: Without dead ends: 2468 [2020-04-17 22:49:03,375 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=434, Invalid=1126, Unknown=0, NotChecked=0, Total=1560 [2020-04-17 22:49:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2020-04-17 22:49:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 1919. [2020-04-17 22:49:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1919 states. [2020-04-17 22:49:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 4320 transitions. [2020-04-17 22:49:03,407 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 4320 transitions. Word has length 15 [2020-04-17 22:49:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:03,410 INFO L479 AbstractCegarLoop]: Abstraction has 1919 states and 4320 transitions. [2020-04-17 22:49:03,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:49:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 4320 transitions. [2020-04-17 22:49:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:03,411 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:03,411 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:03,412 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:03,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:03,412 INFO L82 PathProgramCache]: Analyzing trace with hash -416101166, now seen corresponding path program 7 times [2020-04-17 22:49:03,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:03,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281853480] [2020-04-17 22:49:03,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:03,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281853480] [2020-04-17 22:49:03,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:03,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:49:03,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6541943] [2020-04-17 22:49:03,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:49:03,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:03,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:49:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:49:03,829 INFO L87 Difference]: Start difference. First operand 1919 states and 4320 transitions. Second operand 14 states. [2020-04-17 22:49:05,953 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2020-04-17 22:49:06,644 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2020-04-17 22:49:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:08,126 INFO L93 Difference]: Finished difference Result 2464 states and 5507 transitions. [2020-04-17 22:49:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-04-17 22:49:08,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:49:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:08,131 INFO L225 Difference]: With dead ends: 2464 [2020-04-17 22:49:08,131 INFO L226 Difference]: Without dead ends: 2464 [2020-04-17 22:49:08,132 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=458, Invalid=1182, Unknown=0, NotChecked=0, Total=1640 [2020-04-17 22:49:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2020-04-17 22:49:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1923. [2020-04-17 22:49:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2020-04-17 22:49:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 4328 transitions. [2020-04-17 22:49:08,164 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 4328 transitions. Word has length 15 [2020-04-17 22:49:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:08,164 INFO L479 AbstractCegarLoop]: Abstraction has 1923 states and 4328 transitions. [2020-04-17 22:49:08,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:49:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 4328 transitions. [2020-04-17 22:49:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:08,165 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:08,165 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:08,166 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:08,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:08,166 INFO L82 PathProgramCache]: Analyzing trace with hash -943697428, now seen corresponding path program 8 times [2020-04-17 22:49:08,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:08,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965199672] [2020-04-17 22:49:08,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:08,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965199672] [2020-04-17 22:49:08,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:08,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:49:08,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358248139] [2020-04-17 22:49:08,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:49:08,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:08,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:49:08,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:49:08,648 INFO L87 Difference]: Start difference. First operand 1923 states and 4328 transitions. Second operand 14 states. [2020-04-17 22:49:10,866 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2020-04-17 22:49:11,311 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2020-04-17 22:49:11,978 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2020-04-17 22:49:12,752 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2020-04-17 22:49:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:14,125 INFO L93 Difference]: Finished difference Result 2426 states and 5423 transitions. [2020-04-17 22:49:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-17 22:49:14,126 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:49:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:14,130 INFO L225 Difference]: With dead ends: 2426 [2020-04-17 22:49:14,130 INFO L226 Difference]: Without dead ends: 2426 [2020-04-17 22:49:14,131 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2020-04-17 22:49:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2020-04-17 22:49:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1914. [2020-04-17 22:49:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2020-04-17 22:49:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 4307 transitions. [2020-04-17 22:49:14,162 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 4307 transitions. Word has length 15 [2020-04-17 22:49:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:14,162 INFO L479 AbstractCegarLoop]: Abstraction has 1914 states and 4307 transitions. [2020-04-17 22:49:14,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:49:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 4307 transitions. [2020-04-17 22:49:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:14,194 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:14,194 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:14,194 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:14,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:14,194 INFO L82 PathProgramCache]: Analyzing trace with hash -758085708, now seen corresponding path program 3 times [2020-04-17 22:49:14,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:14,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032965880] [2020-04-17 22:49:14,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:14,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032965880] [2020-04-17 22:49:14,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:14,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:49:14,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396590093] [2020-04-17 22:49:14,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:14,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:14,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:14,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:14,354 INFO L87 Difference]: Start difference. First operand 1914 states and 4307 transitions. Second operand 13 states. [2020-04-17 22:49:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:17,444 INFO L93 Difference]: Finished difference Result 2606 states and 5812 transitions. [2020-04-17 22:49:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:49:17,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:49:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:17,449 INFO L225 Difference]: With dead ends: 2606 [2020-04-17 22:49:17,449 INFO L226 Difference]: Without dead ends: 2606 [2020-04-17 22:49:17,450 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:49:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2020-04-17 22:49:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 1920. [2020-04-17 22:49:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2020-04-17 22:49:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 4319 transitions. [2020-04-17 22:49:17,481 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 4319 transitions. Word has length 15 [2020-04-17 22:49:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:17,481 INFO L479 AbstractCegarLoop]: Abstraction has 1920 states and 4319 transitions. [2020-04-17 22:49:17,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 4319 transitions. [2020-04-17 22:49:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:17,483 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:17,483 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:17,483 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:17,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:17,483 INFO L82 PathProgramCache]: Analyzing trace with hash 944202556, now seen corresponding path program 4 times [2020-04-17 22:49:17,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:17,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503715717] [2020-04-17 22:49:17,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:17,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503715717] [2020-04-17 22:49:17,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:17,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:49:17,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965161165] [2020-04-17 22:49:17,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:17,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:17,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:17,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:17,650 INFO L87 Difference]: Start difference. First operand 1920 states and 4319 transitions. Second operand 13 states. [2020-04-17 22:49:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:20,856 INFO L93 Difference]: Finished difference Result 2632 states and 5860 transitions. [2020-04-17 22:49:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-04-17 22:49:20,856 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:49:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:20,860 INFO L225 Difference]: With dead ends: 2632 [2020-04-17 22:49:20,860 INFO L226 Difference]: Without dead ends: 2632 [2020-04-17 22:49:20,861 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=857, Unknown=0, NotChecked=0, Total=1190 [2020-04-17 22:49:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2020-04-17 22:49:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 1902. [2020-04-17 22:49:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2020-04-17 22:49:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 4278 transitions. [2020-04-17 22:49:20,896 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 4278 transitions. Word has length 15 [2020-04-17 22:49:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:20,896 INFO L479 AbstractCegarLoop]: Abstraction has 1902 states and 4278 transitions. [2020-04-17 22:49:20,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 4278 transitions. [2020-04-17 22:49:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:20,898 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:20,898 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:20,899 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:20,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1540824104, now seen corresponding path program 9 times [2020-04-17 22:49:20,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:20,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107764681] [2020-04-17 22:49:20,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:21,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107764681] [2020-04-17 22:49:21,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:21,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-17 22:49:21,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192145743] [2020-04-17 22:49:21,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-17 22:49:21,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:21,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-17 22:49:21,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-04-17 22:49:21,066 INFO L87 Difference]: Start difference. First operand 1902 states and 4278 transitions. Second operand 7 states. [2020-04-17 22:49:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:22,187 INFO L93 Difference]: Finished difference Result 2242 states and 4995 transitions. [2020-04-17 22:49:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-17 22:49:22,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-04-17 22:49:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:22,191 INFO L225 Difference]: With dead ends: 2242 [2020-04-17 22:49:22,191 INFO L226 Difference]: Without dead ends: 2242 [2020-04-17 22:49:22,192 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-04-17 22:49:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2020-04-17 22:49:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1853. [2020-04-17 22:49:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2020-04-17 22:49:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 4163 transitions. [2020-04-17 22:49:22,216 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 4163 transitions. Word has length 15 [2020-04-17 22:49:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:22,216 INFO L479 AbstractCegarLoop]: Abstraction has 1853 states and 4163 transitions. [2020-04-17 22:49:22,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-17 22:49:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 4163 transitions. [2020-04-17 22:49:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:22,217 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:22,217 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:22,218 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:22,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1553246214, now seen corresponding path program 10 times [2020-04-17 22:49:22,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:22,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123659620] [2020-04-17 22:49:22,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:22,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123659620] [2020-04-17 22:49:22,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:22,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:49:22,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115403680] [2020-04-17 22:49:22,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:49:22,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:22,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:49:22,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:49:22,625 INFO L87 Difference]: Start difference. First operand 1853 states and 4163 transitions. Second operand 14 states. [2020-04-17 22:49:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:25,777 INFO L93 Difference]: Finished difference Result 2476 states and 5519 transitions. [2020-04-17 22:49:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:49:25,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:49:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:25,782 INFO L225 Difference]: With dead ends: 2476 [2020-04-17 22:49:25,782 INFO L226 Difference]: Without dead ends: 2476 [2020-04-17 22:49:25,783 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=255, Invalid=557, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:49:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2020-04-17 22:49:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 1854. [2020-04-17 22:49:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2020-04-17 22:49:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 4165 transitions. [2020-04-17 22:49:25,814 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 4165 transitions. Word has length 15 [2020-04-17 22:49:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:25,815 INFO L479 AbstractCegarLoop]: Abstraction has 1854 states and 4165 transitions. [2020-04-17 22:49:25,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:49:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 4165 transitions. [2020-04-17 22:49:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:25,818 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:25,818 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:25,818 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:25,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1113739962, now seen corresponding path program 11 times [2020-04-17 22:49:25,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:25,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72645511] [2020-04-17 22:49:25,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:26,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72645511] [2020-04-17 22:49:26,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:26,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:49:26,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995208745] [2020-04-17 22:49:26,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:49:26,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:49:26,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:49:26,264 INFO L87 Difference]: Start difference. First operand 1854 states and 4165 transitions. Second operand 14 states. [2020-04-17 22:49:28,419 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2020-04-17 22:49:28,551 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-04-17 22:49:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:30,272 INFO L93 Difference]: Finished difference Result 2768 states and 6168 transitions. [2020-04-17 22:49:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-04-17 22:49:30,272 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:49:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:30,276 INFO L225 Difference]: With dead ends: 2768 [2020-04-17 22:49:30,276 INFO L226 Difference]: Without dead ends: 2768 [2020-04-17 22:49:30,277 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=271, Invalid=599, Unknown=0, NotChecked=0, Total=870 [2020-04-17 22:49:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2020-04-17 22:49:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 1848. [2020-04-17 22:49:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2020-04-17 22:49:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 4146 transitions. [2020-04-17 22:49:30,299 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 4146 transitions. Word has length 15 [2020-04-17 22:49:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:30,299 INFO L479 AbstractCegarLoop]: Abstraction has 1848 states and 4146 transitions. [2020-04-17 22:49:30,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:49:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 4146 transitions. [2020-04-17 22:49:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:30,300 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:30,300 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:30,300 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:30,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2116019282, now seen corresponding path program 12 times [2020-04-17 22:49:30,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:30,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132525621] [2020-04-17 22:49:30,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:30,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132525621] [2020-04-17 22:49:30,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:30,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:49:30,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036060448] [2020-04-17 22:49:30,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:49:30,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:30,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:49:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:49:30,830 INFO L87 Difference]: Start difference. First operand 1848 states and 4146 transitions. Second operand 13 states. [2020-04-17 22:49:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:33,356 INFO L93 Difference]: Finished difference Result 2643 states and 5877 transitions. [2020-04-17 22:49:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:49:33,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-04-17 22:49:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:33,361 INFO L225 Difference]: With dead ends: 2643 [2020-04-17 22:49:33,361 INFO L226 Difference]: Without dead ends: 2643 [2020-04-17 22:49:33,361 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2020-04-17 22:49:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2020-04-17 22:49:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1850. [2020-04-17 22:49:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2020-04-17 22:49:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 4152 transitions. [2020-04-17 22:49:33,384 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 4152 transitions. Word has length 15 [2020-04-17 22:49:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:33,385 INFO L479 AbstractCegarLoop]: Abstraction has 1850 states and 4152 transitions. [2020-04-17 22:49:33,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:49:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 4152 transitions. [2020-04-17 22:49:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-17 22:49:33,385 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:33,385 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:33,386 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:33,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:33,386 INFO L82 PathProgramCache]: Analyzing trace with hash 160529640, now seen corresponding path program 13 times [2020-04-17 22:49:33,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:33,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855761404] [2020-04-17 22:49:33,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:33,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855761404] [2020-04-17 22:49:33,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:33,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:49:33,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349337958] [2020-04-17 22:49:33,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:49:33,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:33,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:49:33,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:49:33,902 INFO L87 Difference]: Start difference. First operand 1850 states and 4152 transitions. Second operand 14 states. [2020-04-17 22:49:35,117 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-04-17 22:49:35,665 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2020-04-17 22:49:36,113 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2020-04-17 22:49:36,630 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2020-04-17 22:49:37,020 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2020-04-17 22:49:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:38,717 INFO L93 Difference]: Finished difference Result 2629 states and 5849 transitions. [2020-04-17 22:49:38,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-04-17 22:49:38,718 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-04-17 22:49:38,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:38,721 INFO L225 Difference]: With dead ends: 2629 [2020-04-17 22:49:38,722 INFO L226 Difference]: Without dead ends: 2629 [2020-04-17 22:49:38,722 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=352, Invalid=838, Unknown=0, NotChecked=0, Total=1190 [2020-04-17 22:49:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2020-04-17 22:49:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 1811. [2020-04-17 22:49:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2020-04-17 22:49:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 4059 transitions. [2020-04-17 22:49:38,743 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 4059 transitions. Word has length 15 [2020-04-17 22:49:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:38,743 INFO L479 AbstractCegarLoop]: Abstraction has 1811 states and 4059 transitions. [2020-04-17 22:49:38,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:49:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 4059 transitions. [2020-04-17 22:49:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:49:38,744 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:38,745 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:38,745 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:38,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:38,745 INFO L82 PathProgramCache]: Analyzing trace with hash 56364802, now seen corresponding path program 1 times [2020-04-17 22:49:38,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:38,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49698259] [2020-04-17 22:49:38,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:39,532 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2020-04-17 22:49:39,697 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2020-04-17 22:49:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:39,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49698259] [2020-04-17 22:49:39,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:39,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:49:39,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767580089] [2020-04-17 22:49:39,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 22:49:39,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 22:49:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-04-17 22:49:39,781 INFO L87 Difference]: Start difference. First operand 1811 states and 4059 transitions. Second operand 14 states. [2020-04-17 22:49:40,697 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2020-04-17 22:49:41,018 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2020-04-17 22:49:41,238 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2020-04-17 22:49:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:44,610 INFO L93 Difference]: Finished difference Result 2966 states and 6656 transitions. [2020-04-17 22:49:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:49:44,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2020-04-17 22:49:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:44,615 INFO L225 Difference]: With dead ends: 2966 [2020-04-17 22:49:44,615 INFO L226 Difference]: Without dead ends: 2966 [2020-04-17 22:49:44,615 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:49:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-04-17 22:49:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1965. [2020-04-17 22:49:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-04-17 22:49:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 4442 transitions. [2020-04-17 22:49:44,649 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 4442 transitions. Word has length 17 [2020-04-17 22:49:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:44,649 INFO L479 AbstractCegarLoop]: Abstraction has 1965 states and 4442 transitions. [2020-04-17 22:49:44,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 22:49:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 4442 transitions. [2020-04-17 22:49:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:49:44,650 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:44,650 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:44,651 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:44,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:44,651 INFO L82 PathProgramCache]: Analyzing trace with hash -355644728, now seen corresponding path program 2 times [2020-04-17 22:49:44,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:44,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225337930] [2020-04-17 22:49:44,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:45,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225337930] [2020-04-17 22:49:45,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:45,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:49:45,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665160915] [2020-04-17 22:49:45,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:49:45,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:45,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:49:45,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:49:45,383 INFO L87 Difference]: Start difference. First operand 1965 states and 4442 transitions. Second operand 16 states. [2020-04-17 22:49:46,071 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-04-17 22:49:46,465 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2020-04-17 22:49:46,605 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2020-04-17 22:49:46,881 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2020-04-17 22:49:48,604 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2020-04-17 22:49:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:51,061 INFO L93 Difference]: Finished difference Result 3834 states and 8701 transitions. [2020-04-17 22:49:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-04-17 22:49:51,062 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:49:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:51,067 INFO L225 Difference]: With dead ends: 3834 [2020-04-17 22:49:51,068 INFO L226 Difference]: Without dead ends: 3834 [2020-04-17 22:49:51,068 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2020-04-17 22:49:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2020-04-17 22:49:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 1979. [2020-04-17 22:49:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2020-04-17 22:49:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 4481 transitions. [2020-04-17 22:49:51,106 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 4481 transitions. Word has length 17 [2020-04-17 22:49:51,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:51,106 INFO L479 AbstractCegarLoop]: Abstraction has 1979 states and 4481 transitions. [2020-04-17 22:49:51,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:49:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 4481 transitions. [2020-04-17 22:49:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:49:51,108 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:51,108 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:51,108 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:51,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash -361093598, now seen corresponding path program 3 times [2020-04-17 22:49:51,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:51,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63218531] [2020-04-17 22:49:51,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:51,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63218531] [2020-04-17 22:49:51,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:51,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:49:51,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32767193] [2020-04-17 22:49:51,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:49:51,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:51,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:49:51,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:49:51,582 INFO L87 Difference]: Start difference. First operand 1979 states and 4481 transitions. Second operand 15 states. [2020-04-17 22:49:52,549 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-04-17 22:49:53,338 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-04-17 22:49:53,889 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-04-17 22:49:54,259 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-04-17 22:49:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:49:56,142 INFO L93 Difference]: Finished difference Result 3544 states and 8019 transitions. [2020-04-17 22:49:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-04-17 22:49:56,143 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:49:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:49:56,148 INFO L225 Difference]: With dead ends: 3544 [2020-04-17 22:49:56,148 INFO L226 Difference]: Without dead ends: 3544 [2020-04-17 22:49:56,149 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=362, Invalid=898, Unknown=0, NotChecked=0, Total=1260 [2020-04-17 22:49:56,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2020-04-17 22:49:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 2010. [2020-04-17 22:49:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2020-04-17 22:49:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4555 transitions. [2020-04-17 22:49:56,176 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4555 transitions. Word has length 17 [2020-04-17 22:49:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:49:56,176 INFO L479 AbstractCegarLoop]: Abstraction has 2010 states and 4555 transitions. [2020-04-17 22:49:56,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:49:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4555 transitions. [2020-04-17 22:49:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:49:56,177 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:49:56,177 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:49:56,177 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:49:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:49:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1107076796, now seen corresponding path program 4 times [2020-04-17 22:49:56,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:49:56,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013852675] [2020-04-17 22:49:56,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:49:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:49:56,818 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2020-04-17 22:49:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:49:57,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013852675] [2020-04-17 22:49:57,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:49:57,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:49:57,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082317035] [2020-04-17 22:49:57,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:49:57,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:49:57,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:49:57,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:49:57,061 INFO L87 Difference]: Start difference. First operand 2010 states and 4555 transitions. Second operand 16 states. [2020-04-17 22:49:57,853 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2020-04-17 22:49:58,324 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2020-04-17 22:49:58,456 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-04-17 22:49:58,840 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 68 [2020-04-17 22:50:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:03,973 INFO L93 Difference]: Finished difference Result 4039 states and 9176 transitions. [2020-04-17 22:50:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-04-17 22:50:03,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:50:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:03,979 INFO L225 Difference]: With dead ends: 4039 [2020-04-17 22:50:03,979 INFO L226 Difference]: Without dead ends: 4039 [2020-04-17 22:50:03,980 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2020-04-17 22:50:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2020-04-17 22:50:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 2035. [2020-04-17 22:50:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-04-17 22:50:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4617 transitions. [2020-04-17 22:50:04,020 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4617 transitions. Word has length 17 [2020-04-17 22:50:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:04,020 INFO L479 AbstractCegarLoop]: Abstraction has 2035 states and 4617 transitions. [2020-04-17 22:50:04,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4617 transitions. [2020-04-17 22:50:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:04,022 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:04,022 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:04,022 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:04,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:04,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1101627926, now seen corresponding path program 5 times [2020-04-17 22:50:04,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:04,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046617660] [2020-04-17 22:50:04,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:04,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046617660] [2020-04-17 22:50:04,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:04,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:04,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923353182] [2020-04-17 22:50:04,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:04,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:04,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:04,432 INFO L87 Difference]: Start difference. First operand 2035 states and 4617 transitions. Second operand 16 states. [2020-04-17 22:50:05,533 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2020-04-17 22:50:05,953 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2020-04-17 22:50:06,315 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2020-04-17 22:50:06,939 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2020-04-17 22:50:07,509 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2020-04-17 22:50:07,922 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2020-04-17 22:50:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:10,146 INFO L93 Difference]: Finished difference Result 3622 states and 8203 transitions. [2020-04-17 22:50:10,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-04-17 22:50:10,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:50:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:10,151 INFO L225 Difference]: With dead ends: 3622 [2020-04-17 22:50:10,152 INFO L226 Difference]: Without dead ends: 3622 [2020-04-17 22:50:10,152 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=375, Invalid=1031, Unknown=0, NotChecked=0, Total=1406 [2020-04-17 22:50:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2020-04-17 22:50:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 2013. [2020-04-17 22:50:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2013 states. [2020-04-17 22:50:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 4562 transitions. [2020-04-17 22:50:10,177 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 4562 transitions. Word has length 17 [2020-04-17 22:50:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:10,177 INFO L479 AbstractCegarLoop]: Abstraction has 2013 states and 4562 transitions. [2020-04-17 22:50:10,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 4562 transitions. [2020-04-17 22:50:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:10,178 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:10,179 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:10,179 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:10,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash 767710024, now seen corresponding path program 6 times [2020-04-17 22:50:10,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:10,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212336544] [2020-04-17 22:50:10,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:10,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212336544] [2020-04-17 22:50:10,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:10,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:10,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363659536] [2020-04-17 22:50:10,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:50:10,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:50:10,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:50:10,876 INFO L87 Difference]: Start difference. First operand 2013 states and 4562 transitions. Second operand 15 states. [2020-04-17 22:50:12,023 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-04-17 22:50:12,416 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 68 [2020-04-17 22:50:13,790 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 45 [2020-04-17 22:50:14,267 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2020-04-17 22:50:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:16,851 INFO L93 Difference]: Finished difference Result 4136 states and 9389 transitions. [2020-04-17 22:50:16,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-04-17 22:50:16,853 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:50:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:16,857 INFO L225 Difference]: With dead ends: 4136 [2020-04-17 22:50:16,857 INFO L226 Difference]: Without dead ends: 4136 [2020-04-17 22:50:16,858 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=350, Invalid=1132, Unknown=0, NotChecked=0, Total=1482 [2020-04-17 22:50:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2020-04-17 22:50:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 2028. [2020-04-17 22:50:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2028 states. [2020-04-17 22:50:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 4601 transitions. [2020-04-17 22:50:16,884 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 4601 transitions. Word has length 17 [2020-04-17 22:50:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:16,884 INFO L479 AbstractCegarLoop]: Abstraction has 2028 states and 4601 transitions. [2020-04-17 22:50:16,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:50:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 4601 transitions. [2020-04-17 22:50:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:16,886 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:16,886 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:16,886 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1150720592, now seen corresponding path program 7 times [2020-04-17 22:50:16,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:16,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161002154] [2020-04-17 22:50:16,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:17,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161002154] [2020-04-17 22:50:17,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:17,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:17,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473490996] [2020-04-17 22:50:17,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:50:17,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:17,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:50:17,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:50:17,212 INFO L87 Difference]: Start difference. First operand 2028 states and 4601 transitions. Second operand 15 states. [2020-04-17 22:50:18,560 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 51 [2020-04-17 22:50:19,061 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2020-04-17 22:50:19,648 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2020-04-17 22:50:20,049 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2020-04-17 22:50:20,347 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2020-04-17 22:50:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:22,091 INFO L93 Difference]: Finished difference Result 3874 states and 8775 transitions. [2020-04-17 22:50:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-04-17 22:50:22,092 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:50:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:22,096 INFO L225 Difference]: With dead ends: 3874 [2020-04-17 22:50:22,096 INFO L226 Difference]: Without dead ends: 3874 [2020-04-17 22:50:22,097 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=330, Invalid=930, Unknown=0, NotChecked=0, Total=1260 [2020-04-17 22:50:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2020-04-17 22:50:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 2009. [2020-04-17 22:50:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2020-04-17 22:50:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 4552 transitions. [2020-04-17 22:50:22,123 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 4552 transitions. Word has length 17 [2020-04-17 22:50:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:22,123 INFO L479 AbstractCegarLoop]: Abstraction has 2009 states and 4552 transitions. [2020-04-17 22:50:22,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:50:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 4552 transitions. [2020-04-17 22:50:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:22,125 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:22,125 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:22,125 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:22,126 INFO L82 PathProgramCache]: Analyzing trace with hash -727451898, now seen corresponding path program 8 times [2020-04-17 22:50:22,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:22,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523378705] [2020-04-17 22:50:22,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:22,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523378705] [2020-04-17 22:50:22,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:22,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:22,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157341852] [2020-04-17 22:50:22,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:22,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:22,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:22,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:22,818 INFO L87 Difference]: Start difference. First operand 2009 states and 4552 transitions. Second operand 16 states. [2020-04-17 22:50:23,673 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2020-04-17 22:50:24,420 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 53 [2020-04-17 22:50:24,562 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2020-04-17 22:50:24,877 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 66 [2020-04-17 22:50:26,307 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 47 [2020-04-17 22:50:26,808 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 50 [2020-04-17 22:50:27,262 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 53 [2020-04-17 22:50:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:29,942 INFO L93 Difference]: Finished difference Result 3758 states and 8555 transitions. [2020-04-17 22:50:29,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-17 22:50:29,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:50:29,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:29,947 INFO L225 Difference]: With dead ends: 3758 [2020-04-17 22:50:29,947 INFO L226 Difference]: Without dead ends: 3758 [2020-04-17 22:50:29,948 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2020-04-17 22:50:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2020-04-17 22:50:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 2034. [2020-04-17 22:50:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2020-04-17 22:50:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 4614 transitions. [2020-04-17 22:50:29,974 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 4614 transitions. Word has length 17 [2020-04-17 22:50:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:29,975 INFO L479 AbstractCegarLoop]: Abstraction has 2034 states and 4614 transitions. [2020-04-17 22:50:29,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 4614 transitions. [2020-04-17 22:50:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:29,976 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:29,976 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:29,976 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:29,976 INFO L82 PathProgramCache]: Analyzing trace with hash -732900768, now seen corresponding path program 9 times [2020-04-17 22:50:29,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:29,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381976532] [2020-04-17 22:50:29,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:30,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381976532] [2020-04-17 22:50:30,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:30,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:30,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264997130] [2020-04-17 22:50:30,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:30,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:30,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:30,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:30,380 INFO L87 Difference]: Start difference. First operand 2034 states and 4614 transitions. Second operand 16 states. [2020-04-17 22:50:31,647 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2020-04-17 22:50:32,472 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2020-04-17 22:50:32,864 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2020-04-17 22:50:33,577 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2020-04-17 22:50:34,215 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 59 [2020-04-17 22:50:34,653 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2020-04-17 22:50:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:36,797 INFO L93 Difference]: Finished difference Result 3394 states and 7701 transitions. [2020-04-17 22:50:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-04-17 22:50:36,798 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:50:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:36,802 INFO L225 Difference]: With dead ends: 3394 [2020-04-17 22:50:36,803 INFO L226 Difference]: Without dead ends: 3394 [2020-04-17 22:50:36,803 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=502, Invalid=1390, Unknown=0, NotChecked=0, Total=1892 [2020-04-17 22:50:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2020-04-17 22:50:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 2012. [2020-04-17 22:50:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2020-04-17 22:50:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 4559 transitions. [2020-04-17 22:50:36,827 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 4559 transitions. Word has length 17 [2020-04-17 22:50:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:36,827 INFO L479 AbstractCegarLoop]: Abstraction has 2012 states and 4559 transitions. [2020-04-17 22:50:36,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 4559 transitions. [2020-04-17 22:50:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:36,828 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:36,828 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:36,829 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:36,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:36,829 INFO L82 PathProgramCache]: Analyzing trace with hash 898975786, now seen corresponding path program 10 times [2020-04-17 22:50:36,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:36,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686542714] [2020-04-17 22:50:36,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:37,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686542714] [2020-04-17 22:50:37,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:37,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:37,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13185589] [2020-04-17 22:50:37,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:37,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:37,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:37,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:37,455 INFO L87 Difference]: Start difference. First operand 2012 states and 4559 transitions. Second operand 16 states. [2020-04-17 22:50:39,074 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2020-04-17 22:50:39,516 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 70 [2020-04-17 22:50:41,199 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 47 [2020-04-17 22:50:41,850 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 50 [2020-04-17 22:50:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:45,258 INFO L93 Difference]: Finished difference Result 3857 states and 8764 transitions. [2020-04-17 22:50:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-17 22:50:45,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:50:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:45,264 INFO L225 Difference]: With dead ends: 3857 [2020-04-17 22:50:45,264 INFO L226 Difference]: Without dead ends: 3857 [2020-04-17 22:50:45,264 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2020-04-17 22:50:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2020-04-17 22:50:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 2022. [2020-04-17 22:50:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2020-04-17 22:50:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 4582 transitions. [2020-04-17 22:50:45,291 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 4582 transitions. Word has length 17 [2020-04-17 22:50:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:45,291 INFO L479 AbstractCegarLoop]: Abstraction has 2022 states and 4582 transitions. [2020-04-17 22:50:45,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 4582 transitions. [2020-04-17 22:50:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:45,292 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:45,292 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:45,292 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:45,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:45,293 INFO L82 PathProgramCache]: Analyzing trace with hash 893526916, now seen corresponding path program 11 times [2020-04-17 22:50:45,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:45,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827341937] [2020-04-17 22:50:45,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50: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. [2020-04-17 22:50:45,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827341937] [2020-04-17 22:50:45,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:45,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:45,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442639030] [2020-04-17 22:50:45,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:45,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:45,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:45,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:45,708 INFO L87 Difference]: Start difference. First operand 2022 states and 4582 transitions. Second operand 16 states. [2020-04-17 22:50:47,119 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 55 [2020-04-17 22:50:47,621 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2020-04-17 22:50:48,096 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2020-04-17 22:50:48,916 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2020-04-17 22:50:49,146 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2020-04-17 22:50:49,773 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 59 [2020-04-17 22:50:50,193 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2020-04-17 22:50:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:52,128 INFO L93 Difference]: Finished difference Result 3418 states and 7753 transitions. [2020-04-17 22:50:52,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-17 22:50:52,128 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:50:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:52,133 INFO L225 Difference]: With dead ends: 3418 [2020-04-17 22:50:52,133 INFO L226 Difference]: Without dead ends: 3418 [2020-04-17 22:50:52,134 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=513, Invalid=1467, Unknown=0, NotChecked=0, Total=1980 [2020-04-17 22:50:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2020-04-17 22:50:52,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 2013. [2020-04-17 22:50:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2013 states. [2020-04-17 22:50:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 4561 transitions. [2020-04-17 22:50:52,158 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 4561 transitions. Word has length 17 [2020-04-17 22:50:52,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:52,158 INFO L479 AbstractCegarLoop]: Abstraction has 2013 states and 4561 transitions. [2020-04-17 22:50:52,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 4561 transitions. [2020-04-17 22:50:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:52,160 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:52,160 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:52,160 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:52,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1019454830, now seen corresponding path program 12 times [2020-04-17 22:50:52,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:52,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735014206] [2020-04-17 22:50:52,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:52,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735014206] [2020-04-17 22:50:52,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:52,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:52,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168200137] [2020-04-17 22:50:52,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:50:52,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:52,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:50:52,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:50:52,556 INFO L87 Difference]: Start difference. First operand 2013 states and 4561 transitions. Second operand 15 states. [2020-04-17 22:50:53,238 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2020-04-17 22:50:53,712 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2020-04-17 22:50:54,259 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 54 [2020-04-17 22:50:54,895 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-04-17 22:50:55,609 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 58 [2020-04-17 22:50:56,077 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2020-04-17 22:50:56,308 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 57 [2020-04-17 22:50:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:58,061 INFO L93 Difference]: Finished difference Result 3613 states and 8195 transitions. [2020-04-17 22:50:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-17 22:50:58,062 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:50:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:58,067 INFO L225 Difference]: With dead ends: 3613 [2020-04-17 22:50:58,067 INFO L226 Difference]: Without dead ends: 3613 [2020-04-17 22:50:58,068 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=399, Invalid=1161, Unknown=0, NotChecked=0, Total=1560 [2020-04-17 22:50:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2020-04-17 22:50:58,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 2009. [2020-04-17 22:50:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2020-04-17 22:50:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 4552 transitions. [2020-04-17 22:50:58,093 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 4552 transitions. Word has length 17 [2020-04-17 22:50:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:58,093 INFO L479 AbstractCegarLoop]: Abstraction has 2009 states and 4552 transitions. [2020-04-17 22:50:58,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:50:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 4552 transitions. [2020-04-17 22:50:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:58,094 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:58,094 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:58,094 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:58,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1827062968, now seen corresponding path program 13 times [2020-04-17 22:50:58,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:58,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662590194] [2020-04-17 22:50:58,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:58,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662590194] [2020-04-17 22:50:58,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:58,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:58,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087517541] [2020-04-17 22:50:58,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:58,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:58,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:58,702 INFO L87 Difference]: Start difference. First operand 2009 states and 4552 transitions. Second operand 16 states. [2020-04-17 22:50:59,931 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2020-04-17 22:51:00,214 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2020-04-17 22:51:00,620 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 74 [2020-04-17 22:51:02,166 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2020-04-17 22:51:02,505 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 52 [2020-04-17 22:51:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:05,836 INFO L93 Difference]: Finished difference Result 3552 states and 8092 transitions. [2020-04-17 22:51:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-04-17 22:51:05,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:51:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:05,841 INFO L225 Difference]: With dead ends: 3552 [2020-04-17 22:51:05,841 INFO L226 Difference]: Without dead ends: 3552 [2020-04-17 22:51:05,842 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=394, Invalid=1498, Unknown=0, NotChecked=0, Total=1892 [2020-04-17 22:51:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2020-04-17 22:51:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 2019. [2020-04-17 22:51:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2020-04-17 22:51:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4575 transitions. [2020-04-17 22:51:05,867 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4575 transitions. Word has length 17 [2020-04-17 22:51:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:05,867 INFO L479 AbstractCegarLoop]: Abstraction has 2019 states and 4575 transitions. [2020-04-17 22:51:05,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4575 transitions. [2020-04-17 22:51:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:51:05,869 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:05,869 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:05,869 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1832511838, now seen corresponding path program 14 times [2020-04-17 22:51:05,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:05,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750290906] [2020-04-17 22:51:05,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:06,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750290906] [2020-04-17 22:51:06,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:06,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:06,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127857911] [2020-04-17 22:51:06,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:06,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:06,248 INFO L87 Difference]: Start difference. First operand 2019 states and 4575 transitions. Second operand 16 states. [2020-04-17 22:51:07,877 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2020-04-17 22:51:08,362 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2020-04-17 22:51:09,080 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2020-04-17 22:51:09,597 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2020-04-17 22:51:09,937 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2020-04-17 22:51:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:12,496 INFO L93 Difference]: Finished difference Result 3149 states and 7154 transitions. [2020-04-17 22:51:12,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-17 22:51:12,497 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:51:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:12,501 INFO L225 Difference]: With dead ends: 3149 [2020-04-17 22:51:12,501 INFO L226 Difference]: Without dead ends: 3149 [2020-04-17 22:51:12,501 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=445, Invalid=1361, Unknown=0, NotChecked=0, Total=1806 [2020-04-17 22:51:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2020-04-17 22:51:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 2010. [2020-04-17 22:51:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2020-04-17 22:51:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4554 transitions. [2020-04-17 22:51:12,527 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4554 transitions. Word has length 17 [2020-04-17 22:51:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:12,528 INFO L479 AbstractCegarLoop]: Abstraction has 2010 states and 4554 transitions. [2020-04-17 22:51:12,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4554 transitions. [2020-04-17 22:51:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:51:12,528 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:12,529 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:12,529 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:12,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash 549473712, now seen corresponding path program 15 times [2020-04-17 22:51:12,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:12,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503501413] [2020-04-17 22:51:12,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:12,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503501413] [2020-04-17 22:51:12,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:12,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:12,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001513242] [2020-04-17 22:51:12,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:12,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:12,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:12,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:12,854 INFO L87 Difference]: Start difference. First operand 2010 states and 4554 transitions. Second operand 15 states. [2020-04-17 22:51:13,442 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2020-04-17 22:51:14,110 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2020-04-17 22:51:15,827 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2020-04-17 22:51:16,382 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 56 [2020-04-17 22:51:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:18,450 INFO L93 Difference]: Finished difference Result 3364 states and 7640 transitions. [2020-04-17 22:51:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-04-17 22:51:18,451 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:51:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:18,455 INFO L225 Difference]: With dead ends: 3364 [2020-04-17 22:51:18,455 INFO L226 Difference]: Without dead ends: 3364 [2020-04-17 22:51:18,456 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=358, Invalid=1124, Unknown=0, NotChecked=0, Total=1482 [2020-04-17 22:51:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2020-04-17 22:51:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2009. [2020-04-17 22:51:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2020-04-17 22:51:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 4552 transitions. [2020-04-17 22:51:18,479 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 4552 transitions. Word has length 17 [2020-04-17 22:51:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:18,479 INFO L479 AbstractCegarLoop]: Abstraction has 2009 states and 4552 transitions. [2020-04-17 22:51:18,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 4552 transitions. [2020-04-17 22:51:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:51:18,480 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:18,480 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:18,480 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:18,480 INFO L82 PathProgramCache]: Analyzing trace with hash -449393278, now seen corresponding path program 16 times [2020-04-17 22:51:18,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:18,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509411568] [2020-04-17 22:51:18,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:18,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509411568] [2020-04-17 22:51:18,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:18,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:18,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576159046] [2020-04-17 22:51:18,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:18,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:18,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:18,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:18,784 INFO L87 Difference]: Start difference. First operand 2009 states and 4552 transitions. Second operand 15 states. [2020-04-17 22:51:22,449 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2020-04-17 22:51:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:25,026 INFO L93 Difference]: Finished difference Result 3243 states and 7349 transitions. [2020-04-17 22:51:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-17 22:51:25,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:51:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:25,031 INFO L225 Difference]: With dead ends: 3243 [2020-04-17 22:51:25,031 INFO L226 Difference]: Without dead ends: 3243 [2020-04-17 22:51:25,032 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2020-04-17 22:51:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2020-04-17 22:51:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 2019. [2020-04-17 22:51:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2020-04-17 22:51:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4574 transitions. [2020-04-17 22:51:25,054 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4574 transitions. Word has length 17 [2020-04-17 22:51:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:25,054 INFO L479 AbstractCegarLoop]: Abstraction has 2019 states and 4574 transitions. [2020-04-17 22:51:25,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4574 transitions. [2020-04-17 22:51:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:51:25,055 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:25,056 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:25,056 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash -663260132, now seen corresponding path program 17 times [2020-04-17 22:51:25,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:25,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892102072] [2020-04-17 22:51:25,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:25,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892102072] [2020-04-17 22:51:25,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:25,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:25,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578801546] [2020-04-17 22:51:25,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:25,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:25,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:25,364 INFO L87 Difference]: Start difference. First operand 2019 states and 4574 transitions. Second operand 15 states. [2020-04-17 22:51:26,970 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2020-04-17 22:51:27,229 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-04-17 22:51:28,865 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 60 [2020-04-17 22:51:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:31,043 INFO L93 Difference]: Finished difference Result 2958 states and 6690 transitions. [2020-04-17 22:51:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-04-17 22:51:31,043 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:51:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:31,047 INFO L225 Difference]: With dead ends: 2958 [2020-04-17 22:51:31,048 INFO L226 Difference]: Without dead ends: 2958 [2020-04-17 22:51:31,048 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2020-04-17 22:51:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-04-17 22:51:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2019. [2020-04-17 22:51:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2020-04-17 22:51:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4574 transitions. [2020-04-17 22:51:31,072 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4574 transitions. Word has length 17 [2020-04-17 22:51:31,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:31,073 INFO L479 AbstractCegarLoop]: Abstraction has 2019 states and 4574 transitions. [2020-04-17 22:51:31,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4574 transitions. [2020-04-17 22:51:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:51:31,074 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:31,074 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:31,075 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:31,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1558866544, now seen corresponding path program 18 times [2020-04-17 22:51:31,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:31,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030965808] [2020-04-17 22:51:31,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:31,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030965808] [2020-04-17 22:51:31,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:31,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:31,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75646914] [2020-04-17 22:51:31,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:31,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:31,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:31,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:31,834 INFO L87 Difference]: Start difference. First operand 2019 states and 4574 transitions. Second operand 16 states. [2020-04-17 22:51:32,405 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-04-17 22:51:32,825 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2020-04-17 22:51:32,966 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2020-04-17 22:51:33,281 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2020-04-17 22:51:34,665 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2020-04-17 22:51:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:36,457 INFO L93 Difference]: Finished difference Result 3592 states and 8179 transitions. [2020-04-17 22:51:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-17 22:51:36,458 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:51:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:36,463 INFO L225 Difference]: With dead ends: 3592 [2020-04-17 22:51:36,463 INFO L226 Difference]: Without dead ends: 3592 [2020-04-17 22:51:36,464 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2020-04-17 22:51:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2020-04-17 22:51:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 2027. [2020-04-17 22:51:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2020-04-17 22:51:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4594 transitions. [2020-04-17 22:51:36,511 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4594 transitions. Word has length 17 [2020-04-17 22:51:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:36,512 INFO L479 AbstractCegarLoop]: Abstraction has 2027 states and 4594 transitions. [2020-04-17 22:51:36,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4594 transitions. [2020-04-17 22:51:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:51:36,513 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:36,513 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:36,513 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:36,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:36,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1553417674, now seen corresponding path program 19 times [2020-04-17 22:51:36,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:36,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979132505] [2020-04-17 22:51:36,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:36,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979132505] [2020-04-17 22:51:36,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:36,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:36,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708773418] [2020-04-17 22:51:36,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:36,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:36,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:36,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:36,895 INFO L87 Difference]: Start difference. First operand 2027 states and 4594 transitions. Second operand 15 states. [2020-04-17 22:51:38,180 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-04-17 22:51:38,532 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-04-17 22:51:39,008 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-04-17 22:51:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:41,099 INFO L93 Difference]: Finished difference Result 3330 states and 7559 transitions. [2020-04-17 22:51:41,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-04-17 22:51:41,100 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:51:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:41,105 INFO L225 Difference]: With dead ends: 3330 [2020-04-17 22:51:41,105 INFO L226 Difference]: Without dead ends: 3330 [2020-04-17 22:51:41,106 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2020-04-17 22:51:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2020-04-17 22:51:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2020. [2020-04-17 22:51:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2020-04-17 22:51:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4576 transitions. [2020-04-17 22:51:41,131 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4576 transitions. Word has length 17 [2020-04-17 22:51:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:41,131 INFO L479 AbstractCegarLoop]: Abstraction has 2020 states and 4576 transitions. [2020-04-17 22:51:41,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4576 transitions. [2020-04-17 22:51:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:51:41,132 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:41,132 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:41,132 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:41,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:41,132 INFO L82 PathProgramCache]: Analyzing trace with hash 437105968, now seen corresponding path program 20 times [2020-04-17 22:51:41,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:41,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888539069] [2020-04-17 22:51:41,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:41,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888539069] [2020-04-17 22:51:41,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:41,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:41,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187891159] [2020-04-17 22:51:41,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:41,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:41,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:41,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:41,866 INFO L87 Difference]: Start difference. First operand 2020 states and 4576 transitions. Second operand 16 states. [2020-04-17 22:51:42,588 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-04-17 22:51:43,165 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2020-04-17 22:51:43,296 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2020-04-17 22:51:43,667 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2020-04-17 22:51:45,610 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2020-04-17 22:51:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:48,330 INFO L93 Difference]: Finished difference Result 4020 states and 9115 transitions. [2020-04-17 22:51:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-04-17 22:51:48,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-04-17 22:51:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:48,337 INFO L225 Difference]: With dead ends: 4020 [2020-04-17 22:51:48,337 INFO L226 Difference]: Without dead ends: 4020 [2020-04-17 22:51:48,339 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2020-04-17 22:51:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2020-04-17 22:51:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 2027. [2020-04-17 22:51:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2020-04-17 22:51:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4593 transitions. [2020-04-17 22:51:48,370 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4593 transitions. Word has length 17 [2020-04-17 22:51:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:48,370 INFO L479 AbstractCegarLoop]: Abstraction has 2027 states and 4593 transitions. [2020-04-17 22:51:48,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4593 transitions. [2020-04-17 22:51:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:51:48,371 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:48,371 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:48,371 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 431657098, now seen corresponding path program 21 times [2020-04-17 22:51:48,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:48,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823933169] [2020-04-17 22:51:48,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:48,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823933169] [2020-04-17 22:51:48,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:48,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:48,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435700608] [2020-04-17 22:51:48,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:48,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:48,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:48,821 INFO L87 Difference]: Start difference. First operand 2027 states and 4593 transitions. Second operand 15 states. [2020-04-17 22:51:49,523 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2020-04-17 22:51:49,975 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2020-04-17 22:51:50,412 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2020-04-17 22:51:50,846 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2020-04-17 22:51:51,369 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2020-04-17 22:51:51,769 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2020-04-17 22:51:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:53,724 INFO L93 Difference]: Finished difference Result 3599 states and 8155 transitions. [2020-04-17 22:51:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-17 22:51:53,729 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-04-17 22:51:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:53,733 INFO L225 Difference]: With dead ends: 3599 [2020-04-17 22:51:53,733 INFO L226 Difference]: Without dead ends: 3599 [2020-04-17 22:51:53,734 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2020-04-17 22:51:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2020-04-17 22:51:53,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 2014. [2020-04-17 22:51:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2020-04-17 22:51:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 4557 transitions. [2020-04-17 22:51:53,756 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 4557 transitions. Word has length 17 [2020-04-17 22:51:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:53,757 INFO L479 AbstractCegarLoop]: Abstraction has 2014 states and 4557 transitions. [2020-04-17 22:51:53,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 4557 transitions. [2020-04-17 22:51:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:51:53,758 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:53,758 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:51:53,758 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:53,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:53,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1899827492, now seen corresponding path program 22 times [2020-04-17 22:51:53,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:53,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388588602] [2020-04-17 22:51:53,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:54,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388588602] [2020-04-17 22:51:54,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:54,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:54,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735502146] [2020-04-17 22:51:54,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:54,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:54,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:54,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:54,602 INFO L87 Difference]: Start difference. First operand 2014 states and 4557 transitions. Second operand 16 states. [2020-04-17 22:51:55,246 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2020-04-17 22:51:55,701 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-04-17 22:51:55,838 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-04-17 22:51:56,238 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 68 [2020-04-17 22:51:57,393 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 41 Received shutdown request... [2020-04-17 22:51:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-04-17 22:51:59,950 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-17 22:51:59,954 WARN L228 ceAbstractionStarter]: Timeout [2020-04-17 22:51:59,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.04 10:51:59 BasicIcfg [2020-04-17 22:51:59,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-17 22:51:59,956 INFO L168 Benchmark]: Toolchain (without parser) took 246801.35 ms. Allocated memory was 137.9 MB in the beginning and 459.3 MB in the end (delta: 321.4 MB). Free memory was 100.4 MB in the beginning and 337.1 MB in the end (delta: -236.7 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:59,956 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-04-17 22:51:59,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 902.27 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 98.5 MB in the beginning and 128.9 MB in the end (delta: -30.4 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:59,957 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.51 ms. Allocated memory is still 202.4 MB. Free memory was 128.9 MB in the beginning and 124.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:59,958 INFO L168 Benchmark]: Boogie Preprocessor took 72.89 ms. Allocated memory is still 202.4 MB. Free memory was 124.7 MB in the beginning and 121.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:59,958 INFO L168 Benchmark]: RCFGBuilder took 1147.41 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 121.2 MB in the beginning and 152.4 MB in the end (delta: -31.2 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:59,959 INFO L168 Benchmark]: TraceAbstraction took 244539.99 ms. Allocated memory was 234.4 MB in the beginning and 459.3 MB in the end (delta: 224.9 MB). Free memory was 152.4 MB in the beginning and 337.1 MB in the end (delta: -184.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2020-04-17 22:51:59,961 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 902.27 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 98.5 MB in the beginning and 128.9 MB in the end (delta: -30.4 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 107.51 ms. Allocated memory is still 202.4 MB. Free memory was 128.9 MB in the beginning and 124.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.89 ms. Allocated memory is still 202.4 MB. Free memory was 124.7 MB in the beginning and 121.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1147.41 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 121.2 MB in the beginning and 152.4 MB in the end (delta: -31.2 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244539.99 ms. Allocated memory was 234.4 MB in the beginning and 459.3 MB in the end (delta: 224.9 MB). Free memory was 152.4 MB in the beginning and 337.1 MB in the end (delta: -184.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 26.1s, 415 ProgramPointsBefore, 104 ProgramPointsAfterwards, 443 TransitionsBefore, 121 TransitionsAfterwards, 30326 CoEnabledTransitionPairs, 14 FixpointIterations, 120 TrivialSequentialCompositions, 233 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 76 ConcurrentYvCompositions, 11 ChoiceCompositions, 15998 VarBasedMoverChecksPositive, 666 VarBasedMoverChecksNegative, 514 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.4s, 0 MoverChecksTotal, 106197 CheckedPairsTotal, 459 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1064). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1087]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1087). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1085]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1085). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 26 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3207 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 412 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 244.2s, OverallIterations: 48, TraceHistogramMax: 1, AutomataDifference: 196.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.2s, HoareTripleCheckerStatistics: 5329 SDtfs, 22769 SDslu, 14806 SDs, 0 SdLazy, 103384 SolverSat, 1986 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1411 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 1380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7409 ImplicationChecksByTransitivity, 85.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2035occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 47 MinimizatonAttempts, 49912 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 303700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown