./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 081154e787322e3b9ad682661fd03964eab6d0d9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 03:09:28,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:09:28,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:09:28,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:09:28,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:09:28,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:09:28,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:09:28,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:09:28,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:09:28,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:09:28,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:09:28,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:09:28,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:09:28,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:09:28,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:09:28,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:09:28,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:09:28,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:09:28,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:09:28,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:09:28,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:09:28,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:09:28,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:09:28,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:09:28,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:09:28,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:09:28,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:09:28,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:09:28,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:09:28,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:09:28,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:09:28,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:09:28,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:09:28,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:09:28,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:09:28,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:09:28,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:09:28,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:09:28,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:09:28,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:09:28,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:09:28,817 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 03:09:28,852 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:09:28,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:09:28,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:09:28,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:09:28,854 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:09:28,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:09:28,854 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:09:28,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:09:28,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:09:28,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:09:28,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:09:28,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:09:28,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:09:28,856 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:09:28,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:09:28,856 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:09:28,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:09:28,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:09:28,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:09:28,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:09:28,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:09:28,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:09:28,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:09:28,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:09:28,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:09:28,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:09:28,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:09:28,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:09:28,860 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:09:28,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 081154e787322e3b9ad682661fd03964eab6d0d9 [2020-10-20 03:09:29,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:09:29,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:09:29,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:09:29,077 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:09:29,078 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:09:29,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2020-10-20 03:09:29,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57a8731d/e0d34dbf57614bcbaa9ab5f4cb2a129a/FLAG2b63e7a77 [2020-10-20 03:09:29,726 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:09:29,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2020-10-20 03:09:29,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57a8731d/e0d34dbf57614bcbaa9ab5f4cb2a129a/FLAG2b63e7a77 [2020-10-20 03:09:29,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57a8731d/e0d34dbf57614bcbaa9ab5f4cb2a129a [2020-10-20 03:09:29,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:09:29,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:09:29,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:09:29,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:09:29,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:09:29,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:09:29" (1/1) ... [2020-10-20 03:09:29,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bc3523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:29, skipping insertion in model container [2020-10-20 03:09:29,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:09:29" (1/1) ... [2020-10-20 03:09:29,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:09:30,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:09:30,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:09:30,892 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:09:30,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:09:31,491 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:09:31,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31 WrapperNode [2020-10-20 03:09:31,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:09:31,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:09:31,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:09:31,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:09:31,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (1/1) ... [2020-10-20 03:09:31,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (1/1) ... [2020-10-20 03:09:31,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:09:31,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:09:31,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:09:31,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:09:31,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (1/1) ... [2020-10-20 03:09:31,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (1/1) ... [2020-10-20 03:09:31,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (1/1) ... [2020-10-20 03:09:31,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (1/1) ... [2020-10-20 03:09:31,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (1/1) ... [2020-10-20 03:09:31,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (1/1) ... [2020-10-20 03:09:31,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (1/1) ... [2020-10-20 03:09:31,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:09:31,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:09:31,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:09:31,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:09:31,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (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-10-20 03:09:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:09:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 03:09:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-20 03:09:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 03:09:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:09:31,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:09:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-20 03:09:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-20 03:09:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:09:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:09:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:09:31,734 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 03:09:32,421 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:09:32,422 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-10-20 03:09:32,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:09:32 BoogieIcfgContainer [2020-10-20 03:09:32,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:09:32,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:09:32,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:09:32,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:09:32,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:09:29" (1/3) ... [2020-10-20 03:09:32,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf52ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:09:32, skipping insertion in model container [2020-10-20 03:09:32,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:31" (2/3) ... [2020-10-20 03:09:32,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf52ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:09:32, skipping insertion in model container [2020-10-20 03:09:32,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:09:32" (3/3) ... [2020-10-20 03:09:32,433 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2020-10-20 03:09:32,444 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:09:32,444 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:09:32,452 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-20 03:09:32,453 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:09:32,484 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,485 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,485 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,485 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,485 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,486 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,486 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,486 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,486 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,487 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,487 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,487 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,487 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,489 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,490 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,491 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,491 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,491 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,491 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,492 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,492 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,492 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,492 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,493 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,493 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,493 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,494 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,494 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,494 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,494 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,495 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,495 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,495 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,495 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,496 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,496 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,496 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,496 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,496 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,497 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,497 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,497 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,497 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,498 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,498 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,498 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,498 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,499 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,499 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,499 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,499 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,500 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,500 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,500 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,500 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,501 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,501 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,501 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,501 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,502 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,502 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,506 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,506 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,507 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,508 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,508 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,509 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,516 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,517 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,517 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,518 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,518 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:32,531 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-10-20 03:09:32,543 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-20 03:09:32,562 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:09:32,562 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:09:32,562 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:09:32,562 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:09:32,562 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:09:32,562 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:09:32,562 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:09:32,563 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:09:32,580 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:09:32,583 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 189 transitions, 400 flow [2020-10-20 03:09:32,585 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 189 transitions, 400 flow [2020-10-20 03:09:32,587 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 179 places, 189 transitions, 400 flow [2020-10-20 03:09:32,690 INFO L129 PetriNetUnfolder]: 19/237 cut-off events. [2020-10-20 03:09:32,691 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-20 03:09:32,698 INFO L80 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 237 events. 19/237 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 508 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2020-10-20 03:09:32,703 INFO L117 LiptonReduction]: Number of co-enabled transitions 3444 [2020-10-20 03:09:33,381 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:33,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:33,405 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:33,417 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:33,418 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:33,418 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-20 03:09:33,759 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:33,782 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:33,786 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:33,805 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:33,807 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:33,808 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-20 03:09:33,820 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:33,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:33,845 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:33,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:33,866 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:33,867 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-20 03:09:36,083 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:36,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:36,114 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:36,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:36,148 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:36,148 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-20 03:09:36,161 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:36,190 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:36,195 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:36,215 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:36,217 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:36,217 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-20 03:09:38,321 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:38,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:38,351 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:38,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:38,373 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:38,373 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-20 03:09:38,385 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:38,413 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:38,418 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:38,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:38,438 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:38,438 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-20 03:09:40,680 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:40,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:40,706 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:40,725 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:40,726 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:40,727 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-20 03:09:40,737 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:40,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:40,765 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:40,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:40,784 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:40,785 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-20 03:09:42,971 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:42,999 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:43,002 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,020 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:43,022 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,022 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-20 03:09:43,042 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:43,067 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:43,084 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,085 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-20 03:09:44,140 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:44,161 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:44,165 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:44,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:44,184 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:44,185 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-20 03:09:44,207 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:44,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:44,232 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:44,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:44,247 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:44,247 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-20 03:09:46,508 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,537 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:46,540 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:46,562 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,563 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-20 03:09:46,572 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:46,604 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:46,622 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,622 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-20 03:09:48,636 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:48,661 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,687 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:48,688 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,688 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-20 03:09:48,704 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,734 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:48,737 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:48,757 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,757 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-20 03:09:51,011 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-20 03:09:51,504 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-10-20 03:09:51,674 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:51,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:51,699 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:51,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:51,715 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:51,715 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-20 03:09:51,956 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2020-10-20 03:09:52,959 WARN L193 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 135 [2020-10-20 03:09:53,192 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-20 03:09:53,320 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2020-10-20 03:09:53,460 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-10-20 03:09:55,014 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 168 DAG size of output: 164 [2020-10-20 03:09:55,036 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:55,635 WARN L193 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-10-20 03:09:55,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:55,645 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:56,272 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-10-20 03:09:56,273 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:56,274 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:56,274 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-10-20 03:09:56,927 WARN L193 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-10-20 03:09:57,692 WARN L193 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 158 [2020-10-20 03:09:58,084 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-10-20 03:09:58,108 INFO L132 LiptonReduction]: Checked pairs total: 7933 [2020-10-20 03:09:58,108 INFO L134 LiptonReduction]: Total number of compositions: 237 [2020-10-20 03:09:58,115 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-10-20 03:09:58,147 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-10-20 03:09:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-10-20 03:09:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-20 03:09:58,155 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:09:58,156 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-20 03:09:58,157 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:09:58,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:09:58,164 INFO L82 PathProgramCache]: Analyzing trace with hash 723, now seen corresponding path program 1 times [2020-10-20 03:09:58,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:09:58,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618171308] [2020-10-20 03:09:58,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:09:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:09:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:09:58,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618171308] [2020-10-20 03:09:58,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:09:58,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-20 03:09:58,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296051725] [2020-10-20 03:09:58,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 03:09:58,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:09:58,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 03:09:58,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 03:09:58,502 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-10-20 03:09:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:09:58,534 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-10-20 03:09:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 03:09:58,536 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-20 03:09:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:09:58,553 INFO L225 Difference]: With dead ends: 423 [2020-10-20 03:09:58,553 INFO L226 Difference]: Without dead ends: 385 [2020-10-20 03:09:58,554 INFO L677 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-10-20 03:09:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-20 03:09:58,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-10-20 03:09:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-10-20 03:09:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-10-20 03:09:58,632 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-10-20 03:09:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:09:58,633 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-10-20 03:09:58,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 03:09:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-10-20 03:09:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-20 03:09:58,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:09:58,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-20 03:09:58,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:09:58,637 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:09:58,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:09:58,637 INFO L82 PathProgramCache]: Analyzing trace with hash 22064617, now seen corresponding path program 1 times [2020-10-20 03:09:58,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:09:58,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497759918] [2020-10-20 03:09:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:09:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:09:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:09:58,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497759918] [2020-10-20 03:09:58,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:09:58,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:09:58,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816653229] [2020-10-20 03:09:58,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:09:58,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:09:58,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:09:58,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:09:58,804 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-10-20 03:09:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:09:58,903 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-10-20 03:09:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:09:58,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-20 03:09:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:09:58,911 INFO L225 Difference]: With dead ends: 540 [2020-10-20 03:09:58,911 INFO L226 Difference]: Without dead ends: 540 [2020-10-20 03:09:58,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:09:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-10-20 03:09:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-10-20 03:09:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-20 03:09:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-10-20 03:09:58,943 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-10-20 03:09:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:09:58,944 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-10-20 03:09:58,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:09:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-10-20 03:09:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-20 03:09:58,945 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:09:58,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-20 03:09:58,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:09:58,945 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:09:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:09:58,946 INFO L82 PathProgramCache]: Analyzing trace with hash -270739087, now seen corresponding path program 1 times [2020-10-20 03:09:58,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:09:58,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553215706] [2020-10-20 03:09:58,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:09:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:09:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:09:59,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553215706] [2020-10-20 03:09:59,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:09:59,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:09:59,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969163518] [2020-10-20 03:09:59,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:09:59,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:09:59,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:09:59,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:09:59,064 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 5 states. [2020-10-20 03:09:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:09:59,264 INFO L93 Difference]: Finished difference Result 600 states and 1430 transitions. [2020-10-20 03:09:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:09:59,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-10-20 03:09:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:09:59,272 INFO L225 Difference]: With dead ends: 600 [2020-10-20 03:09:59,273 INFO L226 Difference]: Without dead ends: 514 [2020-10-20 03:09:59,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:09:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-20 03:09:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-10-20 03:09:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-20 03:09:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-10-20 03:09:59,295 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-10-20 03:09:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:09:59,295 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-10-20 03:09:59,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:09:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-10-20 03:09:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:09:59,297 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:09:59,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:09:59,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:09:59,298 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:09:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:09:59,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1711454574, now seen corresponding path program 1 times [2020-10-20 03:09:59,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:09:59,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581372807] [2020-10-20 03:09:59,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:09:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:09:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:09:59,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581372807] [2020-10-20 03:09:59,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:09:59,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:09:59,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026663747] [2020-10-20 03:09:59,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:09:59,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:09:59,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:09:59,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:09:59,362 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-10-20 03:09:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:09:59,377 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-20 03:09:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:09:59,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-20 03:09:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:09:59,379 INFO L225 Difference]: With dead ends: 162 [2020-10-20 03:09:59,379 INFO L226 Difference]: Without dead ends: 162 [2020-10-20 03:09:59,380 INFO L677 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-10-20 03:09:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-20 03:09:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-20 03:09:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-20 03:09:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-20 03:09:59,385 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-20 03:09:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:09:59,386 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-20 03:09:59,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:09:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-20 03:09:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:09:59,388 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:09:59,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:09:59,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:09:59,388 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:09:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:09:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1613525791, now seen corresponding path program 1 times [2020-10-20 03:09:59,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:09:59,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094050457] [2020-10-20 03:09:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:09:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:09:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:09:59,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094050457] [2020-10-20 03:09:59,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:09:59,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:09:59,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653839544] [2020-10-20 03:09:59,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 03:09:59,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:09:59,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 03:09:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:09:59,578 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 9 states. [2020-10-20 03:09:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:09:59,916 INFO L93 Difference]: Finished difference Result 194 states and 403 transitions. [2020-10-20 03:09:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 03:09:59,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-20 03:09:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:09:59,918 INFO L225 Difference]: With dead ends: 194 [2020-10-20 03:09:59,918 INFO L226 Difference]: Without dead ends: 194 [2020-10-20 03:09:59,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2020-10-20 03:09:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-20 03:09:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2020-10-20 03:09:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-20 03:09:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 389 transitions. [2020-10-20 03:09:59,924 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 389 transitions. Word has length 22 [2020-10-20 03:09:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:09:59,924 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 389 transitions. [2020-10-20 03:09:59,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 03:09:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 389 transitions. [2020-10-20 03:09:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:09:59,926 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:09:59,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:09:59,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:09:59,927 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:09:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:09:59,927 INFO L82 PathProgramCache]: Analyzing trace with hash -721777329, now seen corresponding path program 1 times [2020-10-20 03:09:59,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:09:59,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049578174] [2020-10-20 03:09:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:09:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:00,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049578174] [2020-10-20 03:10:00,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:00,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:10:00,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896793249] [2020-10-20 03:10:00,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:10:00,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:00,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:10:00,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:10:00,089 INFO L87 Difference]: Start difference. First operand 186 states and 389 transitions. Second operand 6 states. [2020-10-20 03:10:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:00,167 INFO L93 Difference]: Finished difference Result 226 states and 457 transitions. [2020-10-20 03:10:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:10:00,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-20 03:10:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:00,169 INFO L225 Difference]: With dead ends: 226 [2020-10-20 03:10:00,169 INFO L226 Difference]: Without dead ends: 226 [2020-10-20 03:10:00,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:10:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-10-20 03:10:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 198. [2020-10-20 03:10:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-10-20 03:10:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 409 transitions. [2020-10-20 03:10:00,177 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 409 transitions. Word has length 22 [2020-10-20 03:10:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:00,177 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 409 transitions. [2020-10-20 03:10:00,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:10:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 409 transitions. [2020-10-20 03:10:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:00,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:00,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:00,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:10:00,182 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:00,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1148795979, now seen corresponding path program 2 times [2020-10-20 03:10:00,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:00,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910093501] [2020-10-20 03:10:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:01,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910093501] [2020-10-20 03:10:01,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:01,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:01,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783760001] [2020-10-20 03:10:01,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:01,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:01,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:01,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:01,252 INFO L87 Difference]: Start difference. First operand 198 states and 409 transitions. Second operand 14 states. [2020-10-20 03:10:02,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:02,172 INFO L93 Difference]: Finished difference Result 227 states and 452 transitions. [2020-10-20 03:10:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:02,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:02,174 INFO L225 Difference]: With dead ends: 227 [2020-10-20 03:10:02,174 INFO L226 Difference]: Without dead ends: 227 [2020-10-20 03:10:02,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-10-20 03:10:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2020-10-20 03:10:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-10-20 03:10:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 452 transitions. [2020-10-20 03:10:02,182 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 452 transitions. Word has length 22 [2020-10-20 03:10:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:02,183 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 452 transitions. [2020-10-20 03:10:02,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 452 transitions. [2020-10-20 03:10:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:02,184 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:02,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:02,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:10:02,184 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:02,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1148795934, now seen corresponding path program 1 times [2020-10-20 03:10:02,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:02,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98435716] [2020-10-20 03:10:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:02,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98435716] [2020-10-20 03:10:02,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:02,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:10:02,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877248218] [2020-10-20 03:10:02,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:10:02,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:02,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:10:02,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:10:02,439 INFO L87 Difference]: Start difference. First operand 226 states and 452 transitions. Second operand 10 states. [2020-10-20 03:10:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:02,875 INFO L93 Difference]: Finished difference Result 295 states and 565 transitions. [2020-10-20 03:10:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 03:10:02,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-20 03:10:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:02,877 INFO L225 Difference]: With dead ends: 295 [2020-10-20 03:10:02,877 INFO L226 Difference]: Without dead ends: 265 [2020-10-20 03:10:02,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-10-20 03:10:02,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-10-20 03:10:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 227. [2020-10-20 03:10:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2020-10-20 03:10:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 456 transitions. [2020-10-20 03:10:02,884 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 456 transitions. Word has length 22 [2020-10-20 03:10:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:02,885 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 456 transitions. [2020-10-20 03:10:02,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:10:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 456 transitions. [2020-10-20 03:10:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:02,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:02,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:02,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:10:02,886 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:02,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:02,887 INFO L82 PathProgramCache]: Analyzing trace with hash 235549017, now seen corresponding path program 3 times [2020-10-20 03:10:02,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:02,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906770470] [2020-10-20 03:10:02,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:03,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-10-20 03:10:03,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906770470] [2020-10-20 03:10:03,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:03,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:03,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397031844] [2020-10-20 03:10:03,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:03,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:03,781 INFO L87 Difference]: Start difference. First operand 227 states and 456 transitions. Second operand 14 states. [2020-10-20 03:10:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:04,681 INFO L93 Difference]: Finished difference Result 257 states and 502 transitions. [2020-10-20 03:10:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:04,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:04,684 INFO L225 Difference]: With dead ends: 257 [2020-10-20 03:10:04,684 INFO L226 Difference]: Without dead ends: 229 [2020-10-20 03:10:04,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:04,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-10-20 03:10:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2020-10-20 03:10:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-10-20 03:10:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 459 transitions. [2020-10-20 03:10:04,691 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 459 transitions. Word has length 22 [2020-10-20 03:10:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:04,691 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 459 transitions. [2020-10-20 03:10:04,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 459 transitions. [2020-10-20 03:10:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:04,692 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:04,692 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:04,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:10:04,692 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:04,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1400369243, now seen corresponding path program 4 times [2020-10-20 03:10:04,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:04,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125183967] [2020-10-20 03:10:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:05,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125183967] [2020-10-20 03:10:05,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:05,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:05,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763629348] [2020-10-20 03:10:05,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:05,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:05,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:05,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:05,464 INFO L87 Difference]: Start difference. First operand 229 states and 459 transitions. Second operand 14 states. [2020-10-20 03:10:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:06,334 INFO L93 Difference]: Finished difference Result 280 states and 545 transitions. [2020-10-20 03:10:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:06,334 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:06,336 INFO L225 Difference]: With dead ends: 280 [2020-10-20 03:10:06,336 INFO L226 Difference]: Without dead ends: 253 [2020-10-20 03:10:06,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-10-20 03:10:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 233. [2020-10-20 03:10:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-10-20 03:10:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 465 transitions. [2020-10-20 03:10:06,345 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 465 transitions. Word has length 22 [2020-10-20 03:10:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:06,346 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 465 transitions. [2020-10-20 03:10:06,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 465 transitions. [2020-10-20 03:10:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:06,347 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:06,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:06,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:10:06,347 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:06,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash -223372275, now seen corresponding path program 5 times [2020-10-20 03:10:06,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:06,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43197879] [2020-10-20 03:10:06,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:06,781 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2020-10-20 03:10:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:07,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43197879] [2020-10-20 03:10:07,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:07,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:07,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489791628] [2020-10-20 03:10:07,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:07,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:07,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:07,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:07,197 INFO L87 Difference]: Start difference. First operand 233 states and 465 transitions. Second operand 14 states. [2020-10-20 03:10:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:08,100 INFO L93 Difference]: Finished difference Result 273 states and 529 transitions. [2020-10-20 03:10:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:08,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:08,103 INFO L225 Difference]: With dead ends: 273 [2020-10-20 03:10:08,103 INFO L226 Difference]: Without dead ends: 273 [2020-10-20 03:10:08,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-10-20 03:10:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 266. [2020-10-20 03:10:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-10-20 03:10:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 518 transitions. [2020-10-20 03:10:08,118 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 518 transitions. Word has length 22 [2020-10-20 03:10:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:08,119 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 518 transitions. [2020-10-20 03:10:08,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 518 transitions. [2020-10-20 03:10:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:08,122 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:08,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:08,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 03:10:08,123 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:08,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash -223372320, now seen corresponding path program 2 times [2020-10-20 03:10:08,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:08,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693457719] [2020-10-20 03:10:08,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:08,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693457719] [2020-10-20 03:10:08,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:08,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:10:08,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026027291] [2020-10-20 03:10:08,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 03:10:08,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:08,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 03:10:08,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:10:08,401 INFO L87 Difference]: Start difference. First operand 266 states and 518 transitions. Second operand 10 states. [2020-10-20 03:10:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:08,799 INFO L93 Difference]: Finished difference Result 367 states and 686 transitions. [2020-10-20 03:10:08,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 03:10:08,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-20 03:10:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:08,802 INFO L225 Difference]: With dead ends: 367 [2020-10-20 03:10:08,802 INFO L226 Difference]: Without dead ends: 338 [2020-10-20 03:10:08,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-10-20 03:10:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-10-20 03:10:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 258. [2020-10-20 03:10:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-10-20 03:10:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 514 transitions. [2020-10-20 03:10:08,810 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 514 transitions. Word has length 22 [2020-10-20 03:10:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:08,811 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 514 transitions. [2020-10-20 03:10:08,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 03:10:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 514 transitions. [2020-10-20 03:10:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:08,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:08,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:08,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 03:10:08,812 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:08,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:08,812 INFO L82 PathProgramCache]: Analyzing trace with hash 783436301, now seen corresponding path program 6 times [2020-10-20 03:10:08,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:08,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340307979] [2020-10-20 03:10:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:09,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340307979] [2020-10-20 03:10:09,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:09,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:09,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506178915] [2020-10-20 03:10:09,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:09,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:09,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:09,454 INFO L87 Difference]: Start difference. First operand 258 states and 514 transitions. Second operand 14 states. [2020-10-20 03:10:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:10,346 INFO L93 Difference]: Finished difference Result 284 states and 551 transitions. [2020-10-20 03:10:10,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 03:10:10,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:10,350 INFO L225 Difference]: With dead ends: 284 [2020-10-20 03:10:10,350 INFO L226 Difference]: Without dead ends: 267 [2020-10-20 03:10:10,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-10-20 03:10:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-10-20 03:10:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2020-10-20 03:10:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-10-20 03:10:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 520 transitions. [2020-10-20 03:10:10,357 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 520 transitions. Word has length 22 [2020-10-20 03:10:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:10,357 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 520 transitions. [2020-10-20 03:10:10,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 520 transitions. [2020-10-20 03:10:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:10,358 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:10,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:10,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 03:10:10,359 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash -617705459, now seen corresponding path program 7 times [2020-10-20 03:10:10,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:10,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860919560] [2020-10-20 03:10:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:10,737 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2020-10-20 03:10:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:11,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860919560] [2020-10-20 03:10:11,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:11,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:11,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847861574] [2020-10-20 03:10:11,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:11,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:11,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:11,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:11,323 INFO L87 Difference]: Start difference. First operand 262 states and 520 transitions. Second operand 14 states. [2020-10-20 03:10:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:12,270 INFO L93 Difference]: Finished difference Result 273 states and 531 transitions. [2020-10-20 03:10:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:12,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:12,273 INFO L225 Difference]: With dead ends: 273 [2020-10-20 03:10:12,273 INFO L226 Difference]: Without dead ends: 244 [2020-10-20 03:10:12,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-10-20 03:10:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2020-10-20 03:10:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-10-20 03:10:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 491 transitions. [2020-10-20 03:10:12,280 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 491 transitions. Word has length 22 [2020-10-20 03:10:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:12,280 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 491 transitions. [2020-10-20 03:10:12,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 491 transitions. [2020-10-20 03:10:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:12,281 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:12,281 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:12,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 03:10:12,282 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash 207084251, now seen corresponding path program 8 times [2020-10-20 03:10:12,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:12,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102255446] [2020-10-20 03:10:12,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:13,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-10-20 03:10:13,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102255446] [2020-10-20 03:10:13,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:13,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:13,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103854692] [2020-10-20 03:10:13,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:13,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:13,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:13,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:13,062 INFO L87 Difference]: Start difference. First operand 244 states and 491 transitions. Second operand 14 states. [2020-10-20 03:10:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:13,955 INFO L93 Difference]: Finished difference Result 290 states and 574 transitions. [2020-10-20 03:10:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:13,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:13,958 INFO L225 Difference]: With dead ends: 290 [2020-10-20 03:10:13,958 INFO L226 Difference]: Without dead ends: 262 [2020-10-20 03:10:13,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-10-20 03:10:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 243. [2020-10-20 03:10:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-20 03:10:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 489 transitions. [2020-10-20 03:10:13,965 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 489 transitions. Word has length 22 [2020-10-20 03:10:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:13,965 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 489 transitions. [2020-10-20 03:10:13,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 489 transitions. [2020-10-20 03:10:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:13,966 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:13,966 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:13,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 03:10:13,966 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:13,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:13,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1428834009, now seen corresponding path program 9 times [2020-10-20 03:10:13,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:13,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784621322] [2020-10-20 03:10:13,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:14,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784621322] [2020-10-20 03:10:14,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:14,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:14,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003695179] [2020-10-20 03:10:14,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:14,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:14,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:14,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:14,737 INFO L87 Difference]: Start difference. First operand 243 states and 489 transitions. Second operand 14 states. [2020-10-20 03:10:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:15,564 INFO L93 Difference]: Finished difference Result 313 states and 617 transitions. [2020-10-20 03:10:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:15,565 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:15,575 INFO L225 Difference]: With dead ends: 313 [2020-10-20 03:10:15,575 INFO L226 Difference]: Without dead ends: 286 [2020-10-20 03:10:15,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-10-20 03:10:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 247. [2020-10-20 03:10:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-20 03:10:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 495 transitions. [2020-10-20 03:10:15,582 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 495 transitions. Word has length 22 [2020-10-20 03:10:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:15,583 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 495 transitions. [2020-10-20 03:10:15,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 495 transitions. [2020-10-20 03:10:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:15,584 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:15,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:15,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 03:10:15,584 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:15,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:15,585 INFO L82 PathProgramCache]: Analyzing trace with hash -251837041, now seen corresponding path program 10 times [2020-10-20 03:10:15,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:15,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294631853] [2020-10-20 03:10:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:16,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294631853] [2020-10-20 03:10:16,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:16,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:16,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299743894] [2020-10-20 03:10:16,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:16,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:16,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:16,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:16,329 INFO L87 Difference]: Start difference. First operand 247 states and 495 transitions. Second operand 14 states. [2020-10-20 03:10:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:17,194 INFO L93 Difference]: Finished difference Result 305 states and 600 transitions. [2020-10-20 03:10:17,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:17,198 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:17,200 INFO L225 Difference]: With dead ends: 305 [2020-10-20 03:10:17,200 INFO L226 Difference]: Without dead ends: 276 [2020-10-20 03:10:17,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-10-20 03:10:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 251. [2020-10-20 03:10:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-10-20 03:10:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 501 transitions. [2020-10-20 03:10:17,207 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 501 transitions. Word has length 22 [2020-10-20 03:10:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:17,207 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 501 transitions. [2020-10-20 03:10:17,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:17,207 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 501 transitions. [2020-10-20 03:10:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:17,208 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:17,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:17,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 03:10:17,209 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:17,210 INFO L82 PathProgramCache]: Analyzing trace with hash 754971535, now seen corresponding path program 11 times [2020-10-20 03:10:17,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:17,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856250476] [2020-10-20 03:10:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:17,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856250476] [2020-10-20 03:10:17,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:17,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:17,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399331111] [2020-10-20 03:10:17,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:17,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:17,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:17,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:17,824 INFO L87 Difference]: Start difference. First operand 251 states and 501 transitions. Second operand 14 states. [2020-10-20 03:10:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:18,683 INFO L93 Difference]: Finished difference Result 296 states and 580 transitions. [2020-10-20 03:10:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 03:10:18,683 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:18,685 INFO L225 Difference]: With dead ends: 296 [2020-10-20 03:10:18,685 INFO L226 Difference]: Without dead ends: 279 [2020-10-20 03:10:18,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-10-20 03:10:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-10-20 03:10:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 255. [2020-10-20 03:10:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-10-20 03:10:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 507 transitions. [2020-10-20 03:10:18,692 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 507 transitions. Word has length 22 [2020-10-20 03:10:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:18,693 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 507 transitions. [2020-10-20 03:10:18,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 507 transitions. [2020-10-20 03:10:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:18,694 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:18,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:18,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 03:10:18,695 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:18,695 INFO L82 PathProgramCache]: Analyzing trace with hash -646170225, now seen corresponding path program 12 times [2020-10-20 03:10:18,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:18,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608326613] [2020-10-20 03:10:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:19,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608326613] [2020-10-20 03:10:19,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:19,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:19,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887471992] [2020-10-20 03:10:19,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:19,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:19,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:19,412 INFO L87 Difference]: Start difference. First operand 255 states and 507 transitions. Second operand 14 states. [2020-10-20 03:10:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:20,222 INFO L93 Difference]: Finished difference Result 285 states and 560 transitions. [2020-10-20 03:10:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:20,223 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:20,225 INFO L225 Difference]: With dead ends: 285 [2020-10-20 03:10:20,225 INFO L226 Difference]: Without dead ends: 260 [2020-10-20 03:10:20,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-10-20 03:10:20,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 241. [2020-10-20 03:10:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-10-20 03:10:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 485 transitions. [2020-10-20 03:10:20,232 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 485 transitions. Word has length 22 [2020-10-20 03:10:20,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:20,232 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 485 transitions. [2020-10-20 03:10:20,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 485 transitions. [2020-10-20 03:10:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:20,234 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:20,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:20,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 03:10:20,234 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:20,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1326801883, now seen corresponding path program 13 times [2020-10-20 03:10:20,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:20,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237484775] [2020-10-20 03:10:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:20,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237484775] [2020-10-20 03:10:20,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:20,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:20,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734468847] [2020-10-20 03:10:20,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:20,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:20,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:20,950 INFO L87 Difference]: Start difference. First operand 241 states and 485 transitions. Second operand 14 states. [2020-10-20 03:10:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:21,893 INFO L93 Difference]: Finished difference Result 351 states and 690 transitions. [2020-10-20 03:10:21,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:21,893 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:21,896 INFO L225 Difference]: With dead ends: 351 [2020-10-20 03:10:21,896 INFO L226 Difference]: Without dead ends: 324 [2020-10-20 03:10:21,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-10-20 03:10:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 242. [2020-10-20 03:10:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-20 03:10:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 486 transitions. [2020-10-20 03:10:21,903 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 486 transitions. Word has length 22 [2020-10-20 03:10:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:21,903 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 486 transitions. [2020-10-20 03:10:21,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 486 transitions. [2020-10-20 03:10:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:21,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:21,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:21,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 03:10:21,905 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash -149804915, now seen corresponding path program 14 times [2020-10-20 03:10:21,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:21,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981680943] [2020-10-20 03:10:21,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:22,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981680943] [2020-10-20 03:10:22,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:22,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:22,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208733571] [2020-10-20 03:10:22,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:22,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:22,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:22,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:22,562 INFO L87 Difference]: Start difference. First operand 242 states and 486 transitions. Second operand 14 states. [2020-10-20 03:10:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:23,473 INFO L93 Difference]: Finished difference Result 343 states and 673 transitions. [2020-10-20 03:10:23,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:23,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:23,476 INFO L225 Difference]: With dead ends: 343 [2020-10-20 03:10:23,476 INFO L226 Difference]: Without dead ends: 314 [2020-10-20 03:10:23,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-20 03:10:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 246. [2020-10-20 03:10:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-10-20 03:10:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 492 transitions. [2020-10-20 03:10:23,483 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 492 transitions. Word has length 22 [2020-10-20 03:10:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:23,483 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 492 transitions. [2020-10-20 03:10:23,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 492 transitions. [2020-10-20 03:10:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:23,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:23,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:23,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 03:10:23,485 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:23,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:23,485 INFO L82 PathProgramCache]: Analyzing trace with hash 857003661, now seen corresponding path program 15 times [2020-10-20 03:10:23,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:23,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232997722] [2020-10-20 03:10:23,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:24,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232997722] [2020-10-20 03:10:24,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:24,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:24,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793974667] [2020-10-20 03:10:24,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:24,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:24,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:24,112 INFO L87 Difference]: Start difference. First operand 246 states and 492 transitions. Second operand 14 states. [2020-10-20 03:10:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:25,015 INFO L93 Difference]: Finished difference Result 334 states and 653 transitions. [2020-10-20 03:10:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 03:10:25,016 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:25,018 INFO L225 Difference]: With dead ends: 334 [2020-10-20 03:10:25,018 INFO L226 Difference]: Without dead ends: 317 [2020-10-20 03:10:25,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-10-20 03:10:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-10-20 03:10:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 250. [2020-10-20 03:10:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-20 03:10:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 498 transitions. [2020-10-20 03:10:25,025 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 498 transitions. Word has length 22 [2020-10-20 03:10:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:25,025 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 498 transitions. [2020-10-20 03:10:25,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 498 transitions. [2020-10-20 03:10:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:25,026 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:25,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:25,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 03:10:25,027 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:25,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash -544138099, now seen corresponding path program 16 times [2020-10-20 03:10:25,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:25,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190009911] [2020-10-20 03:10:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:25,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190009911] [2020-10-20 03:10:25,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:25,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:25,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318467401] [2020-10-20 03:10:25,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:25,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:25,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:25,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:25,712 INFO L87 Difference]: Start difference. First operand 250 states and 498 transitions. Second operand 14 states. [2020-10-20 03:10:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:26,532 INFO L93 Difference]: Finished difference Result 323 states and 633 transitions. [2020-10-20 03:10:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:26,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:26,535 INFO L225 Difference]: With dead ends: 323 [2020-10-20 03:10:26,535 INFO L226 Difference]: Without dead ends: 290 [2020-10-20 03:10:26,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-10-20 03:10:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 228. [2020-10-20 03:10:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-10-20 03:10:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 463 transitions. [2020-10-20 03:10:26,540 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 463 transitions. Word has length 22 [2020-10-20 03:10:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:26,540 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 463 transitions. [2020-10-20 03:10:26,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 463 transitions. [2020-10-20 03:10:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:26,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:26,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:26,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 03:10:26,542 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:26,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash -618210351, now seen corresponding path program 17 times [2020-10-20 03:10:26,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:26,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258643195] [2020-10-20 03:10:26,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:26,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258643195] [2020-10-20 03:10:26,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:26,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:10:26,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921218507] [2020-10-20 03:10:26,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:10:26,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:26,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:10:26,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:10:26,633 INFO L87 Difference]: Start difference. First operand 228 states and 463 transitions. Second operand 6 states. [2020-10-20 03:10:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:26,700 INFO L93 Difference]: Finished difference Result 128 states and 203 transitions. [2020-10-20 03:10:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:10:26,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-20 03:10:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:26,701 INFO L225 Difference]: With dead ends: 128 [2020-10-20 03:10:26,702 INFO L226 Difference]: Without dead ends: 128 [2020-10-20 03:10:26,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:10:26,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-20 03:10:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-10-20 03:10:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-20 03:10:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2020-10-20 03:10:26,706 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 203 transitions. Word has length 22 [2020-10-20 03:10:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:26,706 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 203 transitions. [2020-10-20 03:10:26,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:10:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 203 transitions. [2020-10-20 03:10:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:26,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:26,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:26,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 03:10:26,708 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1321574743, now seen corresponding path program 18 times [2020-10-20 03:10:26,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:26,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909626499] [2020-10-20 03:10:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:27,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909626499] [2020-10-20 03:10:27,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:27,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:27,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310462831] [2020-10-20 03:10:27,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:27,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:27,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:27,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:27,391 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. Second operand 14 states. [2020-10-20 03:10:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:28,221 INFO L93 Difference]: Finished difference Result 159 states and 248 transitions. [2020-10-20 03:10:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:28,222 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:28,223 INFO L225 Difference]: With dead ends: 159 [2020-10-20 03:10:28,223 INFO L226 Difference]: Without dead ends: 129 [2020-10-20 03:10:28,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-20 03:10:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2020-10-20 03:10:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-20 03:10:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 201 transitions. [2020-10-20 03:10:28,226 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 201 transitions. Word has length 22 [2020-10-20 03:10:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:28,226 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 201 transitions. [2020-10-20 03:10:28,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 201 transitions. [2020-10-20 03:10:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:28,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:28,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:28,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 03:10:28,227 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:28,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:28,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1537379531, now seen corresponding path program 19 times [2020-10-20 03:10:28,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:28,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682257090] [2020-10-20 03:10:28,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:28,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682257090] [2020-10-20 03:10:28,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:28,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:28,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214446380] [2020-10-20 03:10:28,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:28,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:28,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:28,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:28,857 INFO L87 Difference]: Start difference. First operand 128 states and 201 transitions. Second operand 14 states. [2020-10-20 03:10:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:29,618 INFO L93 Difference]: Finished difference Result 156 states and 243 transitions. [2020-10-20 03:10:29,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:29,618 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:29,619 INFO L225 Difference]: With dead ends: 156 [2020-10-20 03:10:29,619 INFO L226 Difference]: Without dead ends: 128 [2020-10-20 03:10:29,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-20 03:10:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-10-20 03:10:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-20 03:10:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 200 transitions. [2020-10-20 03:10:29,623 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 200 transitions. Word has length 22 [2020-10-20 03:10:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:29,623 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 200 transitions. [2020-10-20 03:10:29,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 200 transitions. [2020-10-20 03:10:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:29,624 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:29,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:29,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-20 03:10:29,624 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash -98538729, now seen corresponding path program 20 times [2020-10-20 03:10:29,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:29,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208477670] [2020-10-20 03:10:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:30,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208477670] [2020-10-20 03:10:30,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:30,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:30,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796238138] [2020-10-20 03:10:30,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:30,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:30,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:30,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:30,239 INFO L87 Difference]: Start difference. First operand 128 states and 200 transitions. Second operand 14 states. [2020-10-20 03:10:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:30,987 INFO L93 Difference]: Finished difference Result 167 states and 262 transitions. [2020-10-20 03:10:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:30,988 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:30,989 INFO L225 Difference]: With dead ends: 167 [2020-10-20 03:10:30,989 INFO L226 Difference]: Without dead ends: 140 [2020-10-20 03:10:30,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-20 03:10:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2020-10-20 03:10:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-20 03:10:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 198 transitions. [2020-10-20 03:10:30,994 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 198 transitions. Word has length 22 [2020-10-20 03:10:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:30,995 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 198 transitions. [2020-10-20 03:10:30,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 198 transitions. [2020-10-20 03:10:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:30,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:30,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:30,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-20 03:10:30,997 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:30,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1078458239, now seen corresponding path program 21 times [2020-10-20 03:10:30,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:30,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864147299] [2020-10-20 03:10:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:31,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864147299] [2020-10-20 03:10:31,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:31,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:31,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187313043] [2020-10-20 03:10:31,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:31,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:31,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:31,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:31,637 INFO L87 Difference]: Start difference. First operand 128 states and 198 transitions. Second operand 14 states. [2020-10-20 03:10:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:32,416 INFO L93 Difference]: Finished difference Result 159 states and 245 transitions. [2020-10-20 03:10:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:32,416 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:32,417 INFO L225 Difference]: With dead ends: 159 [2020-10-20 03:10:32,417 INFO L226 Difference]: Without dead ends: 130 [2020-10-20 03:10:32,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-20 03:10:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2020-10-20 03:10:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-20 03:10:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2020-10-20 03:10:32,420 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 22 [2020-10-20 03:10:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:32,420 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2020-10-20 03:10:32,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2020-10-20 03:10:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:32,421 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:32,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:32,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-20 03:10:32,421 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2085266815, now seen corresponding path program 22 times [2020-10-20 03:10:32,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:32,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826200605] [2020-10-20 03:10:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:33,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826200605] [2020-10-20 03:10:33,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:33,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:33,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306383359] [2020-10-20 03:10:33,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:33,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:33,173 INFO L87 Difference]: Start difference. First operand 127 states and 194 transitions. Second operand 14 states. [2020-10-20 03:10:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:34,216 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2020-10-20 03:10:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 03:10:34,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:34,218 INFO L225 Difference]: With dead ends: 151 [2020-10-20 03:10:34,218 INFO L226 Difference]: Without dead ends: 134 [2020-10-20 03:10:34,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-20 03:10:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-20 03:10:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2020-10-20 03:10:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-20 03:10:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2020-10-20 03:10:34,222 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 22 [2020-10-20 03:10:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:34,222 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2020-10-20 03:10:34,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2020-10-20 03:10:34,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:34,223 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:34,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:34,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-20 03:10:34,224 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:34,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:34,224 INFO L82 PathProgramCache]: Analyzing trace with hash 684125055, now seen corresponding path program 23 times [2020-10-20 03:10:34,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:34,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989494774] [2020-10-20 03:10:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:34,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989494774] [2020-10-20 03:10:34,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:34,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:34,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140273255] [2020-10-20 03:10:34,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:34,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:34,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:34,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:34,886 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand 14 states. [2020-10-20 03:10:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:35,593 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2020-10-20 03:10:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:35,594 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:35,595 INFO L225 Difference]: With dead ends: 139 [2020-10-20 03:10:35,595 INFO L226 Difference]: Without dead ends: 110 [2020-10-20 03:10:35,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-20 03:10:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-10-20 03:10:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 03:10:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2020-10-20 03:10:35,598 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 22 [2020-10-20 03:10:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:35,598 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2020-10-20 03:10:35,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2020-10-20 03:10:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:35,598 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:35,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:35,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-20 03:10:35,599 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:35,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:35,599 INFO L82 PathProgramCache]: Analyzing trace with hash 374516555, now seen corresponding path program 24 times [2020-10-20 03:10:35,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:35,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33053040] [2020-10-20 03:10:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:36,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33053040] [2020-10-20 03:10:36,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:36,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:36,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504827635] [2020-10-20 03:10:36,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:36,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:36,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:36,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:36,227 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand 14 states. [2020-10-20 03:10:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:37,000 INFO L93 Difference]: Finished difference Result 101 states and 151 transitions. [2020-10-20 03:10:37,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:37,005 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:37,006 INFO L225 Difference]: With dead ends: 101 [2020-10-20 03:10:37,006 INFO L226 Difference]: Without dead ends: 71 [2020-10-20 03:10:37,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-20 03:10:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-20 03:10:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-20 03:10:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2020-10-20 03:10:37,009 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 22 [2020-10-20 03:10:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:37,009 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2020-10-20 03:10:37,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2020-10-20 03:10:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:37,010 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:37,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:37,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-20 03:10:37,012 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:37,013 INFO L82 PathProgramCache]: Analyzing trace with hash -983508743, now seen corresponding path program 25 times [2020-10-20 03:10:37,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:37,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655351811] [2020-10-20 03:10:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:37,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655351811] [2020-10-20 03:10:37,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:37,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:37,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232013041] [2020-10-20 03:10:37,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:37,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:37,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:37,640 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 14 states. [2020-10-20 03:10:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:38,325 INFO L93 Difference]: Finished difference Result 87 states and 121 transitions. [2020-10-20 03:10:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:38,326 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:38,327 INFO L225 Difference]: With dead ends: 87 [2020-10-20 03:10:38,327 INFO L226 Difference]: Without dead ends: 87 [2020-10-20 03:10:38,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-20 03:10:38,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2020-10-20 03:10:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-20 03:10:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2020-10-20 03:10:38,330 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 22 [2020-10-20 03:10:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:38,331 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2020-10-20 03:10:38,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2020-10-20 03:10:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:38,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:38,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:38,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-20 03:10:38,332 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash -983508788, now seen corresponding path program 3 times [2020-10-20 03:10:38,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:38,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366685580] [2020-10-20 03:10:38,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:38,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366685580] [2020-10-20 03:10:38,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:38,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 03:10:38,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165921093] [2020-10-20 03:10:38,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 03:10:38,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:38,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 03:10:38,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:10:38,496 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand 9 states. [2020-10-20 03:10:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:38,777 INFO L93 Difference]: Finished difference Result 111 states and 158 transitions. [2020-10-20 03:10:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:10:38,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-20 03:10:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:38,778 INFO L225 Difference]: With dead ends: 111 [2020-10-20 03:10:38,778 INFO L226 Difference]: Without dead ends: 95 [2020-10-20 03:10:38,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-20 03:10:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-10-20 03:10:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-20 03:10:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2020-10-20 03:10:38,781 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 22 [2020-10-20 03:10:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:38,782 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2020-10-20 03:10:38,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 03:10:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2020-10-20 03:10:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:38,782 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:38,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:38,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-20 03:10:38,783 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:38,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:38,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1609619909, now seen corresponding path program 26 times [2020-10-20 03:10:38,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:38,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193473427] [2020-10-20 03:10:38,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:39,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193473427] [2020-10-20 03:10:39,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:39,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:39,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4822101] [2020-10-20 03:10:39,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:39,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:39,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:39,443 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand 14 states. [2020-10-20 03:10:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:40,210 INFO L93 Difference]: Finished difference Result 126 states and 188 transitions. [2020-10-20 03:10:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:40,211 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:40,211 INFO L225 Difference]: With dead ends: 126 [2020-10-20 03:10:40,211 INFO L226 Difference]: Without dead ends: 84 [2020-10-20 03:10:40,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-20 03:10:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-10-20 03:10:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-20 03:10:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2020-10-20 03:10:40,214 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 22 [2020-10-20 03:10:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:40,214 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2020-10-20 03:10:40,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2020-10-20 03:10:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:40,215 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:40,215 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:40,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-20 03:10:40,215 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:40,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:40,216 INFO L82 PathProgramCache]: Analyzing trace with hash 468200473, now seen corresponding path program 2 times [2020-10-20 03:10:40,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:40,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891924123] [2020-10-20 03:10:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:40,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891924123] [2020-10-20 03:10:40,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:40,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 03:10:40,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970400485] [2020-10-20 03:10:40,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:10:40,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:40,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:10:40,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:10:40,314 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand 8 states. [2020-10-20 03:10:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:40,478 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2020-10-20 03:10:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:10:40,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-20 03:10:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:40,479 INFO L225 Difference]: With dead ends: 69 [2020-10-20 03:10:40,479 INFO L226 Difference]: Without dead ends: 69 [2020-10-20 03:10:40,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:10:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-20 03:10:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2020-10-20 03:10:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-20 03:10:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2020-10-20 03:10:40,482 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 22 [2020-10-20 03:10:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:40,482 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2020-10-20 03:10:40,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:10:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2020-10-20 03:10:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:40,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:40,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:40,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-20 03:10:40,483 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:40,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:40,483 INFO L82 PathProgramCache]: Analyzing trace with hash -411053783, now seen corresponding path program 27 times [2020-10-20 03:10:40,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:40,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342183231] [2020-10-20 03:10:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:41,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342183231] [2020-10-20 03:10:41,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:41,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:41,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989169943] [2020-10-20 03:10:41,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:41,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:41,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:41,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:41,114 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand 14 states. [2020-10-20 03:10:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:41,823 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2020-10-20 03:10:41,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 03:10:41,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:41,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:41,824 INFO L225 Difference]: With dead ends: 79 [2020-10-20 03:10:41,824 INFO L226 Difference]: Without dead ends: 66 [2020-10-20 03:10:41,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-10-20 03:10:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-20 03:10:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-10-20 03:10:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-20 03:10:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2020-10-20 03:10:41,827 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 22 [2020-10-20 03:10:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:41,827 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2020-10-20 03:10:41,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2020-10-20 03:10:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:41,828 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:41,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:41,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-20 03:10:41,829 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:41,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2098826979, now seen corresponding path program 28 times [2020-10-20 03:10:41,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:41,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627509993] [2020-10-20 03:10:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:42,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627509993] [2020-10-20 03:10:42,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:42,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:42,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135906654] [2020-10-20 03:10:42,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:42,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:42,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:42,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:42,446 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 14 states. [2020-10-20 03:10:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:43,096 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2020-10-20 03:10:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:43,096 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:43,097 INFO L225 Difference]: With dead ends: 66 [2020-10-20 03:10:43,097 INFO L226 Difference]: Without dead ends: 54 [2020-10-20 03:10:43,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-20 03:10:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-20 03:10:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-20 03:10:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-20 03:10:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2020-10-20 03:10:43,100 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 22 [2020-10-20 03:10:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:43,100 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2020-10-20 03:10:43,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2020-10-20 03:10:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:43,100 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:43,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:43,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-20 03:10:43,101 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:43,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1088468309, now seen corresponding path program 29 times [2020-10-20 03:10:43,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:43,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331496418] [2020-10-20 03:10:43,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:43,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331496418] [2020-10-20 03:10:43,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:43,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:43,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751126921] [2020-10-20 03:10:43,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:43,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:43,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:43,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:43,905 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand 14 states. [2020-10-20 03:10:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:44,584 INFO L93 Difference]: Finished difference Result 72 states and 101 transitions. [2020-10-20 03:10:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:44,585 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:44,586 INFO L225 Difference]: With dead ends: 72 [2020-10-20 03:10:44,586 INFO L226 Difference]: Without dead ends: 72 [2020-10-20 03:10:44,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-20 03:10:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-10-20 03:10:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-20 03:10:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2020-10-20 03:10:44,588 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 22 [2020-10-20 03:10:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:44,588 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2020-10-20 03:10:44,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2020-10-20 03:10:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:44,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:44,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:44,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-20 03:10:44,589 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:44,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1088468264, now seen corresponding path program 4 times [2020-10-20 03:10:44,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:44,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877915151] [2020-10-20 03:10:44,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:44,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877915151] [2020-10-20 03:10:44,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:44,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 03:10:44,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876536208] [2020-10-20 03:10:44,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 03:10:44,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:44,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 03:10:44,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:10:44,766 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand 9 states. [2020-10-20 03:10:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:44,964 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2020-10-20 03:10:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:10:44,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-20 03:10:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:44,966 INFO L225 Difference]: With dead ends: 70 [2020-10-20 03:10:44,966 INFO L226 Difference]: Without dead ends: 44 [2020-10-20 03:10:44,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-20 03:10:44,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-20 03:10:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-20 03:10:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2020-10-20 03:10:44,968 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 22 [2020-10-20 03:10:44,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:44,968 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2020-10-20 03:10:44,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 03:10:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2020-10-20 03:10:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:44,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:44,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:44,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-20 03:10:44,969 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:44,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:44,970 INFO L82 PathProgramCache]: Analyzing trace with hash 22133125, now seen corresponding path program 3 times [2020-10-20 03:10:44,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:44,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232868434] [2020-10-20 03:10:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:45,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232868434] [2020-10-20 03:10:45,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:45,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:45,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880845342] [2020-10-20 03:10:45,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-20 03:10:45,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:45,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 03:10:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-10-20 03:10:45,175 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand 13 states. [2020-10-20 03:10:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:45,518 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2020-10-20 03:10:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 03:10:45,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-10-20 03:10:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:45,520 INFO L225 Difference]: With dead ends: 44 [2020-10-20 03:10:45,520 INFO L226 Difference]: Without dead ends: 35 [2020-10-20 03:10:45,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2020-10-20 03:10:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-20 03:10:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-20 03:10:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 03:10:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-10-20 03:10:45,522 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2020-10-20 03:10:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:45,522 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-10-20 03:10:45,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-20 03:10:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-10-20 03:10:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:45,522 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:45,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:45,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-20 03:10:45,523 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash 913881587, now seen corresponding path program 30 times [2020-10-20 03:10:45,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:45,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197139699] [2020-10-20 03:10:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:46,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197139699] [2020-10-20 03:10:46,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:46,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:46,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309078516] [2020-10-20 03:10:46,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:46,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:46,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:46,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:46,144 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 14 states. [2020-10-20 03:10:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:46,710 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-10-20 03:10:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:46,711 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:46,712 INFO L225 Difference]: With dead ends: 42 [2020-10-20 03:10:46,712 INFO L226 Difference]: Without dead ends: 34 [2020-10-20 03:10:46,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-20 03:10:46,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-20 03:10:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-20 03:10:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-10-20 03:10:46,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 22 [2020-10-20 03:10:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:46,714 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-20 03:10:46,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-10-20 03:10:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:46,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:46,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:46,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-20 03:10:46,715 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:46,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:46,716 INFO L82 PathProgramCache]: Analyzing trace with hash -92005337, now seen corresponding path program 31 times [2020-10-20 03:10:46,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:46,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202140141] [2020-10-20 03:10:46,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:10:47,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202140141] [2020-10-20 03:10:47,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:47,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 03:10:47,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213188006] [2020-10-20 03:10:47,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 03:10:47,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:47,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 03:10:47,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-20 03:10:47,317 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 14 states. [2020-10-20 03:10:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:47,808 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-10-20 03:10:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:47,808 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 03:10:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:47,809 INFO L225 Difference]: With dead ends: 33 [2020-10-20 03:10:47,809 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 03:10:47,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-10-20 03:10:47,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 03:10:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 03:10:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 03:10:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 03:10:47,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-20 03:10:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:47,810 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 03:10:47,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 03:10:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 03:10:47,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 03:10:47,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-20 03:10:47,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:10:47 BasicIcfg [2020-10-20 03:10:47,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:10:47,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:10:47,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:10:47,815 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:10:47,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:09:32" (3/4) ... [2020-10-20 03:10:47,818 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 03:10:47,826 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2020-10-20 03:10:47,832 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2020-10-20 03:10:47,833 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-10-20 03:10:47,833 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 03:10:47,833 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 03:10:47,906 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:10:47,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:10:47,908 INFO L168 Benchmark]: Toolchain (without parser) took 77944.04 ms. Allocated memory was 36.2 MB in the beginning and 239.6 MB in the end (delta: 203.4 MB). Free memory was 7.0 MB in the beginning and 63.6 MB in the end (delta: -56.6 MB). Peak memory consumption was 146.9 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:47,908 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 36.2 MB. Free memory is still 15.2 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 03:10:47,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1523.58 ms. Allocated memory was 36.2 MB in the beginning and 66.6 MB in the end (delta: 30.4 MB). Free memory was 6.2 MB in the beginning and 34.4 MB in the end (delta: -28.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:47,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.08 ms. Allocated memory is still 66.6 MB. Free memory was 34.4 MB in the beginning and 30.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:47,909 INFO L168 Benchmark]: Boogie Preprocessor took 45.58 ms. Allocated memory is still 66.6 MB. Free memory was 30.6 MB in the beginning and 27.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:47,910 INFO L168 Benchmark]: RCFGBuilder took 783.87 ms. Allocated memory was 66.6 MB in the beginning and 72.9 MB in the end (delta: 6.3 MB). Free memory was 27.9 MB in the beginning and 40.2 MB in the end (delta: -12.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:47,911 INFO L168 Benchmark]: TraceAbstraction took 75389.04 ms. Allocated memory was 72.9 MB in the beginning and 239.6 MB in the end (delta: 166.7 MB). Free memory was 39.5 MB in the beginning and 67.5 MB in the end (delta: -28.0 MB). Peak memory consumption was 138.8 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:47,911 INFO L168 Benchmark]: Witness Printer took 91.61 ms. Allocated memory is still 239.6 MB. Free memory was 67.5 MB in the beginning and 63.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:47,919 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.75 ms. Allocated memory is still 36.2 MB. Free memory is still 15.2 MB. There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 1523.58 ms. Allocated memory was 36.2 MB in the beginning and 66.6 MB in the end (delta: 30.4 MB). Free memory was 6.2 MB in the beginning and 34.4 MB in the end (delta: -28.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 101.08 ms. Allocated memory is still 66.6 MB. Free memory was 34.4 MB in the beginning and 30.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 45.58 ms. Allocated memory is still 66.6 MB. Free memory was 30.6 MB in the beginning and 27.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 783.87 ms. Allocated memory was 66.6 MB in the beginning and 72.9 MB in the end (delta: 6.3 MB). Free memory was 27.9 MB in the beginning and 40.2 MB in the end (delta: -12.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 14.3 GB. * TraceAbstraction took 75389.04 ms. Allocated memory was 72.9 MB in the beginning and 239.6 MB in the end (delta: 166.7 MB). Free memory was 39.5 MB in the beginning and 67.5 MB in the end (delta: -28.0 MB). Peak memory consumption was 138.8 MB. Max. memory is 14.3 GB. * Witness Printer took 91.61 ms. Allocated memory is still 239.6 MB. Free memory was 67.5 MB in the beginning and 63.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2408 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 7 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 15.5s, 156 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 25.5s, 179 PlacesBefore, 41 PlacesAfterwards, 189 TransitionsBefore, 40 TransitionsAfterwards, 3444 CoEnabledTransitionPairs, 8 FixpointIterations, 116 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 27 ConcurrentYvCompositions, 11 ChoiceCompositions, 237 TotalNumberOfCompositions, 7933 MoverChecksTotal - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 158 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 75.2s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.5s, HoareTripleCheckerStatistics: 1024 SDtfs, 1805 SDslu, 4572 SDs, 0 SdLazy, 11554 SolverSat, 889 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 763 GetRequests, 26 SyntacticMatches, 72 SemanticMatches, 665 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 29.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 42 MinimizatonAttempts, 758 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 857 NumberOfCodeBlocks, 857 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 367248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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 proved your program to be correct! Received shutdown request...